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

Abstract

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.