Sciweavers

4616 search results - page 609 / 924
» The Communication Complexity of Correlation
Sort
View
VTC
2010
IEEE
113views Communications» more  VTC 2010»
15 years 6 months ago
Design of Fixed-Point Processing Based Turbo Codes Using Extrinsic Information Transfer Charts
—The operand-width specifications in fixed-point hardware implementations of turbo code decoders is an important design issue, since this governs the trade-off between the deco...
Liang Li, Robert G. Maunder, Bashir M. Al-Hashimi,...
GLOBECOM
2010
IEEE
15 years 5 months ago
An Exit-Chart Aided Design Procedure for Near-Capacity N-Component Parallel Concatenated Codes
1 Shannon's channel capacity specifies the upper bound on the amount of bits per channel use. In this paper, we explicitly demonstrate that twin-component turbo codes suffer f...
Hong Chen, Robert G. Maunder, Lajos Hanzo
GLOBECOM
2010
IEEE
15 years 5 months ago
Layered Tabu Search Algorithm for Large-MIMO Detection and a Lower Bound on ML Performance
In this paper, we are concerned with low-complexity detection in large multiple-input multiple-output (MIMO) systems with tens of transmit/receive antennas. Our new contributions i...
N. Srinidhi, Tanumay Datta, Ananthanarayanan Chock...
GLOBECOM
2010
IEEE
15 years 5 months ago
A Tunnel-Aware Language for Network Packet Filtering
While in computer networks the number of possible protocol encapsulations is growing day after day, network administrators face ever increasing difficulties in selecting accurately...
Luigi Ciminiera, Marco Leogrande, Ju Liu, Fulvio R...
INFOCOM
2010
IEEE
15 years 5 months ago
Haste: Practical Online Network Coding in a Multicast Switch
The use of network coding has been shown to improve throughput in input-queued multicast switches, but not without costs of computational complexity and delays. In this paper, we i...
Shuang Yang, Xin Wang, Baochun Li