TY - GEN

T1 - How much does transmit correlation affect the sum-rate of MIMO downlink channels?

AU - Al-Naffouri, Tareq

AU - Sharif, Masoud

AU - Hassibi, Babak

PY - 2006/12/1

Y1 - 2006/12/1

N2 - This paper considers the effect of spatial correlation between transmit antennas on the sum-rate capacity of the MIMO 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 [12] and more generally, for random beamforming with precoding in which beams are pre-multiplied by a fixed matrix. Simulation results are presented at the end of the paper.

AB - This paper considers the effect of spatial correlation between transmit antennas on the sum-rate capacity of the MIMO 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 [12] and more generally, for random beamforming with precoding in which beams are pre-multiplied by a fixed matrix. Simulation results are presented at the end of the paper.

UR - http://www.scopus.com/inward/record.url?scp=39049160620&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2006.261541

DO - 10.1109/ISIT.2006.261541

M3 - Conference contribution

AN - SCOPUS:39049160620

SN - 1424405041

SN - 9781424405046

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1574

EP - 1578

BT - Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006

T2 - 2006 IEEE International Symposium on Information Theory, ISIT 2006

Y2 - 9 July 2006 through 14 July 2006

ER -