Efficient decoding of Low Density Lattice Codes

A New efficient algorithm for implementing the Low Density Lattice Codes belief propagation decoder is presented. In the new algorithm the messages passed over the edges are represented by Gaussian parameters lists, and the decoding algorithm uses the low density lattice codes propagation properties in order to group lists efficiently according to a new criteria. The new algorithm attains the same performance as the quantized decoder, proposed in previous work. The new algorithm advantage in comparison to previous works is its storage requirements and its relatively low computational complexity.

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

[2]  Justin Dauwels,et al.  Message-passing decoding of lattices using Gaussian mixtures , 2008, 2008 IEEE International Symposium on Information Theory.

[3]  Meir Feder,et al.  Low-Density Lattice Codes , 2007, IEEE Transactions on Information Theory.