Low-Density Parity-Check Lattices: Construction and Decoding Analysis

@article{Sadeghi2006LowDensityPL,
  title={Low-Density Parity-Check Lattices: Construction and Decoding Analysis},
  author={Mohammad-Reza Sadeghi and Amir H. Banihashemi and Daniel Panario},
  journal={IEEE Transactions on Information Theory},
  year={2006},
  volume={52},
  pages={4481-4495}
}
Low-density parity-check codes (LDPC) can have an impressive performance under iterative decoding algorithms. In this paper we introduce a method to construct high coding gain lattices with low decoding complexity based on LDPC codes. To construct such lattices we apply Construction D', due to Bos, Conway, and Sloane, to a set of parity checks defining a family of nested LDPC codes. For the decoding algorithm, we generalize the application of max-sum algorithm to the Tanner graph of lattices… CONTINUE READING
Highly Cited
This paper has 177 citations. REVIEW CITATIONS

5 Figures & Tables

Topics

Statistics

0102030'05'07'09'11'13'15'17
Citations per Year

177 Citations

Semantic Scholar estimates that this publication has 177 citations based on the available data.

See our FAQ for additional information.