Spatially-coupled low density lattices based on construction a with applications to compute-and-forward

We consider a class of lattices built using Construction A, where the underlying code is a non-binary spatially-coupled low density parity check code. We refer to these lattices as spatially-coupled LDA (SCLDA) lattices. SCLDA lattices can be constructed over integers, Gaussian integers and Eisenstein integers. We empirically study the performance of SCLDA lattices under belief propagation (BP) decoding. Ignoring the rate loss from termination, simulation results show that the BP thresholds of SCLDA lattices over integers is 0.11 dB (0.34 dB with the rate loss) and the BP thresholds for SCLDA lattices over Eisenstein integers are 0.08 dB from the Poltyrev limit (0.19 dB with the rate loss). Motivated by this result, we use SCLDA lattice codes over Eisenstein integers for implementing a compute-and-forward protocol. For the examples considered in this paper, the thresholds for the proposed lattice codes are within 0.28 dB from the achievable rate of this coding scheme and within 1.06 dB from the achievable computation rate of Nazer and Gastpar's coding scheme in [6] extended to Eisenstein integers.

[1]  Gregory Poltyrev,et al.  On coding without restrictions for the AWGN channel , 1993, IEEE Trans. Inf. Theory.

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

[3]  Shlomo Shamai,et al.  Nested linear/Lattice codes for structured multiterminal binning , 2002, IEEE Trans. Inf. Theory.

[4]  Rüdiger L. Urbanke,et al.  Spatially coupled ensembles universally achieve capacity under belief propagation , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[5]  Thomas C. Hales.  Sphere packings, I , 1997, Discret. Comput. Geom..

[6]  W. Fischer,et al.  Sphere Packings, Lattices and Groups , 1990 .

[7]  Loïc Brunel,et al.  Integer low-density lattices based on construction A , 2012, 2012 IEEE Information Theory Workshop.

[8]  Brian M. Kurkoski,et al.  Threshold improvement of low-density lattice codes via spatial coupling , 2012, 2012 International Conference on Computing, Networking and Communications (ICNC).

[9]  Alexander Sprintson,et al.  Joint Physical Layer Coding and Network Coding for Bidirectional Relaying , 2008, IEEE Transactions on Information Theory.

[10]  John H. Conway,et al.  On Quaternions and Octonions , 2003 .

[11]  Rudiger Urbanke,et al.  Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC , 2010, ISIT.

[12]  Hans-Andrea Loeliger,et al.  Averaging bounds for lattices and linear codes , 1997, IEEE Trans. Inf. Theory.

[13]  Loïc Brunel,et al.  New results on low-density integer lattices , 2013, 2013 Information Theory and Applications Workshop (ITA).

[14]  Brian M. Kurkoski,et al.  Iterative encoding with Gauss-Seidel method for spatially-coupled low-density lattice codes , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[15]  Yu-Chih Huang,et al.  Lattices Over Eisenstein Integers for Compute-and-Forward , 2015, IEEE Trans. Inf. Theory.

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

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

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