On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming

Although the capacity of multiple-input/multiple-output (MIMO) broadcast channels (BCs) can be achieved by dirty paper coding (DPC), it is difficult to implement in practical systems. This paper investigates if, for a large number of users, simpler schemes can achieve the same performance. Specifically, we show that a zero-forcing beamforming (ZFBF) strategy, while generally suboptimal, can achieve the same asymptotic sum capacity as that of DPC, as the number of users goes to infinity. In proving this asymptotic result, we provide an algorithm for determining which users should be active under ZFBF. These users are semiorthogonal to one another and can be grouped for simultaneous transmission to enhance the throughput of scheduling algorithms. Based on the user grouping, we propose and compare two fair scheduling schemes in round-robin ZFBF and proportional-fair ZFBF. We provide numerical results to confirm the optimality of ZFBF and to compare the performance of ZFBF and proposed fair scheduling schemes with that of various MIMO BC strategies.

[1]  Andrea J. Goldsmith,et al.  Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels , 2003, IEEE Trans. Inf. Theory.

[2]  A.J. Paulraj,et al.  Multiuser diversity for MIMO wireless systems with linear receivers , 2001, Conference Record of Thirty-Fifth Asilomar Conference on Signals, Systems and Computers (Cat.No.01CH37256).

[3]  Wei Yu,et al.  Sum capacity of Gaussian vector broadcast channels , 2004, IEEE Transactions on Information Theory.

[4]  A. Goldsmith,et al.  Sum power iterative water-filling for multi-antenna Gaussian broadcast channels , 2002, Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002..

[5]  S. Venkatesan,et al.  Capacity of a Gaussian MIMO channel with nonzero mean , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[6]  Andrea J. Goldsmith,et al.  Dirty paper coding vs. TDMA for MIMO broadcast channels , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[7]  Rick S. Blum,et al.  Multiuser diversity for a dirty paper approach , 2003, IEEE Communications Letters.

[8]  Andrea J. Goldsmith,et al.  Transmitter optimization and optimality of beamforming for multiple antenna systems , 2004, IEEE Transactions on Wireless Communications.

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

[10]  Harish Viswanathan,et al.  Rate scheduling in multiple antenna downlink wireless systems , 2005, IEEE Transactions on Communications.

[11]  Shlomo Shamai,et al.  The capacity region of the Gaussian MIMO broadcast channel , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

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

[13]  E. Uysal-Biyikoglu,et al.  Low Complexity Multiuser Scheduling for Maximizing Throughput in the MIMO Broadcast Channel , 2004 .

[14]  Rohit U. Nabar,et al.  Introduction to Space-Time Wireless Communications , 2003 .

[15]  Martin Haardt,et al.  Zero-forcing methods for downlink spatial multiplexing in multiuser MIMO channels , 2004, IEEE Transactions on Signal Processing.

[16]  Ying-Chang Liang,et al.  Throughput comparison of wireless downlink transmission schemes with multiple antennas , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

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

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

[19]  Babak Hassibi,et al.  On the capacity of MIMO broadcast channels with partial side information , 2005, IEEE Transactions on Information Theory.

[20]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[21]  David Tse,et al.  Opportunistic beamforming using dumb antennas , 2002, IEEE Trans. Inf. Theory.

[22]  S. Brink,et al.  Approaching the Dirty Paper Limit for Canceling Known Interference , 2003 .

[23]  Raymond Knopp,et al.  Information capacity and power control in single-cell multiuser communications , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[24]  Wei Yu,et al.  Trellis and convolutional precoding for transmitter-based interference presubtraction , 2005, IEEE Transactions on Communications.

[25]  M. Maddah-Ali,et al.  An Efficient Signaling Scheme for MIMO Broadcast Systems : Design and Performance Evaluation , 2005 .

[26]  Babak Hassibi,et al.  A Comparison of Time-Sharing, DPC, and Beamforming for MIMO Broadcast Channels With Many Users , 2007, IEEE Transactions on Communications.

[27]  Robert W. Heath,et al.  Grassmannian beamforming for multiple-input multiple-output wireless systems , 2003, IEEE International Conference on Communications, 2003. ICC '03..

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

[29]  Bertrand M. Hochwald,et al.  Space-Time Multiple Access: Linear Growth in the Sum Rate , 2002 .

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

[31]  Andrea J. Goldsmith,et al.  Capacity limits of MIMO channels , 2003, IEEE J. Sel. Areas Commun..