Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Yu et al. (2002) studied this question.