The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Achieving near-capacity on a multiple-antenna channel
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
A simple transmit diversity technique for wireless communications
Alamouti, S. M. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.730453 · Cited by 12,784
Capacity of Multi‐antenna Gaussian Channels
Telatar, E. (1999) · European Transactions on Telecommunications · doi:10.1002/ett.4460100604 · Cited by 11,234
Tarokh, V., Seshadri, N., & Calderbank, A. R. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.661517 · Cited by 7,039
Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
Berrou, C., Glavieux, A., & Thitimajshima, P. (2002) · Proceedings of ICC '93 - IEEE International Conference on Communications · doi:10.1109/icc.1993.397441 · Cited by 6,738
Foschini, G. J. (2002) · Bell Labs Technical Journal · doi:10.1002/bltj.2015 · Cited by 6,205
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
Bahl, L., Cocke, J., Jelinek, F., & Raviv, J. (1974) · IEEE Transactions on Information Theory · doi:10.1109/tit.1974.1055186 · Cited by 5,208
Optimal decoding of linear codes for minimizing symbol error rate
Bahl, L. R. (1974) · IEEE Transactions on Information Theory · Cited by 4,665
Near Shannon limit error-correcting coding and decoding : Turbo-codes
Berrou, C. (1993) · International Conference on Communications · Cited by 4,264
Sphere Packings, Lattices and Groups.
Coxeter, H. S. M., Conway, J. H., & Sloane, N. J. A. (1989) · The American Mathematical Monthly · doi:10.2307/2323992 · Cited by 3,377
Iterative decoding of binary block and convolutional codes
Hagenauer, J., Offer, E., & Papke, L. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.485714 · Cited by 2,303
Principles of Communication Engineering
Jacobs, I. M., & Wozencraft, J. M. (1965) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,912
A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain
Robertson, P., Villebrun, E., & Hoeher, P. (2002) · Proceedings IEEE International Conference on Communications ICC '95 · doi:10.1109/icc.1995.524253 · Cited by 1,695
Golden, G. D., Foschini, C. J., Valenzuela, R. A., et al. (1999) · Electronics Letters · doi:10.1049/el:19990058 · Cited by 1,636
Sphere Packings, Lattices and Groups
Conway, J. H., & Sloane, N. J. A. (1988) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-1-4757-2016-7 · Cited by 1,532
A universal lattice code decoder for fading channels
Viterbo, E., & Bouros, J. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.771234 · Cited by 1,513
Fincke, U., & Pohst, M. (1985) · Mathematics of Computation · doi:10.1090/s0025-5718-1985-0777278-8 · Cited by 1,458
Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding
Benedetto, S., Divsalar, D., Montorsi, G., & Pollara, F. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.669119 · Cited by 1,261
Unitary space-time modulation for multiple-antenna communications in Rayleigh flat fading
Hochwald, B. M., & Marzetta, T. L. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.825818 · Cited by 1,027
Self-citationOn the theory of space-time codes for PSK modulation
Hammons, A. R., & Gamal, H. E. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.825816 · Cited by 360
Pohst, M. (1981) · ACM SIGSAM Bulletin · doi:10.1145/1089242.1089247 · Cited by 352
Cited by
On the Road to 6G: Visions, Requirements, Key Technologies, and Testbeds
Wang, C.-X., You, X., Gao, X., Zhu, X., Li, Z., Zhang, C., Wang, H., Huang, Y., Chen, Y., Haas, H., et al. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3249835 · Cited by 2,336
Marzetta, T. L., Larsson, E. G., Yang, H., & Ngo, H. Q. (2016) · Cambridge University Press eBooks · doi:10.1017/cbo9781316799895 · Cited by 1,718
Space-Time Block Coding for Wireless Communications
Larsson, E. G., & Stoica, P. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511550065 · Cited by 1,035
Exploiting Multi-Antennas for Opportunistic Spectrum Sharing in Cognitive Radio Networks
Zhang, R., & Liang, Y.-C. (2008) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.914894 · Cited by 834
Fifty Years of MIMO Detection: The Road to Large-Scale MIMOs
Yang, S., & Hanzo, L. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2475242 · Cited by 814
Metadata
- Authors
- Hochwald, B. M., & ten Brink, S.
- Venue
- IEEE Transactions on Communications
- Published
- 2003-03
- Volume
- 51
- Issue
- 3
- Pages
- 389-399
- ISSN
- 0090-6778 (ISSN-L)
- OpenAlex
- W2112772743
- Cited by
- 2,033
- References
- 21
- FWCI
- 146.82
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.