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.
Original language | English |
---|---|
Title of host publication | 2010 IEEE International Symposium on Information Theory |
Publisher | IEEE - Institute of Electrical and Electronics Engineers Inc. |
Pages | 709-713 |
ISBN (Print) | 978-1-4244-7890-3 |
DOIs | |
Publication status | Published - 2010 |
Event | IEEE International Symposium on Information Theory (ISIT), 2010 - Austin, Texas, Austin, Texas, United States Duration: 2010 Jun 13 → 2010 Jun 18 |
Conference
Conference | IEEE International Symposium on Information Theory (ISIT), 2010 |
---|---|
Country/Territory | United States |
City | Austin, Texas |
Period | 2010/06/13 → 2010/06/18 |
Subject classification (UKÄ)
- Electrical Engineering, Electronic Engineering, Information Engineering
Free keywords
- spatial coupling
- LDPC codes
- generalized LDPC codes
- GLDPC codes