Scaling laws of sum rate using time-sharing, DPC, and beamforming for MIMO broadcast channels

This paper derives scaling laws of the sum rate throughput for MIMO Gaussian broadcast channels using time-sharing to the strongest user, dirty paper coding (DPC), and beamforming when the number of users (receivers) n is large. Assuming a fixed total average transmit power, we show that for a system with M transmit antennas and users equipped with N antennas, the sum rate scales like M log log nTV for DPC and beamforming when M is fixed and for any N (either growing to infinity or not). On the other hand, when both M and TV are fixed, the sum rate of time-sharing to the strongest user scales like min(M,N) log log n. It is also shown that if M grows as logn, the sum rate of DPC and beamforming will grow linearly in M, but with different constant multiplicative factors. In this region, the sum rate capacity of time-sharing scales like N log log n.

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

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

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

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

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

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