AWGN channel analysis of terminated LDPC convolutional codes
(2011) Information Theory and Applications Workshop (ITA), 2011- Abstract
- It has previously been shown that ensembles of terminated protograph-based low-density parity-check (LDPC) convolutional codes have a typical minimum distance that grows linearly with block length and that they are capable of achieving capacity approaching iterative decoding thresholds on the binary erasure channel (BEC). In this paper, we review a recent result that the dramatic threshold improvement obtained by terminating LDPC convolutional codes extends to the additive white Gaussian noise (AWGN) channel. Also, using a (3,6)-regular protograph-based LDPC convolutional code ensemble as an example, we perform an asymptotic trapping set analysis of terminated LDPC convolutional code ensembles. In addition to capacity approaching iterative... (More)
- It has previously been shown that ensembles of terminated protograph-based low-density parity-check (LDPC) convolutional codes have a typical minimum distance that grows linearly with block length and that they are capable of achieving capacity approaching iterative decoding thresholds on the binary erasure channel (BEC). In this paper, we review a recent result that the dramatic threshold improvement obtained by terminating LDPC convolutional codes extends to the additive white Gaussian noise (AWGN) channel. Also, using a (3,6)-regular protograph-based LDPC convolutional code ensemble as an example, we perform an asymptotic trapping set analysis of terminated LDPC convolutional code ensembles. In addition to capacity approaching iterative decoding thresholds and linearly growing minimum distance, we find that the smallest non-empty trapping set of a terminated ensemble grows linearly with block length. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/3731604
- author
- Mitchell, David G.M. ; Lentmaier, Michael LU and Costello Jr., Daniel J.
- organization
- publishing date
- 2011
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- keywords
- spatial coupling, LDPC codes, LDPC convolutional codes
- host publication
- 2011 Information Theory and Applications Workshop
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- Information Theory and Applications Workshop (ITA), 2011
- conference location
- San Diego, CA, United Kingdom
- conference dates
- 2011-02-06 - 2011-02-11
- external identifiers
-
- scopus:79955773289
- ISBN
- 978-1-4577-0360-7
- DOI
- 10.1109/ITA.2011.5743566
- language
- English
- LU publication?
- no
- id
- 7b3be172-07bc-4c44-8a9d-139cb21cb75e (old id 3731604)
- date added to LUP
- 2016-04-04 10:46:18
- date last changed
- 2022-02-21 03:39:11
@inproceedings{7b3be172-07bc-4c44-8a9d-139cb21cb75e, abstract = {{It has previously been shown that ensembles of terminated protograph-based low-density parity-check (LDPC) convolutional codes have a typical minimum distance that grows linearly with block length and that they are capable of achieving capacity approaching iterative decoding thresholds on the binary erasure channel (BEC). In this paper, we review a recent result that the dramatic threshold improvement obtained by terminating LDPC convolutional codes extends to the additive white Gaussian noise (AWGN) channel. Also, using a (3,6)-regular protograph-based LDPC convolutional code ensemble as an example, we perform an asymptotic trapping set analysis of terminated LDPC convolutional code ensembles. In addition to capacity approaching iterative decoding thresholds and linearly growing minimum distance, we find that the smallest non-empty trapping set of a terminated ensemble grows linearly with block length.}}, author = {{Mitchell, David G.M. and Lentmaier, Michael and Costello Jr., Daniel J.}}, booktitle = {{2011 Information Theory and Applications Workshop}}, isbn = {{978-1-4577-0360-7}}, keywords = {{spatial coupling; LDPC codes; LDPC convolutional codes}}, language = {{eng}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, title = {{AWGN channel analysis of terminated LDPC convolutional codes}}, url = {{https://lup.lub.lu.se/search/files/5617398/3731606.pdf}}, doi = {{10.1109/ITA.2011.5743566}}, year = {{2011}}, }