Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels

We consider a multiuser multiple-input multiple- output (MIMO) Gaussian broadcast channel (BC), where the transmitter and receivers have multiple antennas. Since the MIMO BC is in general a nondegraded BC, its capacity region remains an unsolved problem. We establish a duality between what is termed the "dirty paper" achievable region (the Caire-Shamai (see Proc. IEEE Int. Symp. Information Theory, Washington, DC, June 2001, p.322) achievable region) for the MIMO BC and the capacity region of the MIMO multiple-access channel (MAC), which is easy to compute. Using this duality, we greatly reduce the computational complexity required for obtaining the dirty paper achievable region for the MIMO BC. We also show that the dirty paper achievable region achieves the sum-rate capacity of the MIMO BC by establishing that the maximum sum rate of this region equals an upper bound on the sum rate of the MIMO BC.

[1]  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).

[2]  Giuseppe Caire,et al.  On achievable rates in a multi-antenna broadcast downlink , 2000 .

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

[4]  Giuseppe Caire,et al.  On achievable rates in a multi-antenna Gaussian broadcast channel , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

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

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

[7]  Holger Boche,et al.  Rate balancing for the multi-antenna Gaussian broadcast channel , 2002, IEEE Seventh International Symposium on Spread Spectrum Techniques and Applications,.

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

[9]  S. Verdu,et al.  Multiple-access channels with memory with and without frame synchronism , 1989, IEEE Trans. Inf. Theory.

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

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

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

[13]  David Tse,et al.  DIMACS Series in Discrete Mathematics and Theoretical Computer Science On the Capacity of the Multiple Antenna Broadcast Channel , 2002 .

[14]  Nihar Jindal,et al.  On The Duality of Multiple-Access and Broadcast Channels , 2001 .

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

[16]  Wei Yu,et al.  Trellis precoding for the broadcast channel , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[17]  Hiroshi Sato,et al.  An outer bound to the capacity region of broadcast channels (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[18]  Stephen P. Boyd,et al.  Determinant Maximization with Linear Matrix Inequality Constraints , 1998, SIAM J. Matrix Anal. Appl..