Proc. IEEE International Symposium on Information Theory, July 9-14, 2006, pp. 886-890, Seattle, Washington USA.

Sum Capacity of Multiuser MIMO Broadcast Channels with Block Diagonalization

Zukang Shen, Runhua Chen, Jeffrey G. Andrews, Robert W. Heath, Jr., and Brian L. Evans

Wireless Networking and Communications Group, The University of Texas at Austin, Austin, TX 78712 USA - - - -

Paper Draft


The sum capacity of a Gaussian broadcast MIMO channel can be achieved with Dirty Paper Coding (DPC). Deploying DPC in real-time systems is, however, impractical. Block Diagonalization (BD) is an alternative precoding technique for downlink multiuser MIMO systems, which can eliminate interuser interference at each receiver, at the expense of suboptimal sum capacity vs. DPC. In this paper, we study the sum capacity loss of BD for a fixed channel. We show that
  1. if the user channels are orthogonal to each other, then BD achieves the complete sum capacity; and
  2. if the user channels lie in a common row vector space, then the gain of DPC over BD can be bounded by the minimum of the number of transmit and receive antennas and the number of users.
We also compare the ergodic sum capacity of DPC with that of BD in a Rayleigh fading channel. Simulations show that BD can achieve a significant part of the total throughput of DPC. An upper bound on the ergodic sum capacity gain of DPC over BD is derived, which can be evaluated with a few numerical integrations. With this bound, we can easily estimate how far away BD is from being optimal in terms of ergodic sum capacity, which is useful in directing practical system designs.

COPYRIGHT NOTICE: All the documents on this server have been submitted by their authors to scholarly journals or conferences as indicated, for the purpose of non-commercial dissemination of scientific work. The manuscripts are put on-line to facilitate this purpose. These manuscripts are copyrighted by the authors or the journals in which they were published. You may copy a manuscript for scholarly, non-commercial purposes, such as research or instruction, provided that you agree to respect these copyrights.

Last Updated 02/25/07.