Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

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 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
; and
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
keywords
spatial coupling, LDPC codes, LDPC convolutional codes
host publication
2010 IEEE International Symposium on Information Theory
pages
824 - 828
publisher
IEEE - Institute of Electrical and Electronics Engineers Inc.
conference name
IEEE International Symposium on Information Theory (ISIT), 2010
conference location
Austin, Texas, United States
conference dates
2010-06-13 - 2010-06-18
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
2016-04-04 11:15:54
date last changed
2022-02-28 19:41:10
@inproceedings{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.}},
  booktitle    = {{2010 IEEE International Symposium on Information Theory}},
  isbn         = {{978-1-4244-7890-3}},
  keywords     = {{spatial coupling; LDPC codes; LDPC convolutional codes}},
  language     = {{eng}},
  pages        = {{824--828}},
  publisher    = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
  title        = {{New Families of LDPC Block Codes Formed by Terminating Irregular Protograph-Based LDPC Convolutional Codes}},
  url          = {{https://lup.lub.lu.se/search/files/5733030/3731218.pdf}},
  doi          = {{10.1109/ISIT.2010.5513633}},
  year         = {{2010}},
}