Sum capacity optimization of the MIMO Gaussian MAC

In this work, we study the sum capacity of a Gaussian multiple-input multiple-output multiple-access channel with a sum power constraint. In order to develop an efficient algorithm for maximization of the sum capacity, we extend recent results regarding the duality between the vector multiple access channel and broadcast channel and the Sato bound. We enhance the iterative Water-filling algorithm from Wei Yu et al. (2002) to converge into the optimum power allocation.