Mathematical analysis of iterative decoding of LDPC convolutional codes

Summary, in English

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

• Author: Dmitri Truhachev; Michael Lentmaier; Kamil Zigangirov
• Department/s: Department of Electrical and Information Technology
• Publishing year: 2001
• Language: English
• Publication/Series: [Host publication title missing]
• Links: http://dx.doi.org/10.1109/ISIT.2001.936054
• Document type: Conference paper
• Publisher: IEEE - Institute of Electrical and Electronics Engineers Inc.
• Topic: Electrical Engineering, Electronic Engineering, Information Engineering
• Conference name: IEEE International Symposium on Information Theory (ISIT), 2001
• Conference date: 2001-06-24 - 2001-06-29
• Conference place: Washington, DC, United States
• Status: Published
• Research group: Telecommunication Theory
• ISBN/ISSN/Other: ISBN: 0-7803-7123-2