Iterative water-filling for Gaussian vector multiple access channels

@article{Yu2001IterativeWF,
  title={Iterative water-filling for Gaussian vector multiple access channels},
  author={Wei Yu and W. Rhee and S. Boyd and J. M. Ciofli},
  journal={Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)},
  year={2001},
  pages={322-}
}
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.