Capacity and dirty paper coding for Gaussian broadcast channels with common information

Nihar Jindal, Andrea Goldsmith

Research output: Contribution to journalConference articlepeer-review

25 Scopus citations

Abstract

We consider a set of parallel, two-user scalar Gaussian broadcast channels, where the transmitter wishes to send independent information to each of the receivers and common information to both receivers. The capacity region of this channel is implicitly characterized in [1]. Here, we provide an explicit characterization of the power and rate allocation schemes that achieve the boundary of the three-dimensional rate region. We also propose a dirty-paper coding achievable region for MIMO broadcast channels with common information.

Original languageEnglish (US)
Pages (from-to)215
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - 2004
Externally publishedYes
EventProceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States
Duration: Jun 27 2004Jul 2 2004

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Capacity and dirty paper coding for Gaussian broadcast channels with common information'. Together they form a unique fingerprint.

Cite this