Message and State Cooperation in Multiple Access Channels

We investigate the capacity of a multiple access channel with cooperating encoders where partial state information is known to each encoder 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.

[1]  Gerhard Kramer,et al.  Topics in Multi-User Information Theory , 2008, Found. Trends Commun. Inf. Theory.

[2]  Shlomo Shamai,et al.  On the capacity of interference channels with one cooperating transmitter , 2007, Eur. Trans. Telecommun..

[3]  Roy D. Yates,et al.  Capacity of Interference Channels With Partial Transmitter Cooperation , 2007, IEEE Transactions on Information Theory.

[4]  Reza Khosravi-Farsani,et al.  The capacity region of fading Multiple Access Channels with cooperative encoders and partial CSIT , 2010, 2010 IEEE International Symposium on Information Theory.

[5]  Shlomo Shamai,et al.  Compound Multiple-Access Channels With Partial Cooperation , 2008, IEEE Transactions on Information Theory.

[6]  H. Vincent Poor,et al.  Secrecy Capacity Region of a Multiple-Antenna Gaussian Broadcast Channel With Confidential Messages , 2007, IEEE Transactions on Information Theory.

[7]  D. Slepian,et al.  A coding theorem for multiple access channels with correlated sources , 1973 .

[8]  Aaron D. Wyner,et al.  The rate-distortion function for source coding with side information at the decoder , 1976, IEEE Trans. Inf. Theory.

[9]  Reza Khosravi-Farsani,et al.  The Capacity Region of p -Transmitter/ q -Receiver Multiple-Access Channels With Common Information , 2011, IEEE Transactions on Information Theory.

[10]  Amiram H. Kaspi,et al.  Two-way source coding with a fidelity criterion , 1985, IEEE Trans. Inf. Theory.

[11]  Frans M. J. Willems,et al.  The discrete memoryless multiple access channel with partially cooperating encoders , 1983, IEEE Trans. Inf. Theory.

[12]  Gerhard Kramer,et al.  Dedicated-Relay vs. User Cooperation in Time-Duplexed Multiaccess Networks , 2011, J. Commun..

[13]  Abbas El Gamal,et al.  Lecture Notes on Network Information Theory , 2010, ArXiv.

[14]  Gerhard Kramer,et al.  Cooperative Communications , 2007, Found. Trends Netw..

[15]  David Tse,et al.  Interference Mitigation Through Limited Receiver Cooperation , 2009, IEEE Transactions on Information Theory.

[16]  Amir K. Khandani,et al.  On the Symmetric Gaussian Interference Channel with Partial Unidirectional Cooperation , 2009, ArXiv.

[17]  Gerhard Kramer.  Capacity results for the discrete memoryless network , 2003, IEEE Trans. Inf. Theory.

[18]  Haim H. Permuter,et al.  Two-Way Source Coding With a Helper , 2008, IEEE Transactions on Information Theory.

[19]  Abbas El Gamal,et al.  On the capacity of computer memory with defects , 1983, IEEE Trans. Inf. Theory.

[20]  Vinod M. Prabhakaran,et al.  Interference Channels With Source Cooperation , 2011, IEEE Transactions on Information Theory.

[21]  Yossef Steinberg,et al.  The multiple-access channel with partial state information at the encoders , 2005, IEEE Transactions on Information Theory.

[22]  Urbashi Mitra,et al.  Capacity Gain From Two-Transmitter and Two-Receiver Cooperation , 2007, IEEE Transactions on Information Theory.

[23]  Roy D. Yates,et al.  Discrete Memoryless Interference and Broadcast Channels With Confidential Messages: Secrecy Rate Regions , 2007, IEEE Transactions on Information Theory.

[24]  J. Pearl.  Causality: Models, Reasoning and Inference , 2000 .

[25]  Shlomo Shamai,et al.  Local Base Station Cooperation Via Finite-Capacity Links for the Uplink of Linear Cellular Networks , 2009, IEEE Transactions on Information Theory.

[26]  Ron Dabora,et al.  On the Role of Estimate-and-Forward With Time Sharing in Cooperative Communication , 2006, IEEE Transactions on Information Theory.

[27]  Vinod M. Prabhakaran,et al.  Interference Channels With Destination Cooperation , 2009, IEEE Transactions on Information Theory.

[28]  Amos Lapidoth,et al.  The Gaussian MAC with conferencing encoders , 2008, 2008 IEEE International Symposium on Information Theory.

[29]  Deniz Gündüz,et al.  Source and Channel Coding for Cooperative Relaying , 2005, IEEE Transactions on Information Theory.

[30]  Yossef Steinberg,et al.  Coding Problems for Channels With Partial State Information at the Transmitter , 2007, IEEE Transactions on Information Theory.

[31]  Amir K. Khandani,et al.  Generalized degrees of freedom of the symmetric gaussian interference channel with partial unidirectional transmitter cooperation , 2009, 2009 43rd Annual Conference on Information Sciences and Systems.

[32]  Haim H. Permuter,et al.  Coordination Capacity , 2009, IEEE Transactions on Information Theory.

[33]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[34]  Andrea J. Goldsmith,et al.  The impact of CSI and power allocation on relay channel capacity and cooperation strategies , 2007, IEEE Transactions on Wireless Communications.

[35]  L. Williams,et al.  Contents , 2020, Ophthalmology (Rochester, Minn.).

[36]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .