Near-Optimal Quantization and Linear Network Coding for Relay Networks

We introduce a discrete network corresponding to any Gaussian wireless network that is obtained by simply quantizing the received signals and restricting the transmitted signals to a finite precision. Since signals in the discrete network are obtained from those of a Gaussian network, the Gaussian network can be operated on the quantization-based digital interface defined by the discrete network. We prove that this digital interface is near optimal for Gaussian relay networks and the capacities of the Gaussian and the discrete networks are within a bounded gap of O(M2) bits, where M is the number of nodes. We also prove that any near-optimal coding strategy for the discrete network can be naturally transformed into a near-optimal coding strategy for the Gaussian network merely by quantization. We exploit this property by designing a linear coding strategy for the case of layered discrete relay networks. The linear coding strategy is near optimal and achieves all rates within O(M2) bits of the capacity, independent of channel gains or signal-to-noise ratio. The linear code is therefore a near-optimal strategy for layered Gaussian relay networks and can be used as on the Gaussian network after simply quantizing the signals. The relays in the linear code need not know the channel gains on either the incoming or the outgoing links. The transmit and receive signals at all relays are simply quantized to binary tuples of the same length n, which is all that the nodes need to know. The linear network code is a particularly simple scheme and requires all the relay nodes to collect the received binary tuples into a long binary vector and apply a linear transformation on the long vector. The resulting binary vector is split into smaller binary tuples for transmission by the relays. The quantization requirements of the linear network code are completely defined by the parameter n, which therefore also determines the resolution of the analog-to-digital and digital-to-analog converters that are required for operating the network within a bounded gap of the network's capacity. As evident from the description, the linear network code explicitly connects network coding for wireline networks with codes for Gaussian networks.

[1]  David Tse,et al.  Quantize-map-and-forward relaying: Coding and system design , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

[3]  Abdel R. El Gamal,et al.  On information flow in relay networks , 1981 .

[4]  Panganamala Ramana Kumar,et al.  An achievable rate for the multiple-level relay channel , 2005, IEEE Transactions on Information Theory.

[5]  Sreeram Kannan,et al.  Multicommodity flows and cuts in polymatroidal networks , 2011, ITCS '12.

[6]  Sriram Vishwanath,et al.  Expansion coding: Achieving the capacity of an AEN channel , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

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

[8]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.

[9]  Suhas N. Diggavi,et al.  Approximately achieving Gaussian relay network capacity with lattice codes , 2010, 2010 IEEE International Symposium on Information Theory.

[10]  E. Meulen,et al.  Three-terminal communication channels , 1971, Advances in Applied Probability.

[11]  Abbas El Gamal,et al.  Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).

[12]  Michael Gastpar,et al.  Cooperative strategies and capacity theorems for relay networks , 2005, IEEE Transactions on Information Theory.

[13]  Robin Milner,et al.  An Algebraic Definition of Simulation Between Programs , 1971, IJCAI.

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

[15]  Tracey Ho,et al.  Low-complexity near-optimal codes for Gaussian relay networks , 2012, 2012 International Conference on Signal Processing and Communications (SPCOM).

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

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

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

[19]  Frank R. Kschischang,et al.  An Algebraic Approach to Physical-Layer Network Coding , 2010, IEEE Transactions on Information Theory.

[20]  Pramod Viswanath,et al.  Compress-and-forward scheme for a relay network: Approximate optimality and connection to algebraic flows , 2010, 2011 IEEE International Symposium on Information Theory Proceedings.

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

[22]  Panganamala Ramana Kumar,et al.  A Digital Interface for Gaussian Relay and Interference Networks: Lifting Codes From the Discrete Superposition Model , 2011, IEEE Transactions on Information Theory.

[23]  Sreeram Kannan,et al.  Capacity of Multiple Unicast in Wireless Networks: A Polymatroidal Approach , 2011, IEEE Transactions on Information Theory.

[24]  Panganamala Ramana Kumar,et al.  Scaling Laws for Ad Hoc Wireless Networks: An Information Theoretic Approach , 2006, Found. Trends Netw..

[25]  Thomas M. Cover,et al.  Network Information Theory , 2001 .

[26]  Soung Chang Liew,et al.  Physical-layer network coding: Tutorial, survey, and beyond , 2011, Phys. Commun..

[27]  Shuo-Yen Robert Li,et al.  Binary error correcting network codes , 2011, 2011 IEEE Information Theory Workshop.

[28]  Suhas N. Diggavi,et al.  Approximate capacity of Gaussian relay networks , 2008, 2008 IEEE International Symposium on Information Theory.

[29]  Andrea J. Goldsmith,et al.  Multihop Analog Network Coding via Amplify-and-Forward: The High SNR Regime , 2012, IEEE Transactions on Information Theory.

[30]  Panganamala Ramana Kumar,et al.  A network information theory for wireless communication: scaling laws and optimal operation , 2004, IEEE Transactions on Information Theory.

[31]  Joy A. Thomas,et al.  Feedback can at most double Gaussian multiple access channel capacity , 1987, IEEE Trans. Inf. Theory.