Multiple Access Channels with Cooperative Encoders and Channel State Information

The two-user Multiple Access Channel (MAC) with cooperative encoders and Channel State Information (CSI) is considered where two different scenarios are investigated: A two-user MAC with common message (MACCM) and a two-user MAC with conferencing encoders (MACCE). For both situations, the two cases where the CSI is known to the encoders either non-causally or causally are studied. Achievable rate regions are established for both discrete memoryless channels and Gaussian channels with additive interference. The achievable rate regions derived for the Gaussian models with additive interference known non-causally to the encoders are shown to coincide with the capacity region of the same channel with no interference. Therefore, the capacity region for such channels is established.

[1]  Young-Han Kim,et al.  Multiple user writing on dirty paper , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[2]  Syed Ali Jafar.  Capacity With Causal and Noncausal Side Information: A Unified View , 2006, IEEE Transactions on Information Theory.

[3]  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.

[4]  Claude E. Shannon,et al.  Channels with Side Information at the Transmitter , 1958, IBM J. Res. Dev..

[5]  I-Hsiang Wang.  Distributed Interference Cancellation in Multiple Access Channel with Transmitter Cooperation , 2010, ArXiv.

[6]  Angela Michèle Wigger,et al.  Cooperation on the Multiple-Access Channel , 2008 .

[7]  Yossef Steinberg,et al.  Coding for the degraded broadcast channel with random parameters, with causal and noncausal side information , 2005, IEEE Transactions on Information Theory.

[8]  Young-Han Kim,et al.  On Multiple User Channels with Causal State Information at the Transmitters , 2005, ArXiv.

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

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

[11]  Nan Liu,et al.  Capacity region and optimum power control strategies for fading Gaussian multiple access channels with common data , 2006, IEEE Transactions on Communications.

[12]  Luc Vandendorpe,et al.  Rate Regions for the Partially-Cooperative Relay Broadcast Channel with Non-causal Side Information , 2007, 2007 IEEE International Symposium on Information Theory.

[13]  Reza Khosravi-Farsani,et al.  Achievable rate regions for Dirty Tape Channels and “joint writing on Dirty paper and Dirty Tape” , 2010, 2010 IEEE Information Theory Workshop.

[14]  Shlomo Shamai,et al.  Message and State Cooperation in Multiple Access Channels , 2010, IEEE Transactions on Information Theory.

[15]  Mahtab Mirmohseni,et al.  Cooperative relay-broadcast channels with causal Channel State Information , 2009, 2009 IEEE International Symposium on Information Theory.

[16]  Shlomo Shamai,et al.  Capacity and lattice strategies for canceling known interference , 2005, IEEE Transactions on Information Theory.

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

[18]  Max H. M. Costa,et al.  Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.