Iterative Water-Filling for Gaussian Vector Multiple-Access Channels
Top Cited Papers
- 30 January 2004
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 50 (1) , 145-152
- https://doi.org/10.1109/tit.2003.821988
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.Keywords
This publication has 12 references indexed in Scilit:
- Information capacity and power control in single-cell multiuser communicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Wireless systems and interference avoidanceIEEE Transactions on Wireless Communications, 2002
- Elements of Information TheoryPublished by Wiley ,2001
- Asymptotically optimal water-filling in vector multiple-access channelsIEEE Transactions on Information Theory, 2001
- The effect upon channel capacity in wireless communications of perfect and imperfect knowledge of the channelIEEE Transactions on Information Theory, 2000
- Optimal sequences and sum capacity of synchronous CDMA systemsIEEE Transactions on Information Theory, 1999
- Determinant Maximization with Linear Matrix Inequality ConstraintsSIAM Journal on Matrix Analysis and Applications, 1998
- Semidefinite ProgrammingSIAM Review, 1996
- On channel capacity per unit costIEEE Transactions on Information Theory, 1990
- A perspective on multiaccess channelsIEEE Transactions on Information Theory, 1985