Dirty paper coding vs. TDMA for MIMO broadcast channels

Nihar Jindal, Andrea Goldsmith

Research output: Contribution to journalConference articlepeer-review

35 Scopus citations

Abstract

In this paper we derive an upper bound on the sum-rate gain that dirty-paper coding provides over TDMA for MIMO broadcast channels. We find that the sum-rate capacity (achievable using dirty-paper coding) of the multiple-antenna broadcast channel 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. 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, where M is the number of receive antennas at the base station and K is the number of transmitters.

Original languageEnglish (US)
Pages (from-to)682-686
Number of pages5
JournalIEEE International Conference on Communications
Volume2
DOIs
StatePublished - 2004
Externally publishedYes
Event2004 IEEE International Conference on Communications - Paris, France
Duration: Jun 20 2004Jun 24 2004

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Dirty paper coding vs. TDMA for MIMO broadcast channels'. Together they form a unique fingerprint.

Cite this