Approximate Capacity of a Class of Gaussian Interference-Relay Networks

In this paper, we study a Gaussian relay-interference network, in which relay (helper) nodes are to facilitate competing information flows between different source-destination pairs. We focus on two-stage relay-interference networks where there are weak cross links, causing the networks to behave like a chain of Z Gaussian channels. Our main result is an approximate characterization of the capacity region for such ZZ and ZS networks. We propose a new interference management scheme, termed interference neutralization, which is implemented using structured lattice codes. This scheme allows for over-the-air interference removal, without the transmitters having complete access the interfering signals. This scheme in conjunction a new network decomposition technique provides the approximate characterization. Our analysis of these Gaussian networks is based on insights gained from an exact characterization of the corresponding linear deterministic model.

[1]  Ayfer Özgür,et al.  Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks , 2006, IEEE Transactions on Information Theory.

[2]  Syed Ali Jafar,et al.  The Effect of Noise Correlation in Amplify-and-Forward Relay Networks , 2009, IEEE Transactions on Information Theory.

[3]  Massimo Franceschetti,et al.  The Capacity of Wireless Networks: Information-Theoretic and Physical Limits , 2009, IEEE Transactions on Information Theory.

[4]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[5]  Suhas N. Diggavi,et al.  Capacity of deterministic Z-chain relay-interference network , 2009, 2009 IEEE Information Theory Workshop on Networking and Information Theory.

[6]  Vinod M. Prabhakaran,et al.  Interference Channels With Destination Cooperation , 2009, IEEE Transactions on Information Theory.

[7]  Suhas N. Diggavi,et al.  Wireless Network Information Flow , 2007, ArXiv.

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

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

[10]  Syed Ali Jafar,et al.  Interference Alignment and Degrees of Freedom of the $K$-User Interference Channel , 2008, IEEE Transactions on Information Theory.

[11]  Suhas N. Diggavi,et al.  Wireless Network Information Flow: A Deterministic Approach , 2009, IEEE Transactions on Information Theory.

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

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

[14]  Suhas N. Diggavi,et al.  Transmission techniques for relay-interference networks , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[15]  Valentin Simeonov,et al.  École polytechnique fédérale de Lausanne (EPFL) , 2018, The Grants Register 2019.

[16]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[17]  David Tse,et al.  Symmetric feedback capacity of the Gaussian interference channel to within one bit , 2009, 2009 IEEE International Symposium on Information Theory.

[18]  Suhas N. Diggavi,et al.  A Deterministic Approach to Wireless Relay Networks , 2007, ArXiv.

[19]  Amir K. Khandani,et al.  Communication Over MIMO X Channels: Interference Alignment, Decomposition, and Performance Analysis , 2008, IEEE Transactions on Information Theory.

[20]  David Tse,et al.  The two-user Gaussian interference channel: a deterministic view , 2008, Eur. Trans. Telecommun..