Sum power iterative water-filling for multi-antenna Gaussian broadcast channels

We consider the problem of maximizing sum rate on a multiple-antenna downlink in which the base station and receivers have multiple-antennas. The optimum scheme for this system was recently found to be "dirty paper coding". Obtaining the optimal transmission policies of the users when employing this dirty paper coding scheme is a computationally complex nonconvex problem. We use a "duality" to transform this problem into a convex multiple access problem, and then obtain a simple and fast iterative algorithm that gives us the optimum transmission policies.

[1]  Max H. M. Costa,et al.  Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.

[2]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[3]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[4]  Pravin Varaiya,et al.  Capacity of fading channels with channel side information , 1997, IEEE Trans. Inf. Theory.

[5]  David Tse,et al.  Multiaccess Fading Channels-Part I: Polymatroid Structure, Optimal Resource Allocation and Throughput Capacities , 1998, IEEE Trans. Inf. Theory.

[6]  M. J. Gans,et al.  On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas , 1998, Wirel. Pers. Commun..

[7]  Emre Telatar,et al.  Capacity of Multi-antenna Gaussian Channels , 1999, Eur. Trans. Telecommun..

[8]  Andrea J. Goldsmith,et al.  On the capacity of multiple input multiple output broadcast channels , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[9]  Wei Yu,et al.  Sum capacity of a Gaussian vector broadcast channel , 2002, Proceedings IEEE International Symposium on Information Theory,.

[10]  Harish Viswanathan,et al.  Downlink capacity evaluation of cellular networks with known-interference cancellation , 2003, IEEE J. Sel. Areas Commun..

[11]  Nihar Jindal,et al.  Sum power iterative waterfilling for Gaussian vector broadcast channels , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[12]  Shlomo Shamai,et al.  On the achievable throughput of a multiantenna Gaussian broadcast channel , 2003, IEEE Transactions on Information Theory.

[13]  Wei Yu,et al.  A Dual Decomposition Approach to the Sum Power Gaussian Vector Multiple Access Channel Sum Capacity Problem , 2003 .

[14]  David Tse,et al.  Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality , 2003, IEEE Trans. Inf. Theory.

[15]  Wei Yu,et al.  Iterative water-filling for Gaussian vector multiple-access channels , 2001, IEEE Transactions on Information Theory.

[16]  Andrea J. Goldsmith,et al.  On the duality of Gaussian multiple-access and broadcast channels , 2002, IEEE Transactions on Information Theory.