By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Razaghi, P. ; Ming Hsieh Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA, USA ; Caire, G.

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.

Published in:

Information Theory, IEEE Transactions on  (Volume:58 ,  Issue: 10 )