Cooperative multiple-access encoding with states available at one transmitter

Anelia Somekh-Baruch; Shlomo Shamai; Sergio Verdú

doi:10.1109/tit.2008.928977

Cooperative multiple-access encoding with states available at one transmitter

Anelia Somekh-Baruch
, Shlomo Shamai
, Sergio Verdú

Princeton University
Technion-Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

106 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 language	English
Pages (from-to)	4448-4469
Number of pages	22
Journal	IEEE Transactions on Information Theory
Volume	54
Issue number	10
DOIs	https://doi.org/10.1109/tit.2008.928977
State	Published - 2008
Externally published	Yes

Bibliographical note

Funding Information:
Manuscript received January 18, 2007; revised March 29, 2008. Current version published September 17, 2008. This work was supported by a Marie Curie International Fellowship within the 6th European Community Framework Programme. The work of S. Shamai (Shitz) and S. Verdú has also been supported by the Binational US-Israel Scientific Foundation under Grant 2004140.

Funding

Manuscript received January 18, 2007; revised March 29, 2008. Current version published September 17, 2008. This work was supported by a Marie Curie International Fellowship within the 6th European Community Framework Programme. The work of S. Shamai (Shitz) and S. Verdú has also been supported by the Binational US-Israel Scientific Foundation under Grant 2004140.

Funders	Funder number
US-Israel Scientific Foundation	2004140
Sixth Framework Programme

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

Access to Document

10.1109/tit.2008.928977

Cite this

@article{a5891d80399a4f0781934340010258b9,

title = "Cooperative multiple-access encoding with states available at one transmitter",

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.",

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",

author = "Anelia Somekh-Baruch and Shlomo Shamai and Sergio Verd{\'u}",

note = "Funding Information: Manuscript received January 18, 2007; revised March 29, 2008. Current version published September 17, 2008. This work was supported by a Marie Curie International Fellowship within the 6th European Community Framework Programme. The work of S. Shamai (Shitz) and S. Verd{\'u} has also been supported by the Binational US-Israel Scientific Foundation under Grant 2004140.",

year = "2008",

doi = "10.1109/tit.2008.928977",

language = "אנגלית",

volume = "54",

pages = "4448--4469",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "10",

}

TY - JOUR

T1 - Cooperative multiple-access encoding with states available at one transmitter

AU - Somekh-Baruch, Anelia

AU - Shamai, Shlomo

AU - Verdú, Sergio

N1 - Funding Information: Manuscript received January 18, 2007; revised March 29, 2008. Current version published September 17, 2008. This work was supported by a Marie Curie International Fellowship within the 6th European Community Framework Programme. The work of S. Shamai (Shitz) and S. Verdú has also been supported by the Binational US-Israel Scientific Foundation under Grant 2004140.

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

KW - Binning

KW - Causal side information

KW - Channel capacity

KW - Channel coding

KW - Cooperation

KW - Decoding

KW - Dirty-paper channel

KW - Encoding

KW - Gel'fand-Pinsker channel

KW - Interference

KW - Joints

KW - Multiuser channels

KW - Noncausal side information

KW - Transmitters

UR - https://www.scopus.com/pages/publications/54749094477

U2 - 10.1109/tit.2008.928977

DO - 10.1109/tit.2008.928977

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:54749094477

SN - 0018-9448

VL - 54

SP - 4448

EP - 4469

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 10

ER -

Cooperative multiple-access encoding with states available at one transmitter

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this