Analog Network Coding in the High-SNR Regime

A node performing analog network coding simply forwards a signal it receives over a wireless channel. This allows for a (noisy) linear combination of signals simultaneously sent from multiple sources to be forwarded in the network. As such, analog network coding extends the idea of network coding to wireless networks. However, the analog network coding performance is limited by propagated noise, and we expect this strategy to perform well only in high SNR. In this paper, we formalize this intuition and determine high-SNR conditions under which analog network coding approaches capacity in a layered relay network. By relating the received SNR at the nodes with the propagated noise, we determine the rate achievable with analog network coding. In particular, when all the received powers are lower bounded by 1/δ, the propagated noise power in a network with L layers is of the order Lδ. The result demonstrates that the analog network coding approaches the cut-set bound as the received powers at relays increase. As all powers in the network increase, the analog network coding rate is within a constant gap from the upper bound. The gap depends on number of nodes. We further demonstrate by an example that analog network coding can perform close to sum-capacity also in the multicast case.

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

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

[3]  M. Vetterli,et al.  On the capacity of large Gaussian relay networks , 2005 .

[4]  Brett Schein,et al.  Distributed coordination in network information theory , 2001 .

[5]  Roy D. Yates,et al.  Bandwidth and Power Allocation for Cooperative Strategies in Gaussian Relay Networks , 2004, IEEE Transactions on Information Theory.

[6]  Michael Gastpar,et al.  On the capacity of large Gaussian relay networks , 2005, IEEE Transactions on Information Theory.

[7]  Gerhard Kramer Pipelined encoding for deterministic and noisy relay networks , 2009, 2009 Workshop on Network Coding, Theory, and Applications.

[8]  Muriel Médard,et al.  An algebraic approach to network coding , 2003, TNET.

[9]  P. Vijay Kumar,et al.  Diversity and degrees of freedom of cooperative wireless networks , 2008, 2008 IEEE International Symposium on Information Theory.

[10]  P. Vijay Kumar,et al.  DMT of multi-hop cooperative networks-Part II: Layered and multi-antenna networks , 2008, 2008 IEEE International Symposium on Information Theory.

[11]  Jean-Claude Belfiore,et al.  Diversity of MIMO Multihop Relay Channels , 2007, ArXiv.

[12]  Helmut Bölcskei,et al.  Capacity scaling laws in MIMO relay networks , 2006, IEEE Transactions on Wireless Communications.

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

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

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

[16]  Lizhong Zheng,et al.  Amplify-and-Forward in Wireless Relay Networks: Rate, Diversity, and Network Size , 2007, IEEE Transactions on Information Theory.

[17]  Sachin Katti,et al.  Embracing wireless interference: analog network coding , 2007, SIGCOMM '07.

[18]  Aaron D. Wyner,et al.  The rate-distortion function for source coding with side information at the decoder , 1976, IEEE Trans. Inf. Theory.

[19]  J. Wolfowitz The rate distortion function for source coding with side information at the decoder , 1979 .

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

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

[22]  P. Vijay Kumar,et al.  DMT of multi-hop cooperative networks-Part I: K-Parallel-Path networks , 2008, 2008 IEEE International Symposium on Information Theory.

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