The DOI matches its Crossref record; 18 of the 18 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.
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
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
Optimization by Vector Space Methods
(1970) · Students Quarterly Journal · doi:10.1049/sqj.1970.0088 · Cited by 6,004
Vandenberghe, L., & Boyd, S. (1996) · SIAM Review · doi:10.1137/1038003 · Cited by 4,105
Self-citationInformation capacity and power control in single-cell multiuser communications
Knopp, R., & Humblet, P. A. (2002) · Proceedings IEEE International Conference on Communications ICC '95 · doi:10.1109/icc.1995.525188 · Cited by 2,059
Spatio-temporal coding for wireless communication
Raleigh, G. G., & Cioffi, J. M. (1998) · IEEE Transactions on Communications · doi:10.1109/26.662641 · Cited by 1,460
Self-citationMedard, M. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.841172 · Cited by 931
Distributed multiuser power control for digital subscriber lines
Yu, W., Ginis, G., & Cioffi, J. M. (2002) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.1007390 · Cited by 855
Self-citationShannon-theoretic approach to a Gaussian cellular multiple-access channel
Wyner, A. D. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.340450 · Cited by 729
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
Self-citationMulti-way communication channels
Ahlswede, R. (1973) · PUB – Publications at Bielefeld University (Bielefeld University) · Cited by 615
On channel capacity per unit cost
Verdu, S. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.57201 · Cited by 522
Liao, H. H.-J. (1972) · Cited by 391
Optimal sequences and sum capacity of synchronous CDMA systems
Viswanath, P., & Anantharam, V. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.782121 · Cited by 321
Information-theoretic considerations for symmetric, cellular, multiple-access fading channels. II
Shamai, S., & Wyner, A. D. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.641554 · Cited by 288
Asymptotically optimal water-filling in vector multiple-access channels
Viswanath, P., Tse, D. N. C., & Anantharam, V. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.904525 · Cited by 199
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
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
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch15 · Cited by 1,504
Weighted 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
Self-citationGomadam, K., Cadambe, V. R., & Jafar, S. A. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2142270 · Cited by 871
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
- 18
- 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
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.