On the Thresholds of Generalized LDPC Convolutional Codes Based on Protographs
(2010) IEEE International Symposium on Information Theory (ISIT), 2010 p.709-713- Abstract
- 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.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/3731222
- author
- Lentmaier, Michael LU and Fettweis, Gerhard
- organization
- publishing date
- 2010
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- keywords
- spatial coupling, LDPC codes, generalized LDPC codes, GLDPC codes
- host publication
- 2010 IEEE International Symposium on Information Theory
- pages
- 709 - 713
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- IEEE International Symposium on Information Theory (ISIT), 2010
- conference location
- Austin, Texas, United States
- conference dates
- 2010-06-13 - 2010-06-18
- external identifiers
-
- scopus:77955700139
- ISBN
- 978-1-4244-7890-3
- DOI
- 10.1109/ISIT.2010.5513595
- language
- English
- LU publication?
- no
- id
- 4439a164-8512-46be-b39b-07418b4820dd (old id 3731222)
- date added to LUP
- 2016-04-04 12:06:32
- date last changed
- 2022-05-17 05:51:12
@inproceedings{4439a164-8512-46be-b39b-07418b4820dd, abstract = {{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.}}, author = {{Lentmaier, Michael and Fettweis, Gerhard}}, booktitle = {{2010 IEEE International Symposium on Information Theory}}, isbn = {{978-1-4244-7890-3}}, keywords = {{spatial coupling; LDPC codes; generalized LDPC codes; GLDPC codes}}, language = {{eng}}, pages = {{709--713}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, title = {{On the Thresholds of Generalized LDPC Convolutional Codes Based on Protographs}}, url = {{https://lup.lub.lu.se/search/files/5929293/3731223.pdf}}, doi = {{10.1109/ISIT.2010.5513595}}, year = {{2010}}, }