Efficient Compute-and-Forward Network Codes Search for Two-Way Relay Channel

We consider the two-way relay channel (TWRC) with compute-and-forward network coding strategy. First a new lemma is proposed as network codes search criteria for TWRC. Then, instead of exhaustive search, we present an efficient network codes search algorithm based on modified Fincke-Pohst method. Numerical results demonstrate the effectiveness and complexity reduction of our proposed lemma and algorithm.

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

[2]  R. Zamir.  Lattices are everywhere , 2009, 2009 Information Theory and Applications Workshop.

[3]  Soung Chang Liew,et al.  > Replace This Line with Your Paper Identification Number (double-click Here to Edit) < 1 , 2022 .

[4]  Jean-Claude Belfiore,et al.  The Compute-and-Forward Protocol: Implementation and Practical Aspects , 2011, ArXiv.

[5]  U. Fincke,et al.  Improved methods for calculating vectors of short length in a lattice , 1985 .

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

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

[8]  Mohamed Oussama Damen,et al.  Lattice code decoder for space-time codes , 2000, IEEE Communications Letters.

[9]  Michael Gastpar,et al.  Reliable Physical Layer Network Coding , 2011, Proceedings of the IEEE.

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

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

[12]  Yunnan Wu,et al.  Information Exchange in Wireless Networks with Network Coding and Physical-layer Broadcast , 2004 .

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

[14]  Emanuele Viterbo,et al.  A universal lattice code decoder for fading channels , 1999, IEEE Trans. Inf. Theory.