Compress-and-Forward Scheme for Relay Networks: Backword Decoding and Connection to Bisubmodular Flows

In this paper, a compress-and-forward scheme with backward decoding is presented for the unicast wireless relay network. The encoding at the source and relay is a generalization of the noisy network coding (NNC) scheme. While it achieves the same reliable data rate as NNC scheme, the backward decoding allows for a better decoding complexity as compared with the joint decoding of the NNC scheme. Characterizing the layered decoding scheme is shown to be equivalent to characterizing an information flow for the wireless network. A node-flow for a graph with bisubmodular capacity constraints is presented and a max-flow min-cut theorem is presented. This generalizes many well-known results of flows over capacity constrained graphs studied in computer science literature. The results for the unicast relay network are generalized to the network with multiple sources with independent messages intended for a single destination.

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

[2]  Christina Fragouli,et al.  Combinatiorial algorithms for wireless information flow , 2012, TALG.

[3]  James R. Lee,et al.  Improved approximation algorithms for minimum-weight vertex separators , 2005, STOC '05.

[4]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

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

[6]  Thomas M. Cover,et al.  Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing) , 2006 .

[7]  Suhas Diggavi,et al.  On noise insertion strategies for wireless network secrecy , 2009, 2009 Information Theory and Applications Workshop.

[8]  Suhas Diggavi,et al.  Information-theoretic secrecy for wireless networks , 2009 .

[9]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[10]  Serap A. Savari,et al.  A Max-Flow/Min-Cut Algorithm for Linear Deterministic Relay Networks , 2011, IEEE Transactions on Information Theory.

[11]  Axthonv G. Oettinger,et al.  IEEE Transactions on Information Theory , 1998 .

[12]  Xiugang Wu,et al.  On the Optimal Compressions in the Compress-and-Forward Relay Schemes , 2010, IEEE Transactions on Information Theory.

[13]  E. L. Lawler,et al.  Computing Maximal "Polymatroidal" Network Flows , 1982, Math. Oper. Res..

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

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

[16]  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.

[17]  Satoru Iwata,et al.  A flow model based on polylinking system , 2011, Mathematical Programming.

[18]  Alexander K. Kelmans,et al.  Multiplicative submodularity of a matrix's principal minor as a function of the set of its rows and some combinatorial applications , 1983, Discret. Math..

[19]  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).

[20]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.