Construction of lattices from LDPC codes

Low-density parity-check (LDPC) codes can have a good performance under iterative decoding algorithms. This idea is used to construct a class of lattices with relatively high coding gain and low decoding complexity. To construct such lattices, Construction D´ is applied to the set of parity check vectors of a class of nested LDPC codes. Bounds on the minimum distance and the coding gain of the corresponding lattice are provided. We also provide a practical way of finding the cross sections of the lattice given the parity check matrix of a lattice. The progressive edge growth algorithm is extended and is used to construct a class of nested binary codes to generate the corresponding lattice. Simulation results confirm the good performance of this class of lattice.