The Capacity Region of the Strong Interference Channel with Common Information

Transmitter cooperation enabled by dedicated links allows for a partial message exchange between encoders. After cooperation, each encoder knows a common message partially describing the two original messages, and its own private message containing the information that the encoders were not able to exchange. We consider the interference channel with both private and common messages at the encoders. A private message at an encoder is intended for a corresponding decoder whereas the common message is to be received at both decoders. We derive conditions under which the capacity region of this channel coincides with the capacity region of the channel in which both private messages are required at both receivers. We show that the obtained conditions are equivalent to the strong interference conditions determined by Costa and El Gamal for the interference channel with independent messages.

[1]  A. Host-Madsen,et al.  A new achievable rate for cooperative diversity based on generalized writing on dirty paper , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

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

[3]  A. Host-Madsen,et al.  On the achievable rate for receiver cooperation in ad-hoc networks , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[4]  Andrea J. Goldsmith,et al.  Transmitter cooperation in ad-hoc wireless networks: does dirty-paper coding beat relaying? , 2004, Information Theory Workshop.

[5]  Max H. M. Costa,et al.  The capacity region of the discrete memoryless interference channel with strong interference , 1987, IEEE Trans. Inf. Theory.

[6]  Gerhard Kramer,et al.  Outer bounds on the capacity of Gaussian interference channels , 2004, IEEE Transactions on Information Theory.

[7]  Roy D. Yates,et al.  The discrete memoryless compound multiple access channel with conferencing encoders , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[8]  Hiroshi Sato,et al.  Two-user communication channels , 1977, IEEE Trans. Inf. Theory.

[9]  Aydano B. Carleial,et al.  Interference channels , 1978, IEEE Trans. Inf. Theory.

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

[11]  R. Ahlswede.  The Capacity Region of a Channel with Two Senders and Two Receivers , 1974 .

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

[13]  Urbashi Mitra,et al.  Capacity of ad-hoc networks with node cooperation , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[14]  M.O. Hasna,et al.  On the capacity of cooperative diversity systems with adaptive modulation , 2005, Second IFIP International Conference on Wireless and Optical Communications Networks, 2005. WOCN 2005..

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