An Achievable Rate Region for Interference Channels with Common Information

In this paper, we investigate the interference channel with common information, of which the two senders need send not only the private information but also certain common information to their receivers. We study the channel indirectly via a modified channel. An achievable rate region is first obtained for the modified channel via a random coding scheme termed as the "cascaded" superposition coding, and then quickly extended to one for the interference channel with common information.

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

[2]  Claude E. Shannon,et al.  Two-way Communication Channels , 1961 .

[3]  G. Kramer,et al.  Review of Rate Regions for Interference Channels , 2006, 2006 International Zurich Seminar on Communications.

[4]  K. -.  A Comparison of Two Achievable Rate Regions for the Interference Channel , 2006 .

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

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

[7]  Te Sun Han,et al.  A new achievable rate region for the interference channel , 1981, IEEE Trans. Inf. Theory.

[8]  Thomas M. Cover,et al.  An achievable rate region for the broadcast channel , 1975, IEEE Trans. Inf. Theory.

[9]  Jinhua Jiang,et al.  Interference Channels With Common Information , 2006, IEEE Transactions on Information Theory.

[10]  R. Benzel,et al.  The capacity region of a class of discrete additive degraded interference channels (Corresp.) , 1979, IEEE Trans. Inf. Theory.

[11]  I. Maric,et al.  The Capacity Region of the Strong Interference Channel with Common Information , 2005, Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005..

[12]  Max H. M. Costa,et al.  The capacity region of a class of deterministic interference channels , 1982, IEEE Trans. Inf. Theory.

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