On the capacity of MIMO broadcast channels with partial side information
Top Cited Papers
- 24 January 2005
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 51 (2), 506-522
- https://doi.org/10.1109/tit.2004.840897
Abstract
In multiple-antenna broadcast channels, unlike point-to-point multiple-antenna channels, the multiuser capacity depends heavily on whether the transmitter knows the channel coefficients to each user. For instance, in a Gaussian broadcast channel with M transmit antennas and n single-antenna users, the sum rate capacity scales like Mloglogn for large n if perfect channel state information (CSI) is available at the transmitter, yet only logarithmically with M if it is not. In systems with large n, obtaining full CSI from all users may not be feasible. Since lack of CSI does not lead to multiuser gains, it is therefore of interest to investigate transmission schemes that employ only partial CSI. We propose a scheme that constructs M random beams and that transmits information to the users with the highest signal-to-noise-plus-interference ratios (SINRs), which can be made available to the transmitter with very little feedback. For fixed M and n increasing, the throughput of our scheme scales as MloglognN, where N is the number of receive antennas of each user. This is precisely the same scaling obtained with perfect CSI using dirty paper coding. We furthermore show that a linear increase in throughput with M can be obtained provided that M does not not grow faster than logn. We also study the fairness of our scheduling in a heterogeneous network and show that, when M is large enough, the system becomes interference dominated and the probability of transmitting to any user converges to 1/n, irrespective of its path loss. In fact, using M=/spl alpha/logn transmit antennas emerges as a desirable operating point, both in terms of providing linear scaling of the throughput with M as well as in guaranteeing fairness.Keywords
This publication has 16 references indexed in Scilit:
- Multiple-Antenna Channel Hardening and Its Implications for Rate Feedback and SchedulingIEEE Transactions on Information Theory, 2004
- Duality, achievable rates, and sum-rate capacity of gaussian mimo broadcast channelsIEEE Transactions on Information Theory, 2003
- Sum capacity of the vector Gaussian broadcast channel and uplink–downlink dualityIEEE Transactions on Information Theory, 2003
- On the achievable throughput of a multiantenna Gaussian broadcast channelIEEE Transactions on Information Theory, 2003
- Capacity limits of MIMO channelsIEEE Journal on Selected Areas in Communications, 2003
- Opportunistic beamforming using dumb antennasIEEE Transactions on Information Theory, 2002
- Nested linear/lattice codes for structured multiterminal binningIEEE Transactions on Information Theory, 2002
- Communication on the Grassmann manifold: a geometric approach to the noncoherent multiple-antenna channelIEEE Transactions on Information Theory, 2002
- Capacity of Multi‐antenna Gaussian ChannelsEuropean Transactions on Telecommunications, 1999
- Extremal Theory for Stochastic ProcessesThe Annals of Probability, 1988