Advanced

Quasi-Cyclic Asymptotically Regular LDPC Codes

Mitchell, David G.M.; Smarandache, Roxana; Lentmaier, Michael LU and Costello Jr., Daniel J. (2010) IEEE Information Theory Workshop (ITW), 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, minimum distance that grows linearly with block length, and capacity approaching iterative decoding thresholds, despite the fact that the terminated ensembles are almost regular. In this paper, we investigate the properties of the quasi-cyclic (QC) members of such an ensemble. We show that an upper bound on the minimum Hamming distance of members of the QC sub-ensemble can be improved by careful choice of the component protographs used in the code construction. Further, we show... (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, minimum distance that grows linearly with block length, and capacity approaching iterative decoding thresholds, despite the fact that the terminated ensembles are almost regular. In this paper, we investigate the properties of the quasi-cyclic (QC) members of such an ensemble. We show that an upper bound on the minimum Hamming distance of members of the QC sub-ensemble can be improved by careful choice of the component protographs used in the code construction. Further, we show that the upper bound on the minimum distance can be improved by using arrays of circulants in a graph cover of the protograph. (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, quasi-cyclic codes
in
[Host publication title missing]
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
conference name
IEEE Information Theory Workshop (ITW), 2010
external identifiers
  • Scopus:80051987722
ISBN
978-1-4244-8262-7
DOI
10.1109/CIG.2010.5592641
language
English
LU publication?
no
id
436fe81f-34bc-48e7-a85b-2e093b2cd99a (old id 3731200)
date added to LUP
2013-04-26 10:24:40
date last changed
2016-10-13 04:46:30
@misc{436fe81f-34bc-48e7-a85b-2e093b2cd99a,
  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, minimum distance that grows linearly with block length, and capacity approaching iterative decoding thresholds, despite the fact that the terminated ensembles are almost regular. In this paper, we investigate the properties of the quasi-cyclic (QC) members of such an ensemble. We show that an upper bound on the minimum Hamming distance of members of the QC sub-ensemble can be improved by careful choice of the component protographs used in the code construction. Further, we show that the upper bound on the minimum distance can be improved by using arrays of circulants in a graph cover of the protograph.},
  author       = {Mitchell, David G.M. and Smarandache, Roxana and Lentmaier, Michael and Costello Jr., Daniel J.},
  isbn         = {978-1-4244-8262-7},
  keyword      = {spatial coupling,LDPC codes,LDPC convolutional codes,quasi-cyclic codes},
  language     = {eng},
  publisher    = {ARRAY(0x92ee380)},
  series       = {[Host publication title missing]},
  title        = {Quasi-Cyclic Asymptotically Regular LDPC Codes},
  url          = {http://dx.doi.org/10.1109/CIG.2010.5592641},
  year         = {2010},
}