Iterative Decoding for Low-Density Parity-Check Lattices
Young-Seob Choi, Ihn-Jung Baik, Sae-Young Chung · International Conference on Advanced Communication Technology · 2008
Low-density parity-check (LDPC) lattices are introduced by Sadeghi et al. (2006). The construction method of such lattices and the decoding algorithm based on the min-sum algorithm are also proposed in [1]. In this paper we apply two iterative message passing algorithms, the sum-product algorithm and the max-product algorithm, to the Tanner graph representation of LDPC lattices. We evaluate the performance of two iterative message passing algorithms.