Title :
Mathematical analysis of iterative decoding of LDPC convolutional codes
Author :
Truhachev, Dmitri ; Lentmaier, Michael ; Zigangirov, Kamil Sh
Author_Institution :
Dept. of Inf. Technol., Lund Univ., Sweden
Abstract :
Asymptotic iterative decoding performance of low-density parity-check (LDPC) convolutional codes is analyzed. An important role within the analysis is a theorem on the minimal length of cycles in the Tanner graph describing a code
Keywords :
block codes; convolutional codes; iterative decoding; turbo codes; LDPC codes; Tanner graph; asymptotic performance; convolutional codes; iterative decoding; low-density parity-check codes; mathematical analysis; minimal cycle length; AWGN channels; Block codes; Convolutional codes; Information analysis; Information technology; Iterative algorithms; Iterative decoding; Mathematical analysis; Parity check codes; Turbo codes;
Conference_Titel :
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-7123-2
DOI :
10.1109/ISIT.2001.936054
