TY - JOUR
T1 - Dirty-paper coding versus TDMA for MIMO broadcast channels
AU - Jindal, Nihar
AU - Goldsmith, Andrea
N1 - Funding Information:
Manuscript received June 10, 2004; revised January 18, 2005. This work was supported in part by the Office of Naval Research under Grant N00014-02-1-0003. The material in this correspondence was presented at the IEEE International Conference on Communications, Paris, France, June, 2004. N. Jindal is with the Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN 55455 USA (e-mail: [email protected]). A. Goldsmith is with the Electrical Engineering Department, Stanford University, Stanford, CA 94305-9515 USA (e-mail: andrea@systems. stanford.edu). Communicated by R. Müller, Associate Editor for Communications. Digital Object Identifier 10.1109/TIT.2005.846425
PY - 2005/5
Y1 - 2005/5
N2 - 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.
AB - 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.
KW - Broadcast channel (BC)
KW - Channel capacity
KW - Dirty-paper coding (DPC)
KW - Multiple-input multiple-output (MIMO) systems
KW - Time-division multiple access (TDMA)
UR - http://www.scopus.com/inward/record.url?scp=18544388547&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=18544388547&partnerID=8YFLogxK
U2 - 10.1109/TIT.2005.846425
DO - 10.1109/TIT.2005.846425
M3 - Article
AN - SCOPUS:18544388547
SN - 0018-9448
VL - 51
SP - 1783
EP - 1794
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 5
ER -