Dirty-Paper Coding Versus TDMA for MIMO Broadcast Channels
Top Cited Papers
- 25 April 2005
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 51 (5) , 1783-1794
- https://doi.org/10.1109/tit.2005.846425
Abstract
We compare the capacity of dirty-paper coding (DPC) to that of time-division multiple access (TDMA) for a multiple-antenna (multiple-input multiple-output (MIMO)) Gaussian broadcast channel (BC). We find that the sum-rate capacity (achievable using DPC) of the multiple-antenna BC is at most min(M,K) times the largest single-user capacity (i.e., the TDMA sum-rate) in the system, where M is the number of transmit antennas and K is the number of receivers. This result is independent of the number of receive antennas and the channel gain matrix, and is valid at all signal-to-noise ratios (SNRs). We investigate the tightness of this bound in a time-varying channel (assuming perfect channel knowledge at receivers and transmitters) where the channel experiences uncorrelated Rayleigh fading and in some situations we find that the dirty paper gain is upper-bounded by the ratio of transmit-to-receive antennas. We also show that min(M,K) upper-bounds the sum-rate gain of successive decoding over TDMA for the uplink channel, where M is the number of receive antennas at the base station and K is the number of transmitters.Keywords
This publication has 18 references indexed in Scilit:
- Rate Scheduling in Multiple Antenna Downlink Wireless SystemsIEEE Transactions on Communications, 2005
- Sum Power Iterative Water-Filling for Multi-Antenna Gaussian Broadcast ChannelsIEEE Transactions on Information Theory, 2005
- 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 and optimal resource allocation for fading broadcast channels .I. Ergodic capacityIEEE Transactions on Information Theory, 2001
- The capacity region of broadcast channels with intersymbol interference and colored Gaussian noiseIEEE Transactions on Information Theory, 2001
- Capacity of Multi‐antenna Gaussian ChannelsEuropean Transactions on Telecommunications, 1999
- Optimum sequence multisets for synchronous code-division multiple-access channelsIEEE Transactions on Information Theory, 1994
- Writing on dirty paper (Corresp.)IEEE Transactions on Information Theory, 1983