The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel
Abstract
The Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC) is considered. The dirty-paper coding (DPC) rate region is shown to coincide with the capacity region. To that end, a new notion of an enhanced broadcast channel is introduced and is used jointly with the entropy power inequality, to show that a superposition of Gaussian codes is optimal for the degraded vector broadcast channel and that DPC is optimal for the nondegraded case. Furthermore, the capacity region is characterized under a wide range of input constraints, accounting, as special cases, for the total power and the per-antenna power constraints
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Writing on dirty paper (Corresp.)
Costa, M. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056659 · Cited by 3,735
On the achievable throughput of a multiantenna Gaussian broadcast channel
Caire, G., & Shamai, S. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.813523 · Cited by 2,527
Self-citationConvex Analysis and Optimization
Bertsekas, D. P., Nedić, A., & Ozdaglar, A. (2003) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2,148
Duality, achievable rates, and sum-rate capacity of gaussian mimo broadcast channels
Vishwanath, S., Jindal, N., & Goldsmith, A. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.817421 · Cited by 1,683
Sum capacity of the vector Gaussian broadcast channel and uplink–downlink duality
Viswanath, P., & Tse, D. N. C. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.814483 · Cited by 1,290
Sum Capacity of Gaussian Vector Broadcast Channels
Yu, W., & Cioffi, J. M. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.833336 · Cited by 742
A coding theorem for the discrete memoryless broadcast channel
Marton, K. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056046 · Cited by 607
Enhancing the cellular downlink capacity via co-processing at the transmitting end
Shamai, S., & Zaidel, B. M. (2002) · IEEE VTS 53rd Vehicular Technology Conference, Spring 2001. Proceedings (Cat. No.01CH37202) · doi:10.1109/vetecs.2001.944993 · Cited by 461
Self-citationOn the Duality of Gaussian Multiple-Access and Broadcast Channels
Jindal, N., Vishwanath, S., & Goldsmith, A. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.826646 · Cited by 453
A simple converse for broadcast channels with additive white Gaussian noise (Corresp.)
Bergmans, P. (1974) · IEEE Transactions on Information Theory · doi:10.1109/tit.1974.1055184 · Cited by 445
The convolution inequality for entropy powers
Blachman, N. (1965) · IEEE Transactions on Information Theory · doi:10.1109/tit.1965.1053768 · Cited by 331
Uplink-downlink duality via minimax duality
Yu, W. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862102 · Cited by 217
Cited by
Scaling Up MIMO: Opportunities and Challenges with Very Large Arrays
Rusek, F., Persson, D., Lau, B. K., Larsson, E. G., Marzetta, T. L., & Tufvesson, F. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2011.2178495 · Cited by 4,654
Energy and spectral efficiency of very large multiuser MIMO systems
Ngo, H. Q., Larsson, E. G., & Marzetta, T. L. (2013) · IEEE Transactions on Communications · doi:10.1109/tcomm.2013.020413.110848 · Cited by 3,173
Breaking Spectrum Gridlock With Cognitive Radios: An Information Theoretic Perspective
Goldsmith, A., Jafar, S. A., Maric, I., & Srinivasa, S. (2009) · Proceedings of the IEEE · doi:10.1109/jproc.2009.2015717 · Cited by 2,398
Massive MIMO Networks: Spectral, Energy, and Hardware Efficiency
Björnson, E., Hoydis, J., & Sanguinetti, L. (2017) · Foundations and Trends® in Signal Processing · doi:10.1561/2000000093 · Cited by 2,137
Multi-Cell MIMO Cooperative Networks: A New Look at Interference
Gesbert, D., Hanly, S., Huang, H., Shamai Shitz, S., Simeone, O., & Yu, W. (2010) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2010.101202 · Cited by 1,760
Metadata
- Authors
- Weingarten, H., Steinberg, Y., & Shamai, S. S.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2006-09
- Volume
- 52
- Issue
- 9
- Pages
- 3936-3964
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2030546921
- Cited by
- 1,709
- References
- 14
- FWCI
- 149.13
- 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.