TY - GEN
T1 - Cooperation in multiple access channels in the presence of partial state information
AU - Permuter, Haim H.
AU - Shamai, Shlomo
AU - Somekh-Baruch, Anelia
PY - 2011/10/26
Y1 - 2011/10/26
N2 - We investigate the capacity of a multiple access channel with cooperating encoders where partial state information is known to each encoder in a non-causal way and full state information is known to the decoder. The cooperation between the encoders has a two-fold purpose: to generate empirical state coordination between the encoders, and to share information about the private messages that each encoder has. For two-way cooperation, this two-fold purpose is achieved by double-binning, where the first layer of binning is used to generate the state coordination similarly to the two-way source coding, and the second layer of binning is used to transmit information about the private messages. The complete result provides the framework and perspective for addressing a complex level of cooperation that mixes states and messages in an optimal way. We present few examples and compare the optimal coding scheme that combines the message and the state to naive cooperation schemes that are based on separate message and state coding.
AB - We investigate the capacity of a multiple access channel with cooperating encoders where partial state information is known to each encoder in a non-causal way and full state information is known to the decoder. The cooperation between the encoders has a two-fold purpose: to generate empirical state coordination between the encoders, and to share information about the private messages that each encoder has. For two-way cooperation, this two-fold purpose is achieved by double-binning, where the first layer of binning is used to generate the state coordination similarly to the two-way source coding, and the second layer of binning is used to transmit information about the private messages. The complete result provides the framework and perspective for addressing a complex level of cooperation that mixes states and messages in an optimal way. We present few examples and compare the optimal coding scheme that combines the message and the state to naive cooperation schemes that are based on separate message and state coding.
KW - Channel state information
KW - cooperating encoders
KW - coordination
KW - double-binning
KW - message-state cooperation
KW - multiple access channel
KW - superbin
UR - http://www.scopus.com/inward/record.url?scp=80054822485&partnerID=8YFLogxK
U2 - https://doi.org/10.1109/ISIT.2011.6034249
DO - https://doi.org/10.1109/ISIT.2011.6034249
M3 - Conference contribution
SN - 9781457705953
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 816
EP - 820
BT - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
T2 - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Y2 - 31 July 2011 through 5 August 2011
ER -