Advanced

New Families of LDPC Block Codes Formed by Terminating Irregular Protograph-Based LDPC Convolutional Codes

Mitchell, David G.M.; Lentmaier, Michael LU and Costello Jr., Daniel J. (2010) IEEE International Symposium on Information Theory (ISIT), 2010 In [Host publication title missing] p.824-828
Abstract
In this paper, we present a method of constructing new families of LDPC block code ensembles formed by terminating irregular protograph-based LDPC convolutional codes. Using the accumulate-repeat-by-4-jagged-accumulate (AR4JA) protograph as an example, a density evolution analysis for the binary erasure channel shows that this flexible design technique gives rise to a large selection of LDPC block code ensembles with varying code rates and thresholds close to capacity. Further, by means of an asymptotic weight enumerator analysis, we show that all the ensembles in this family also have minimum distance that grows linearly with block length, i.e., they are asymptotically good.
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]
pages
824 - 828
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
conference name
IEEE International Symposium on Information Theory (ISIT), 2010
external identifiers
  • Scopus:77955689879
ISBN
978-1-4244-7890-3
DOI
10.1109/ISIT.2010.5513633
language
English
LU publication?
no
id
e20764cb-6c81-4b36-9597-44caf7a5f09f (old id 3731217)
date added to LUP
2013-04-26 10:48:47
date last changed
2016-11-06 04:30:57
@misc{e20764cb-6c81-4b36-9597-44caf7a5f09f,
  abstract     = {In this paper, we present a method of constructing new families of LDPC block code ensembles formed by terminating irregular protograph-based LDPC convolutional codes. Using the accumulate-repeat-by-4-jagged-accumulate (AR4JA) protograph as an example, a density evolution analysis for the binary erasure channel shows that this flexible design technique gives rise to a large selection of LDPC block code ensembles with varying code rates and thresholds close to capacity. Further, by means of an asymptotic weight enumerator analysis, we show that all the ensembles in this family also have minimum distance that grows linearly with block length, i.e., they are asymptotically good.},
  author       = {Mitchell, David G.M. and Lentmaier, Michael and Costello Jr., Daniel J.},
  isbn         = {978-1-4244-7890-3},
  keyword      = {spatial coupling,LDPC codes,LDPC convolutional codes},
  language     = {eng},
  pages        = {824--828},
  publisher    = {ARRAY(0x8aea370)},
  series       = {[Host publication title missing]},
  title        = {New Families of LDPC Block Codes Formed by Terminating Irregular Protograph-Based LDPC Convolutional Codes},
  url          = {http://dx.doi.org/10.1109/ISIT.2010.5513633},
  year         = {2010},
}