Details

Autor(en) / Beteiligte

• Wei Yu
• Wonjong Rhee
• Boyd, S.
• Cioffi, J.M.

Titel

Iterative water-filling for Gaussian vector multiple-access channels

Ist Teil von

• IEEE transactions on information theory, 2004-01, Vol.50 (1), p.145-152

Ort / Verlag

New York: IEEE

Erscheinungsjahr

2004

Quelle

IEEE/IET Electronic Library (IEL)

Beschreibungen/Notizen

• 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.