Achieving near-capacity on a multiple-antenna channel
Top Cited Papers
- 22 April 2003
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 51 (3) , 389-399
- https://doi.org/10.1109/tcomm.2003.809789
Abstract
Recent advancements in iterative processing of channel codes and the development of turbo codes have allowed the communications industry to achieve near-capacity on a single-antenna Gaussian or fading channel with low complexity. We show how these iterative techniques can also be used to achieve near-capacity on a multiple-antenna system where the receiver knows the channel. Combining iterative processing with multiple-antenna channels is particularly challenging because the channel capacities can be a factor of ten or more higher than their single-antenna counterparts. Using a "list" version of the sphere decoder, we provide a simple method to iteratively detect and decode any linear space-time mapping combined with any channel code that can be decoded using so-called "soft" inputs and outputs. We exemplify our technique by directly transmitting symbols that are coded with a channel code; we show that iterative processing with even this simple scheme can achieve near-capacity. We consider both simple convolutional and powerful turbo channel codes and show that excellent performance at very high data rates can be attained with either. We compare our simulation results with Shannon capacity limits for ergodic multiple-antenna channel.Keywords
This publication has 26 references indexed in Scilit:
- TURBO-BLAST for high-speed wireless communicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Cayley differential unitary space-time codesIEEE Transactions on Information Theory, 2002
- Space-time turbo codes with full antenna diversityIEEE Transactions on Communications, 2001
- Space-time bit-interleaved coded modulation with an iterative decoding strategyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2000
- Turbo space-time processing to improve wireless channel capacityIEEE Transactions on Communications, 2000
- A universal lattice code decoder for fading channelsIEEE Transactions on Information Theory, 1999
- Detection algorithm and initial laboratory resultsusing V-BLAST space-time communication architectureElectronics Letters, 1999
- Sphere Packings, Lattices and GroupsPublished by Springer Nature ,1988
- On the computation of lattice vectors of minimal length, successive minima and reduced bases with applicationsACM SIGSAM Bulletin, 1981
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948