The DOI matches its Crossref record.
Asymptotically optimal water-filling in vector multiple-access channels
Abstract
Dynamic resource allocation is an important means to increase the sum capacity of fading multiple-access channels (MACs). In this paper, we consider vector multi-access channels (channels where each user has multiple degrees of freedom) and study the effect of power allocation as a function of the channel state on the sum capacity (or spectral efficiency) defined as the maximum sum of rates of users per unit degree of freedom at which the users can jointly transmit reliably, in an information-theoretic sense, assuming random directions of received signal. Direct-sequence code-division multiple-access (DS-CDMA) channels and MACs with multiple antennas at the receiver are two systems that fall under the model. Our main result is the identification of a simple dynamic power-allocation scheme that is optimal in a large system, i.e., with a large number of users and a correspondingly large number of degrees of freedom. A key feature of this policy is that, for any user, it depends on the instantaneous amplitude of channel state of that user alone and the structure of the policy is "water-filling." In the contest of DS-CDMA and in the special case of no fading, the asymptotically optimal power policy of water-filling simplifies to constant power allocation over all realizations of signature sequences; this result verifies the conjecture made in Verdu and Shamai (1999). We study the behavior of the asymptotically optimal water-filling policy in various regimes of number of users per unit degree of freedom and signal-to-noise ratio (SNR). We also generalize this result to multiple classes, i.e., the situation when users in different classes have different average 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
Cited by
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
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
Mesleh, R. Y., Haas, H., Sinanovic, S., Ahn, C. W., & Yun, S. (2008) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2007.912136 · Cited by 2,357
From theory to practice: an overview of MIMO space-time coded wireless systems
Gesbert, D., Shafi, M., Shiu, D.-S., Smith, P. J., & Naguib, A. (2003) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2003.809458 · Cited by 2,295
Random Matrix Theory and Wireless Communications
Tulino, A. M., & Verdú, S. (2004) · Foundations and Trends™ in Communications and Information Theory · doi:10.1561/0100000001 · Cited by 2,034
Metadata
- Authors
- Viswanath, P., Tse, D. N. C., & Anantharam, V.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2001
- Volume
- 47
- Issue
- 1
- Pages
- 241-267
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2154717086
- Cited by
- 199
- References
- 0
- FWCI
- 19.73
- 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: Asymptotically optimal water-filling in vector multiple-access channels. https://app.cochat.ai/papers/10.1109/18.904525
- The paper
- Viswanath, P., Tse, D. N. C., & Anantharam, V. (2001). Asymptotically optimal water-filling in vector multiple-access channels. IEEE Transactions on Information Theory. https://doi.org/10.1109/18.904525
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.