Title :
Iterative decoding algorithm of lattices
Author :
Sadeghi, Mohammad R. ; Banihashemi, Amir H. ; Panario, Daniel
Author_Institution :
Sch. of Math. & Stat., Carleton Univ., Canada
Abstract :
The so-called min-sum algorithm for iterative decoding of low-density parity-check (LDPC) codes is generalized to decode lattices. An upper bound on the decoding complexity per iteration is derived, and for LDPC lattices constructed by Construction D´ and using a nested sequence of LDPC codes, exact values for computational complexity are also given. We show that iterative decoding of LDPC lattices has a reasonably low complexity such that lattices with dimensions of a few thousands can be easily decoded.
Keywords :
computational complexity; graph theory; group codes; iterative decoding; lattice theory; parity check codes; LDPC codes; Tanner graphs; computational complexity; decoding complexity; group codes; iterative decoding algorithm; lattice decoding; low-density parity-check codes; min-sum algorithm; Bipartite graph; Block codes; Computational complexity; Equations; Iterative algorithms; Iterative decoding; Lattices; Linear programming; Parity check codes; Upper bound;
Conference_Titel :
Electrical and Computer Engineering, 2004. Canadian Conference on
Print_ISBN :
0-7803-8253-6
DOI :
10.1109/CCECE.2004.1349667
