Advanced

AWGN channel analysis of terminated LDPC convolutional codes

Mitchell, David G.M.; Lentmaier, Michael LU and Costello Jr., Daniel J. (2011) Information Theory and Applications Workshop (ITA), 2011 In [Host publication title missing]
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:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
keywords
spatial coupling, LDPC codes, LDPC convolutional codes
in
[Host publication title missing]
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
conference name
Information Theory and Applications Workshop (ITA), 2011
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
2013-04-26 13:02:18
date last changed
2016-10-13 04:41:57
@misc{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.},
  isbn         = {978-1-4577-0360-7},
  keyword      = {spatial coupling,LDPC codes,LDPC convolutional codes},
  language     = {eng},
  publisher    = {ARRAY(0xb369690)},
  series       = {[Host publication title missing]},
  title        = {AWGN channel analysis of terminated LDPC convolutional codes},
  url          = {http://dx.doi.org/10.1109/ITA.2011.5743566},
  year         = {2011},
}