Title :
Iterative Decoding for Low-Density Parity-Check Lattices
Author :
Choi, Young-Seob ; Baik, Ihn-Jung ; Chung, Sae-Young
Author_Institution :
Sch. of EECS, KAIST, Daejeon
Abstract :
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.
Keywords :
graph theory; iterative decoding; parity check codes; LDPC; Tanner graph representation; iterative decoding; iterative message passing algorithms; low-density parity-check lattices; max-product algorithm; min-sum algorithm; sum-product algorithm; AWGN; Additive white noise; Iterative algorithms; Iterative decoding; Lattices; Linear code; Message passing; Parity check codes; Signal to noise ratio; Sum product algorithm;
Conference_Titel :
Advanced Communication Technology, 2008. ICACT 2008. 10th International Conference on
Conference_Location :
Gangwon-Do
Print_ISBN :
978-89-5519-136-3
DOI :
10.1109/ICACT.2008.4493778
