DocumentCode
3279574
Title
Iterative water-filling for Gaussian vector multiple access channels
Author
Yu, Wei ; Rhee, Wonjong ; Boyd, Stephen ; Ciof, John M.
Author_Institution
Dept. of Electr. Eng., Stanford Univ., CA, USA
fYear
2001
fDate
2001
Firstpage
322
Abstract
We develop an efficient iterative water-filling algorithm to find an optimal transmit spectrum for maximum sum capacity in a Gaussian multiple access channel with vector inputs and a vector output. The iterative algorithm converges from any starting point and reaches within (K-1)/2 nats per output dimension from the K-user sum capacity after just one iteration
Keywords
Gaussian channels; convergence of numerical methods; discrete time systems; iterative methods; memoryless systems; multi-access systems; multiuser channels; Gaussian vector multiple access channels; K-user sum capacity; iterative water-filling; maximum sum capacity; optimal transmit spectrum; vector inputs; vector output; Channel capacity; Covariance matrix; Electronic mail; Fading; Filling; Gaussian distribution; Intersymbol interference; Iterative algorithms; Network address translation; Resource management;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location
Washington, DC
Print_ISBN
0-7803-7123-2
Type
conf
DOI
10.1109/ISIT.2001.936185
Filename
936185
Link To Document