Cooperative multiple access encoding with states available at one transmitter

Anelia Somekh-Baruch, Shlomo Shamai, Sergio Verdú

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Scopus citations

Abstract

We generalize the Gel'fand-Pinsker model to encompass the setup of a memory less multiple -access channel. According to this setup, only one of the encoders knows the slate of the channel (non-causally), 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 non-causal and causal stale information. Further, wc apply the general formula to the Gaussian case with non-causal 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)
Title of host publicationProceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007
Pages1556-1560
Number of pages5
DOIs
StatePublished - 2007
Event2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice, France
Duration: Jun 24 2007Jun 29 2007

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101

Other

Other2007 IEEE International Symposium on Information Theory, ISIT 2007
Country/TerritoryFrance
CityNice
Period6/24/076/29/07

All Science Journal Classification (ASJC) codes

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

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