The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
How much training is needed in multiple-antenna wireless links?
Abstract
Multiple-antenna wireless communication links promise very high data rates with low error probabilities, especially when the wireless channel response is known at the receiver. In practice, knowledge of the channel is often obtained by sending known training symbols to the receiver. We show how training affects the capacity of a fading channel-too little training and the channel is improperly learned, too much training and there is no time left for data transmission before the channel changes. We compute a lower bound on the capacity of a channel that is learned by training, and maximize the bound as a function of the received signal-to-noise ratio (SNR), fading coherence time, and number of transmitter antennas. When the training and data powers are allowed to vary, we show that the optimal number of training symbols is equal to the number of transmit antennas-this number is also the smallest training interval length that guarantees meaningful estimates of the channel matrix. When the training and data powers are instead required to be equal, the optimal number of symbols may be larger than the number of antennas. We show that training-based schemes can be optimal at high SNR, but suboptimal at low SNR.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Capacity of Multi‐antenna Gaussian Channels
Telatar, E. (1999) · European Transactions on Telecommunications · doi:10.1002/ett.4460100604 · Cited by 11,234
Microwave Mobile Communications
Jakes, W. C. (1994) · Institute of Electrical and Electronics Engineers eBooks · doi:10.1109/9780470545287 · Cited by 9,747
Foschini, G. J. (2002) · Bell Labs Technical Journal · doi:10.1002/bltj.2015 · Cited by 6,205
Söderström, T., & Stoica, P. (1988) · Cited by 5,162
de Gooijer, J. G. (1990) · International Journal of Forecasting · doi:10.1016/0169-2070(90)90013-2 · Cited by 2,245
Fading channels: information-theoretic and communications aspects
Biglieri, E., Proakis, J., & Shamai, S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720551 · Cited by 1,931
Golden, G. D., Foschini, C. J., Valenzuela, R. A., & Wolniansky, P. W. (1999) · Electronics Letters · doi:10.1049/el:19990058 · Cited by 1,765
Zheng, L., & Tse, D. N. C. (2002) · IEEE Transactions on Information Theory · doi:10.1109/18.978730 · Cited by 986
Medard, M. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.841172 · Cited by 931
Differential unitary space-time modulation
Hochwald, B. M., & Sweldens, W. (2000) · IEEE Transactions on Communications · doi:10.1109/26.891215 · Cited by 905
Self-citationFading Channels: InformationTheoretic and Communications Aspects
(2009) · Information Theory · doi:10.1109/9780470544907.ch22 · Cited by 494
The capacity of discrete-time memoryless Rayleigh-fading channels
Abou-Faycal, I. C., Trott, M. D., & Shamai, S. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.923716 · Cited by 429
On information rates for mismatched decoders
Merhav, N., Kaplan, G., Lapidoth, A., & Shamai Shitz, S. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.340469 · Cited by 409
Cited by
Andrews, J. G., Buzzi, S., Choi, W., Hanly, S. V., Lozano, A., Soong, A. C. K., & Zhang, J. C. (2014) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2014.2328098 · Cited by 8,106
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels
Zheng, L., & Tse, D. N. C. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.810646 · Cited by 4,258
Cell-Free Massive MIMO Versus Small Cells
Ngo, H. Q., Ashikhmin, A., Yang, H., Larsson, E. G., & Marzetta, T. L. (2017) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2017.2655515 · Cited by 2,757
Capacity limits of MIMO channels
Goldsmith, A., Jafar, S. A., Jindal, N., & Vishwanath, S. (2003) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2003.810294 · Cited by 2,379
Massive MIMO in the UL/DL of Cellular Networks: How Many Antennas Do We Need?
Hoydis, J., ten Brink, S., & Debbah, M. (2013) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2013.130205 · Cited by 2,361
Metadata
- Authors
- Hassibi, B., & Hochwald, B. M.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2003-04
- Volume
- 49
- Issue
- 4
- Pages
- 951-963
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2106929598
- Cited by
- 2,312
- References
- 13
- FWCI
- 86.48
- 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.