Iterative water-filling for Gaussian vector multiple-access channels

  • Authors:
  • Wei Yu;Wonjong Rhee;S. Boyd;J. M. Cioffi

  • Affiliations:
  • Dept. of Electr. & Comput. Eng., Toronto Univ., Ont., Canada;-;-;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 755.09

Visualization

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.