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 February 2009 | Published
Journal Article Open

How much does transmit correlation affect the sum-rate scaling of MIMO Gaussian broadcast channels?

Abstract

This paper considers the effect of spatial correlation between transmit antennas on the sum-rate capacity of the MIMO Gaussian broadcast channel (i.e., downlink of a cellular system). Specifically, for a system with a large number of users n, we analyze the scaling laws of the sum-rate for the dirty paper coding and for different types of beamforming transmission schemes. When the channel is i.i.d., it has been shown that for large n, the sum rate is equal to M log log n + M log P/M + o(1) where M is the number of transmit antennas, P is the average signal to noise ratio, and o(1) refers to terms that go to zero as n → ∞. When the channel exhibits some spatial correlation with a covariance matrix R (non-singular with tr(R) = M), we prove that the sum rate of dirty paper coding is M log log n + M log P/M + log det(R) + o(1). We further show that the sum-rate of various beamforming schemes achieves M log log n + M log P/M + M log c + o(1) where c ≤ 1 depends on the type of beamforming. We can in fact compute c for random beamforming proposed in and more generally, for random beamforming with preceding in which beams are pre-multiplied by a fixed matrix. Simulation results are presented at the end of the paper.

Additional Information

© 2009 IEEE. Paper approved by A. H. Banihashemi, the Editor for Coding and Communication Theory of the IEEE Communications Society. Manuscript received January 31, 2006; revised March 1, 2007 and February 28, 2008. The work of T. Y. Al-Naffouri has been supported by King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia. The work of M. Sharif and B. Hassibi is supported in part by the NSF under grant no. CCR-0133818 and CCR-0326554, by the David and Lucy Packard Foundation, and by Caltech Lee Center for Advanced Networking. The work of T. Y. Al-Naffouri was supported by University Project no. IN070342, Deanship of Scientific Research, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia. T. Y. Al-Naffouri would like to acknowledge King Fahd University of Petroleum and Minerals, Saudi Arabia for its support of this work. The authors would like to thank Amir F. Dana at California Institute of Technology for numerous discussions and his very useful comments. We would also like to thank Maralle Fakhreddine and Mohammed Eltayeb for their help with the simulations.

Attached Files

Published - AlNaffouri2009p209Ieee_T_Commun.pdf

Files

AlNaffouri2009p209Ieee_T_Commun.pdf
Files (452.5 kB)
Name Size Download all
md5:06ed85d4c08bb9dbb4207cf9ce5f407f
452.5 kB Preview Download

Additional details

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