Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published June 2004 | Published
Book Section - Chapter Open

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

Abstract

We derive the 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 nN 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 N 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 log n, 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.

Additional Information

© 2004 IEEE. Reprinted with Permission. Publication Date: 27 June-2 July 2004. Posted online: 2005-01-10. This work was supported in part by NSF Grant CCR-0133818, by the office of Naval Research Grant N00014-02-1-0578, and by Caltech's Lee Center for Advanced Networking.

Attached Files

Published - SHAisit04a.pdf

Files

SHAisit04a.pdf
Files (242.0 kB)
Name Size Download all
md5:984b5aecaf70d5820db2f1225dd086f3
242.0 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
March 5, 2024