A new achievable region for interference channel with generalized feedback

Interference channels (IFC) model peer-to-peer networks where several source-destination pairs compete for the same channel resources. IFCs with generalized feedback (IFC-GF) further model scenarios where the sources can sense the current channel activity, like in wireless channels. The signal overheard from the channel provides information about the messages sent by the other users, and furnishes the basis for cooperation among otherwise uncoordinated users. Although cooperative communications is not equivalent to virtual MIMO communications, it has been shown that it benefits the performance of all the involved source-destination pairs without increasing neither the transmit powers nor the channel bandwidth. In this paper, we describe a new achievable region for IFC-GFs that generalizes, and simplifies, previously known inner bound regions. The new region is based on the idea of binning the users' codebook known at all transmitters against each other (in order to pre-cancel part of the interference, as in broadcast channels), and superposition binning for the rest of the codebooks (as in cognitive IFCs).

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

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

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

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

[5]  Mehul Motani,et al.  On The Han–Kobayashi Region for theInterference Channel , 2008, IEEE Transactions on Information Theory.

[6]  Katalin Marton,et al.  A coding theorem for the discrete memoryless broadcast channel , 1979, IEEE Trans. Inf. Theory.

[7]  Yi Cao,et al.  An Achievable Rate Region for Interference Channels with Conferencing , 2007, 2007 IEEE International Symposium on Information Theory.

[8]  Wei Wu,et al.  On the Capacity of Multiple Access Channels with State Information and Feedback , 2006, ArXiv.

[9]  Syed Ali Jafar,et al.  Capacity of Wireless Networks within o(log(SNR)) - the Impact of Relays, Feedback, Cooperation and Full-Duplex Operation , 2008, ArXiv.

[10]  Frans M. J. Willems,et al.  The discrete memoryless multiple-access channel with cribbing encoders , 1985, IEEE Trans. Inf. Theory.

[11]  Mung Chiang,et al.  Duality between channel capacity and rate distortion with two-sided state information , 2002, IEEE Trans. Inf. Theory.

[12]  Cyril Leung,et al.  An achievable rate region for the multiple-access channel with feedback , 1981, IEEE Trans. Inf. Theory.