On noisy network coding for a Gaussian relay chain network with correlated noises

Noisy network coding, which elegantly combines the conventional compress-and-forward relaying strategy and ideas from network coding, has recently drawn much attention for its simplicity and optimality in achieving to within constant gap of the capacity of the multisource multicast Gaussian network. The constant-gap result, however, applies only to Gaussian relay networks with independent noises. This paper investigates the application of noisy network coding to networks with correlated noises. By focusing on a four-node Gaussian relay chain network with a particular noise correlation structure, it is shown that noisy network coding can no longer achieve to within constant gap to capacity with the choice of Gaussian inputs and Gaussian quantization. The cut-set bound of the relay chain network in this particular case, however, can be achieved to within half a bit by a simple concatenation of a correlation-aware noisy network coding strategy and a decode-and-forward scheme.

[1]  Sae-Young Chung,et al.  Gaussian Relay Channel Capacity to Within a Fixed Number of Bits , 2010, ArXiv.

[2]  Zhen Zhang,et al.  Partial converse for a relay channel , 1988, IEEE Trans. Inf. Theory.

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

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

[5]  Wei Yu,et al.  Gaussian Z-Interference Channel With a Relay Link: Achievability Region and Asymptotic Sum Capacity , 2010, IEEE Transactions on Information Theory.

[6]  David Tse,et al.  Interference Mitigation Through Limited Receiver Cooperation , 2009, IEEE Transactions on Information Theory.

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

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

[9]  Wei Yu,et al.  Capacity of a Class of Modulo-Sum Relay Channels , 2007, IEEE Transactions on Information Theory.