Iterative Decoding for Low-Density Parity-Check Lattices

High-dimensional lattice codes can provide relatively large coding gains and the gain increases with dimension. However, the authors are difficult to implement in practice due to the decoding complexity which increases exponentially with dimension. The challenge is in constructing lattices which can be decoded with low complexity. Low-Density Parity-Check (LDPC) lattices, proposed by Sadeghi et al., can be constructed using a set of nested LDPC codes. Since LDPC codes can be decoded using the iterative decoding algorithm, constructing lattices based on such codes guarantees a manageable decoding complexity.