Coarse Network Coding: A Simple Relay Strategy for Two-User Gaussian Interference Channels

Reminiscent of the parity function in network coding for the butterfly network, it is shown that forwarding an even or odd indicator bit for a scalar quantization of a relay observation recovers 1 bit of information at the two destinations in a noiseless interference channel where interference is treated as noise. Inspired by this observation, a scalar quantization-binning strategy for a two-user interference relay channel is proposed where the relay simultaneously helps both users using an out-of-band link of constant rate R0. For the proposed strategy, we devise practical coding schemes using low-density parity-check codes for two scenarios: 1) a matched scenario where the input alphabet of the interference signal is known to the destination decoder, and 2) a mismatched scenario that assumes no such knowledge. In both scenarios, we show that our strategy significantly improves the performance. We also present a theoretical analysis of our coding scheme using generalized mutual information.

[1]  Sae-Young Chung,et al.  Noisy Network Coding , 2010, IEEE Transactions on Information Theory.

[2]  Sae-Young Chung,et al.  On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit , 2001, IEEE Communications Letters.

[3]  Shlomo Shamai,et al.  On information rates for mismatched decoders , 1994, IEEE Trans. Inf. Theory.

[4]  Andrea J. Goldsmith,et al.  On the capacity of the interference channel with a relay , 2008, 2008 IEEE International Symposium on Information Theory.

[5]  Elza Erkip,et al.  Achievable Rates for the Gaussian Interference Relay Channel , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[6]  Shlomo Shamai,et al.  Nested linear/Lattice codes for structured multiterminal binning , 2002, IEEE Trans. Inf. Theory.

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

[8]  Thomas E. Fuja,et al.  Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels , 2006, IEEE Transactions on Information Theory.

[9]  Michael Gastpar,et al.  Compute-and-Forward: Harnessing Interference Through Structured Codes , 2009, IEEE Transactions on Information Theory.

[10]  Muriel Médard,et al.  XORs in the Air: Practical Wireless Network Coding , 2006, IEEE/ACM Transactions on Networking.

[11]  Mikael Skoglund,et al.  Optimized analog network coding strategies for the white Gaussian multiple-access relay channel , 2009, 2009 IEEE Information Theory Workshop.

[12]  T. Ho,et al.  On Linear Network Coding , 2010 .

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

[14]  Elza Erkip,et al.  Interference Channel aided by an Infrastructure Relay , 2009, 2009 IEEE International Symposium on Information Theory.

[15]  Wei Yu,et al.  Universal relaying for the interference channel , 2010, 2010 Information Theory and Applications Workshop (ITA).

[16]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[17]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[18]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[19]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .

[20]  O. Sahin,et al.  On Achievable Rates for Interference Relay Channel with Interference Cancelation , 2007, 2007 Conference Record of the Forty-First Asilomar Conference on Signals, Systems and Computers.