The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Duality, achievable rates, and sum-rate capacity of gaussian mimo broadcast channels
Abstract
We consider a multiuser multiple-input multiple- output (MIMO) Gaussian broadcast channel (BC), where the transmitter and receivers have multiple antennas. Since the MIMO BC is in general a nondegraded BC, its capacity region remains an unsolved problem. We establish a duality between what is termed the "dirty paper" achievable region (the Caire-Shamai (see Proc. IEEE Int. Symp. Information Theory, Washington, DC, June 2001, p.322) achievable region) for the MIMO BC and the capacity region of the MIMO multiple-access channel (MAC), which is easy to compute. Using this duality, we greatly reduce the computational complexity required for obtaining the dirty paper achievable region for the MIMO BC. We also show that the dirty paper achievable region achieves the sum-rate capacity of the MIMO BC by establishing that the maximum sum rate of this region equals an upper bound on the sum rate of the MIMO BC.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
Capacity of Multi‐antenna Gaussian Channels
Telatar, E. (1999) · European Transactions on Telecommunications · doi:10.1002/ett.4460100604 · Cited by 11,234
On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas
Foschini, G. J., & Gans, M. J. (1998) · Wireless Personal Communications · doi:10.1023/a:1008889222784 · Cited by 10,091
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
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
Iterative Water-Filling for Gaussian Vector Multiple-Access Channels
Yu, W., Rhee, W., Boyd, S., & Cioffi, J. M. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.821988 · Cited by 1,026
Determinant Maximization with Linear Matrix Inequality Constraints
Vandenberghe, L., Boyd, S., & Wu, S.-P. (1998) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479896303430 · Cited by 652
On 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
Self-citation
Cited by
Noncooperative Cellular Wireless with Unlimited Numbers of Base Station Antennas
Marzetta, T. L. (2010) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2010.092810.091092 · Cited by 6,302
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
Zero-Forcing Methods for Downlink Spatial Multiplexing in Multiuser MIMO Channels
Spencer, Q. H., Swindlehurst, A. L., & Haardt, M. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.821107 · Cited by 3,148
An Overview of Massive MIMO: Benefits and Challenges
Lu, L., Li, G. Y., Swindlehurst, A. L., Ashikhmin, A., & Zhang, R. (2014) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2014.2317671 · Cited by 2,838
MIMO Broadcasting for Simultaneous Wireless Information and Power Transfer
Zhang, R., & Ho, C. K. (2013) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2013.031813.120224 · Cited by 2,739
Metadata
- Authors
- Vishwanath, S., Jindal, N., & Goldsmith, A.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2003-10
- Volume
- 49
- Issue
- 10
- Pages
- 2658-2668
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2161410889
- Cited by
- 1,683
- References
- 10
- FWCI
- 76.09
- 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.