Multiple access channel with states known noncausally at one encoder and only strictly causally at the other encoder

We consider a two-user state-dependent multiaccess channel in which the states of the channel are known non-causally to one of the encoders and only strictly causally to the other encoder. Both encoders transmit a common message and, in addition, the encoder that knows the states non-causally transmits an individual message. We study the capacity region of this communication model. In the discrete memoryless case, we establish inner and outer bounds on the capacity region. Although the encoder that sends both messages knows the states fully, we show that the strictly causal knowledge of these states at the other encoder can be beneficial for this encoder, and in general enlarges the capacity region. Furthermore, we find an explicit characterization of the capacity in the case in which the two encoders transmit only the common message. In the Gaussian case, we characterize the capacity region for the model with individual message as well. Our converse proof in this case shows that, for this model, strictly causal knowledge of the state at one of the encoders does not increase capacity if the other is informed non-causally, a result which sheds more light on the utility of conveying a compressed version of the state to the decoder in recent results by Lapidoth and Steinberg on a multiacess model with only strictly causal state at both encoders and independent messages.

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

[2]  Luc Vandendorpe,et al.  Multiaccess channels with state known to one encoder: Another case of degraded message sets , 2009, 2009 IEEE International Symposium on Information Theory.

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

[4]  Amos Lapidoth,et al.  The multiple access channel with two independent states each known causally to one encoder , 2010, 2010 IEEE International Symposium on Information Theory.

[5]  Amos Lapidoth,et al.  The state-dependent multiple-access channel with states available at a cribbing encoder , 2010, 2010 IEEE 26-th Convention of Electrical and Electronics Engineers in Israel.

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

[7]  Luc Vandendorpe,et al.  Cooperative Relaying With State Available Noncausally at the Relay , 2009, IEEE Transactions on Information Theory.

[8]  Luc Vandendorpe,et al.  Cooperative relaying with state available at the relay , 2007, 2008 IEEE Information Theory Workshop.

[9]  Xiugang Wu,et al.  On the Optimal Compressions in the Compress-and-Forward Relay Schemes , 2010, IEEE Transactions on Information Theory.

[10]  Shlomo Shamai,et al.  Cooperative Schemes for a Source and an Occasional Nearby Relay in Wireless Networks , 2009, IEEE Transactions on Information Theory.

[11]  J. Nicholas Laneman,et al.  Multiaccess Channels with State Known to Some Encoders and Independent Messages , 2008, EURASIP J. Wirel. Commun. Netw..

[12]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.

[13]  Young-Han Kim,et al.  On multiple user channels with state information at the transmitters , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[14]  Osvaldo Simeone,et al.  Message and State Cooperation in a Relay Channel When Only the Relay Knows the State , 2011, ArXiv.

[15]  Kannan Ramchandran,et al.  Duality between source coding and channel coding and its extension to the side information case , 2003, IEEE Trans. Inf. Theory.

[16]  Shlomo Shamai,et al.  Cooperative Multiple-Access Encoding With States Available at One Transmitter , 2008, IEEE Transactions on Information Theory.

[17]  Ahmad Abu Al Haija,et al.  On Compress-Forward without Wyner-Ziv Binning for Relay Networks , 2011, ArXiv.

[18]  Luc Vandendorpe,et al.  Lower Bounds on the Capacity of the Relay Channel with States at the Source , 2008, EURASIP J. Wirel. Commun. Netw..

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

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

[21]  Amos Lapidoth,et al.  The multiple access channel with causal and strictly causal side information at the encoders , 2010 .

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

[23]  Amos Lapidoth,et al.  A note on multiple-access channels with strictly-causal state information , 2011, 2011 Wireless Advanced.

[24]  Uri Erez,et al.  Lattice Strategies for the Dirty Multiple Access Channel , 2007, IEEE Transactions on Information Theory.

[25]  R. Gallager.  Information Theory and Reliable Communication , 1968 .

[26]  Gerhard Kramer,et al.  On message lengths for noisy network coding , 2011, 2011 IEEE Information Theory Workshop.

[27]  Osvaldo Simeone,et al.  Multiple Access Channels With States Causally Known at Transmitters , 2010, IEEE Transactions on Information Theory.

[28]  Uri Erez,et al.  Lattice Strategies for the Dirty Multiple Access Channel , 2007, ISIT.

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

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

[31]  Gunter Dueck,et al.  Partial Feedback for Two-Way and Broadcast Channels , 1980, Inf. Control..

[32]  Neri Merhav,et al.  Channel Coding in the Presence of Side Information , 2008, Found. Trends Commun. Inf. Theory.

[33]  Sae-Young Chung,et al.  Noisy Network Coding , 2010, IEEE Transactions on Information Theory.

[34]  Giacomo Como,et al.  On the Capacity of Memoryless Finite-State Multiple-Access Channels With Asymmetric State Information at the Encoders , 2011, IEEE Transactions on Information Theory.

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

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

[37]  Mikael Skoglund,et al.  On cooperative downlink transmission with frequency reuse , 2009, 2009 IEEE International Symposium on Information Theory.

[38]  Gregory W. Wornell,et al.  Carbon Copying Onto Dirty Paper , 2007, IEEE Transactions on Information Theory.

[39]  Shlomo Shamai,et al.  Fading Channels: Information-Theoretic and Communication Aspects , 1998, IEEE Trans. Inf. Theory.

[40]  Claude E. Shannon,et al.  The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.

[41]  Imre Csiszár,et al.  Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.

[42]  Fady Alajaji,et al.  On the capacity of memoryless finite-state multiple access channels with asymmetric noisy state information at the encoders , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[43]  Reza Khosravi-Farsani,et al.  Capacity bounds for multiuser channels with non-causal channel state information at the transmitters , 2011, 2011 IEEE Information Theory Workshop.