Advanced

Asymptotically Regular LDPC Codes with Linear Distance Growth and Thresholds Close to Capacity

Lentmaier, Michael LU ; Mitchell, David G.M.; Fettweis, Gerhard and Costello Jr., Daniel J. (2010) Information Theory and Applications Workshop (ITA), 2010 In [Host publication title missing]
Abstract
Families of asymptotically regular LDPC block code ensembles can be formed by terminating (J, K)-regular protograph-based LDPC convolutional codes. By varying the termination length, we obtain a large selection of LDPC block code ensembles with varying code rates and substantially better iterative decoding thresholds than those of (J, K)-regular LDPC block code ensembles, despite the fact that the terminated ensembles are almost regular. Also, by means of an asymptotic weight enumerator analysis, we show that minimum distance grows linearly with block length for all of the ensembles in these families, i.e., the ensembles are asymptotically good. We find that, as the termination length increases, families of ¿asymptotically regular¿ codes... (More)
Families of asymptotically regular LDPC block code ensembles can be formed by terminating (J, K)-regular protograph-based LDPC convolutional codes. By varying the termination length, we obtain a large selection of LDPC block code ensembles with varying code rates and substantially better iterative decoding thresholds than those of (J, K)-regular LDPC block code ensembles, despite the fact that the terminated ensembles are almost regular. Also, by means of an asymptotic weight enumerator analysis, we show that minimum distance grows linearly with block length for all of the ensembles in these families, i.e., the ensembles are asymptotically good. We find that, as the termination length increases, families of ¿asymptotically regular¿ codes with capacity approaching iterative decoding thresholds and declining minimum distance growth rates are obtained, allowing a code designer to trade-off between distance growth rate and threshold. Further, we show that the thresholds and the distance growth rates can be improved by carefully choosing the component protographs used in the code construction. (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), 2010
external identifiers
  • Scopus:77952684894
ISBN
978-1-4244-7012-9
DOI
10.1109/ITA.2010.5454141
language
English
LU publication?
no
id
4cc694f3-9528-425b-a9d2-eabed258eb4c (old id 3731610)
date added to LUP
2013-04-26 13:05:57
date last changed
2016-10-13 04:49:39
@misc{4cc694f3-9528-425b-a9d2-eabed258eb4c,
  abstract     = {Families of asymptotically regular LDPC block code ensembles can be formed by terminating (J, K)-regular protograph-based LDPC convolutional codes. By varying the termination length, we obtain a large selection of LDPC block code ensembles with varying code rates and substantially better iterative decoding thresholds than those of (J, K)-regular LDPC block code ensembles, despite the fact that the terminated ensembles are almost regular. Also, by means of an asymptotic weight enumerator analysis, we show that minimum distance grows linearly with block length for all of the ensembles in these families, i.e., the ensembles are asymptotically good. We find that, as the termination length increases, families of ¿asymptotically regular¿ codes with capacity approaching iterative decoding thresholds and declining minimum distance growth rates are obtained, allowing a code designer to trade-off between distance growth rate and threshold. Further, we show that the thresholds and the distance growth rates can be improved by carefully choosing the component protographs used in the code construction.},
  author       = {Lentmaier, Michael and Mitchell, David G.M. and Fettweis, Gerhard and Costello Jr., Daniel J.},
  isbn         = {978-1-4244-7012-9},
  keyword      = {spatial coupling,LDPC codes,LDPC convolutional codes},
  language     = {eng},
  publisher    = {ARRAY(0x8725058)},
  series       = {[Host publication title missing]},
  title        = {Asymptotically Regular LDPC Codes with Linear Distance Growth and Thresholds Close to Capacity},
  url          = {http://dx.doi.org/10.1109/ITA.2010.5454141},
  year         = {2010},
}