Cooperative Multiple-Access Encoding With States Available at One Transmitter

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.

[1]  Neri Merhav,et al.  On the random coding error exponents of the single-user and the multiple-access Gel'fand-Pinsker channels , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

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

[3]  Neri Merhav,et al.  On joint information embedding and lossy compression in the presence of a stationary memoryless attack channel , 2004, IEEE Transactions on Information Theory.

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

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

[6]  Shlomo Shamai,et al.  On joint source-channel coding for the Wyner-Ziv source and the Gel'fand-Pinsker channel , 2003, IEEE Trans. Inf. Theory.

[7]  Anders Høst-Madsen,et al.  Capacity bounds for Cooperative diversity , 2006, IEEE Transactions on Information Theory.

[8]  Amos Lapidoth,et al.  The Gaussian watermarking game , 2000, IEEE Trans. Inf. Theory.

[9]  Wei Wu,et al.  On the Capacity of Gaussian Weak Interference Channels with Degraded Message sets , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[10]  Shlomo Shamai,et al.  On the achievable throughput of a multiantenna Gaussian broadcast channel , 2003, IEEE Transactions on Information Theory.

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

[12]  Shlomo Shamai,et al.  Achievable rates for the broadcast channel with states known at the transmitter , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[13]  Wei Wu,et al.  Capacity of a Class of Cognitive Radio Channels: Interference Channels With Degraded Message Sets , 2007, IEEE Transactions on Information Theory.

[14]  Patrick Mitran,et al.  Achievable rates in cognitive radio channels , 2006, IEEE Transactions on Information Theory.

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

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

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

[18]  Mung Chiang,et al.  Channel capacity and state estimation for state-dependent Gaussian channels , 2005, IEEE Transactions on Information Theory.

[19]  Neri Merhav,et al.  On the capacity game of public watermarking systems , 2004, IEEE Transactions on Information Theory.

[20]  Joseph A. O'Sullivan,et al.  Information-theoretic analysis of information hiding , 2003, IEEE Trans. Inf. Theory.

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

[22]  Shlomo Shamai,et al.  Nested linear/Lattice codes for structured multiterminal binning , 2002, IEEE Trans. Inf. Theory.

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

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

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

[26]  A. Lapidoth,et al.  Generalized writing on dirty paper , 2002, Proceedings IEEE International Symposium on Information Theory,.

[27]  Patrick Mitran,et al.  Limits on communications in a cognitive radio channel , 2006, IEEE Communications Magazine.

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

[29]  Neri Merhav.  On joint coding for watermarking and encryption , 2006, IEEE Transactions on Information Theory.

[30]  Shlomo Shamai,et al.  Information Rates Subjected to State Masking , 2006, 2006 IEEE International Symposium on Information Theory.

[31]  Tsachy Weissman,et al.  Coding for the feedback Gel'fand-Pinsker channel and the feedforward Wyner-Ziv source , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..