Linear physical layer network coding for multihop wireless networks

We consider linear network coding functions that can be employed at the relays in wireless physical layer network coding, applied to a general multi-hop network topology. We introduce a general model of such a network, and discuss the algebraic basis of linear functions, deriving conditions for unambiguous decodability of the source data at the destination. We consider the use of integer rings, integer fields, binary extension fields and the ring of binary matrices as potential algebraic constructs, and show that the ring constructs provide more flexibility. We use the two-way relay channel and a network containing two sources and two relays to illustrate the concept and to demonstrate the effect of fading of the wireless channels. We show the capacity benefits of the more flexible rings.

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

[2]  B. Sundar Rajan,et al.  Wireless bidirectional relaying and Latin Squares , 2011, 2012 IEEE Wireless Communications and Networking Conference (WCNC).

[3]  Toshiaki Koike-Akino,et al.  Optimized constellations for two-way wireless relaying with physical network coding , 2009, IEEE Journal on Selected Areas in Communications.

[4]  Qifu Tyler Sun,et al.  Lattice Network Codes Based on Eisenstein Integers , 2012, IEEE Transactions on Communications.

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

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

[7]  Uri Erez,et al.  Achieving 1/2 log (1+SNR) on the AWGN channel with lattice encoding and decoding , 2004, IEEE Transactions on Information Theory.