The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Iterative Water-Filling for Gaussian Vector Multiple-Access Channels
Abstract
This paper proposes an efficient numerical algorithm to compute the optimal input distribution that maximizes the sum capacity of a Gaussian multiple-access channel with vector inputs and a vector output. The numerical algorithm has an iterative water-filling interpretation. The algorithm converges from any starting point, and it reaches within 1/2 nats per user per output dimension from the sum capacity after just one iteration. The characterization of sum capacity also allows an upper bound and a lower bound for the entire capacity region to be derived.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
Cited by
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
Energy Harvesting Wireless Communications: A Review of Recent Advances
Ulukus, S., Yener, A., Erkip, E., Simeone, O., Zorzi, M., Grover, P., & Huang, K. (2015) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2015.2391531 · Cited by 805
Foundations of MIMO Communication
Heath Jr, R. W., & Lozano, A. (2018) · Cambridge University Press eBooks · doi:10.1017/9781139049276 · Cited by 426
MIMO Transceiver Design via Majorization Theory
Palomar, D. P., & Jiang, Y. (2007) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000018 · Cited by 320
Deep Learning Based MIMO Communications
O'Shea, T. J., Erpek, T., & Clancy, T. C. (2017) · arXiv · doi:10.48550/arxiv.1707.07980 · Cited by 205
Metadata
- Authors
- Yu, W., Rhee, W., Boyd, S., & Cioffi, J. M.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2004-01
- Volume
- 50
- Issue
- 1
- Pages
- 145-152
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2163844889
- Cited by
- 1,026
- References
- 1
- FWCI
- 77.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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Iterative Water-Filling for Gaussian Vector Multiple-Access Channels. https://app.cochat.ai/papers/10.1109/tit.2003.821988
- The paper
- Yu, W., Rhee, W., Boyd, S., & Cioffi, J. M. (2004). Iterative Water-Filling for Gaussian Vector Multiple-Access Channels. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2003.821988
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.
