Compute-and-Forward for Block-Fading Channels via Algebraic Lattice Codes

Previous approaches of compute and forward (C\&F) are mainly based on static channel model, where the channel coefficients stay fixed during the whole transmission time span. In this work, we investigate the C\&F strategy under block fading channels. Our technique is to design codes using construction A over rings, so as to allow better quantization for the channels. Advantages in terms of decoding error probabilities and computation rates are presented, and the construction is shown to strictly outperform, in this scenario, the compute-and-forward strategy over the integers $\mathbb{Z}$.

[1]  Urs Niesen,et al.  The degrees of freedom of compute-and-forward , 2011, ISIT.

[2]  Yu-Chih Huang,et al.  Lattices Over Eisenstein Integers for Compute-and-Forward , 2014, IEEE Transactions on Information Theory.

[3]  Yu-Chih Huang,et al.  Adaptive compute-and-forward with lattice codes over algebraic integers , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[4]  Frédérique E. Oggier,et al.  Construction A of Lattices Over Number Fields and Block Fading (Wiretap) Coding , 2014, IEEE Transactions on Information Theory.

[5]  Nicolas Gama,et al.  Predicting Lattice Reduction , 2008, EUROCRYPT.

[6]  Yu-Chih Huang,et al.  Physical-layer network-coding over block fading channels with root-LDA lattice codes , 2016, 2016 IEEE International Conference on Communications (ICC).

[7]  Kenneth W. Shum,et al.  Lattice Network Codes Based on Eisenstein Integers , 2013, IEEE Trans. Commun..

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

[9]  Cong Ling,et al.  Algebraic lattice codes achieve the capacity of the compound block-fading channel , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[10]  Claus-Peter Schnorr,et al.  Lattice basis reduction: Improved practical algorithms and solving subset sum problems , 1991, FCT.

[11]  Michael Gastpar,et al.  MIMO compute-and-forward , 2009, 2009 IEEE International Symposium on Information Theory.

[12]  Michael Gastpar,et al.  Integer-forcing linear receivers , 2010, 2010 IEEE International Symposium on Information Theory.

[13]  Babak Hassibi,et al.  On the sphere-decoding algorithm I. Expected complexity , 2005, IEEE Transactions on Signal Processing.

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

[15]  Bobak Nazer,et al.  The impact of channel variation on integer-forcing receivers , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).