On the Thresholds of Generalized LDPC Convolutional Codes Based on Protographs

Summary, in English

A threshold analysis of terminated generalized LDPC convolutional codes (GLDPC CCs) is presented for the binary erasure channel. Different ensembles of protograph-based GLDPC CCs are considered, including braided block codes (BBCs). It is shown that the terminated PG-GLDPC CCs have better thresholds than their block code counterparts. Surprisingly, our numerical analysis suggests that for large termination factors the belief propagation decoding thresholds of PG-GLDPC CCs coincide with the ML decoding thresholds of the corresponding PG-GLDPC block codes.

• Författare: Michael Lentmaier; Gerhard Fettweis
• Avdelning/ar: ELLIIT: the Linköping-Lund initiative on IT and mobile communication
• Publiceringsår: 2010
• Språk: Engelska
• Sidor: 709-713
• Publikation/Tidskrift/Serie: 2010 IEEE International Symposium on Information Theory
• Fulltext: - 155 kB; Download statistics
• Länkar: http://dx.doi.org/10.1109/ISIT.2010.5513595
• Dokumenttyp: Konferensbidrag
• Förlag: IEEE - Institute of Electrical and Electronics Engineers Inc.
• Ämne: Electrical Engineering, Electronic Engineering, Information Engineering
• Nyckelord: spatial coupling; LDPC codes; generalized LDPC codes; GLDPC codes
• Conference name: IEEE International Symposium on Information Theory (ISIT), 2010
• Conference date: 2010-06-13 - 2010-06-18
• Conference place: Austin, Texas, United States
• Status: Published
• Forskningsgrupp: Telecommunication Theory
• ISBN/ISSN/Övrigt: ISBN: 978-1-4244-7890-3