The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Sum Power Iterative Water-Filling for Multi-Antenna Gaussian Broadcast Channels
Abstract
In this correspondence, we consider the problem of maximizing sum rate of a multiple-antenna Gaussian broadcast channel (BC). It was recently found that dirty-paper coding is capacity achieving for this channel. In order to achieve capacity, the optimal transmission policy (i.e., the optimal transmit covariance structure) given the channel conditions and power constraint must be found. However, obtaining the optimal transmission policy when employing dirty-paper coding is a computationally complex nonconvex problem. We use duality to transform this problem into a well-structured convex multiple-access channel (MAC) problem. We exploit the structure of this problem and derive simple and fast iterative algorithms that provide the optimum transmission policies for the MAC, which can easily be mapped to the optimal BC policies.
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
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
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
Weik, M. H. (2000) · Computer Science and Communications Dictionary · doi:10.1007/1-4020-0613-6_12436 · Cited by 2,570
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
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
Self-citationSum 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
Nonlinear Programming: A Unified Approach.
Beale, E. M. L., & Zangwill, W. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2343701 · Cited by 1,057
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
Self-citationNonlinear Programming: A Unified Approach
Peterson, D. W., & Zangwill, W. I. (1972) · Econometrica · doi:10.2307/1909424 · Cited by 1,005
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
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
On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming
Taesa, & Goldsmith, A. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2005.862421 · Cited by 2,057
Self-citationWeighted sum-rate maximization using weighted MMSE for MIMO-BC beamforming design
Christensen, S. S., Agarwal, R., De Carvalho, E., & Cioffi, J. M. (2008) · IEEE Transactions on Wireless Communications · doi:10.1109/t-wc.2008.070851 · Cited by 1,014
An introduction to convex optimization for communications and signal processing
Luo, Z.-Q., & Yu, W. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.879347 · Cited by 562
Networked MIMO with clustered linear precoding
Zhang, J., Chen, R., Andrews, J. G., Ghosh, A., & Heath, R. W. (2009) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2009.080180 · Cited by 533
Massive MIMO Performance Evaluation Based on Measured Propagation Data
Gao, X., Edfors, O., Rusek, F., & Tufvesson, F. (2015) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2015.2414413 · Cited by 503
Metadata
- Authors
- Jindal, N., Rhee, W., Vishwanath, S., Jafar, S. A., & Goldsmith, A.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2005-04
- Volume
- 51
- Issue
- 4
- Pages
- 1570-1580
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W1974891392
- Cited by
- 622
- References
- 14
- FWCI
- 53.71
- 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.