Cooperative multiple-access encoding with states available at one transmitter

Anelia Somekh-Baruch, Shlomo Shamai, Sergio Verdú

Research output: Contribution to journalArticlepeer-review

92 Scopus citations

Abstract

We generalize the Gel'fand-Pinsker model to encompass the setup of a memoryless multiple-access channel (MAC). According to this setup, only one of the encoders knows the state of the channel (noncausally), which is also unknown to the receiver. Two independent messages are transmitted: a common message and a message transmitted by the informed encoder. We find explicit characterizations of the capacity region with both noncausal and causal state information. Further, we study the noise-free binary case, and we also apply the general formula to the Gaussian case with noncausal channel state information, under an individual power constraint as well as a sum power constraint. In this case, the capacity region is achievable by a generalized writing-on-dirty-paper scheme.

Original languageEnglish (US)
Pages (from-to)4448-4469
Number of pages22
JournalIEEE Transactions on Information Theory
Volume54
Issue number10
DOIs
StatePublished - Oct 9 2008

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Keywords

  • Binning
  • Causal side information
  • Channel capacity
  • Channel coding
  • Cooperation
  • Decoding
  • Dirty-paper channel
  • Encoding
  • Gel'fand-Pinsker channel
  • Interference
  • Joints
  • Multiuser channels
  • Noncausal side information
  • Transmitters

Fingerprint Dive into the research topics of 'Cooperative multiple-access encoding with states available at one transmitter'. Together they form a unique fingerprint.

Cite this