Back to Search
Start Over
Dirty-Paper Coding Versus TDMA for MIMO Broadcast Channels.
- Source :
-
IEEE Transactions on Information Theory . May2005, Vol. 51 Issue 5, p1783-1794. 12p. - Publication Year :
- 2005
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 51
- Issue :
- 5
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 17028047
- Full Text :
- https://doi.org/10.1109/TIT.2005.846425