On InterFerence Channel with Generalized Feedback (IFC-GF)

This work studies cooperative communication strategies for Interference Channels with Generalized Feedback (IFC-GF). IFC-GF models wireless peer-to-peer networks where several source-destination pairs share the same channel and, because of the broadcast nature of the wireless channel, each transmission can be overheard by the other users. In this model, the interference due to simultaneous communications furnishes the basis for cooperation among otherwise uncoordinated users. For the case of two source-destination pairs, we propose a coding strategy that combines the ideas of (i) information splitting (introduced by Han and Kobayashi for IFC without feedback), (ii) block Markov superposition coding (introduced by Cover and Leung for multiaccess channels with perfect feedback), and (iii) backward decoding (introduced by Willems in the context of multiaccess channels with cribbing encoders). We show that by exploiting the overheard information with the proposed scheme, users achieves collectively higher data rates than the case where the overheard information is neglected. We conclude by showing how our model reduces to well studied multiuser channels.

[1]  Abbas El Gamal,et al.  The capacity of a class of broadcast channels , 1979, IEEE Trans. Inf. Theory.

[2]  Aydano B. Carleial,et al.  Multiple-access channels with different generalized feedback signals , 1982, IEEE Trans. Inf. Theory.

[3]  J. Nicholas Laneman,et al.  Window decoding for the multiaccess channel with generalized feedback , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[4]  Aydano B. Carleial,et al.  Outer bounds on the capacity of interference channels , 1983, IEEE Trans. Inf. Theory.

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

[6]  Aydano B. Carleial,et al.  A case where interference does not reduce capacity (Corresp.) , 1975, IEEE Trans. Inf. Theory.

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

[8]  Sennur Ulukus,et al.  Effects of cooperation on the secrecy of multiple access channels with generalized feedback , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[9]  I. Marić The Strong Interference Channel with Unidirectional Cooperation , 2006 .

[10]  Mehul Motani,et al.  New coding strategies for the relay channel , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[11]  Bruce E. Hajek,et al.  Evaluation of an achievable rate region for the broadcast channel , 1979, IEEE Trans. Inf. Theory.

[12]  Deqiang Chen User Cooperation Diversity , 2003 .

[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]  Wei Wu,et al.  On the Capacity of Interference Channels with Degraded Message sets , 2006, ArXiv.

[15]  Jack K. Wolf,et al.  The capacity region of a multiple-access discrete memoryless channel can increase with feedback (Corresp.) , 1975, IEEE Trans. Inf. Theory.

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

[17]  Federico Kuhlmann,et al.  Achievability proof of some multiuser channel coding theorems using backward decoding , 1989, IEEE Trans. Inf. Theory.

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

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

[20]  Michael Gastpar,et al.  Cooperative strategies and capacity theorems for relay networks , 2005, IEEE Transactions on Information Theory.

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

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

[23]  Andries P. Hekstra,et al.  Dependence balance bounds for single-output two-way channels , 1989, IEEE Trans. Inf. Theory.

[24]  Hua Wang,et al.  Gaussian Interference Channel Capacity to Within One Bit , 2007, IEEE Transactions on Information Theory.

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

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

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

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

[29]  Edward C. van der Meulen,et al.  Random coding theorems for the general discrete memoryless broadcast channel , 1975, IEEE Trans. Inf. Theory.

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

[31]  G. Kramer,et al.  On Noisy Feedback for Interference Channels , 2006, 2006 Fortieth Asilomar Conference on Signals, Systems and Computers.

[32]  Elza Erkip,et al.  User cooperation diversity. Part I. System description , 2003, IEEE Trans. Commun..