Iterative decoding threshold analysis for LDPC convolutional codes

Summary, in English

An iterative decoding threshold analysis for terminated regular LDPC convolutional (LDPCC) codes is presented. Using density evolution techniques, the convergence behavior of an iterative belief propagation decoder is analyzed for the binary erasure channel and the AWGN channel with binary inputs. It is shown that for a terminated LDPCC code ensemble, the thresholds are better than for corresponding regular and irregular LDPC block codes.

• Författare: Michael Lentmaier; Arvind Sridharan; Daniel J. Costello Jr.; Kamil Zigangirov
• Avdelning/ar: Institutionen för elektro- och informationsteknik; ELLIIT: the Linköping-Lund initiative on IT and mobile communication
• Publiceringsår: 2010
• Språk: Engelska
• Sidor: 5274-5289
• Publikation/Tidskrift/Serie: IEEE Transactions on Information Theory
• Volym: 56
• Issue: 10
• Fulltext: - 523 kB; Download statistics
• Länkar: http://dx.doi.org/10.1109/TIT.2010.2059490
• Dokumenttyp: Artikel i tidskrift
• Förlag: IEEE - Institute of Electrical and Electronics Engineers Inc.
• Ämne: Electrical Engineering, Electronic Engineering, Information Engineering
• Nyckelord: threshold analysis; density evolution; Belief propagation; iterative decoding; low-density; LDPC convolutional codes; message passing; parity-check (LDPC) codes
• Status: Published
• Forskningsgrupp: Information Theory
• ISBN/ISSN/Övrigt: ISSN: 0018-9448