Asymptotically Regular LDPC Codes with Linear Distance Growth and Thresholds Close to Capacity
(2010) Information Theory and Applications Workshop (ITA), 2010- 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:
https://lup.lub.lu.se/record/3731610
- author
- Lentmaier, Michael LU ; Mitchell, David G.M. ; Fettweis, Gerhard and Costello Jr., Daniel J.
- organization
- publishing date
- 2010
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- keywords
- spatial coupling, LDPC codes, LDPC convolutional codes
- host publication
- 2010 Information Theory and Applications Workshop (ITA)
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- Information Theory and Applications Workshop (ITA), 2010
- conference location
- San Diego, CA, United States
- conference dates
- 2010-01-31 - 2010-02-05
- 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
- 2016-04-04 12:06:26
- date last changed
- 2022-04-08 08:18:28
@inproceedings{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.}},
booktitle = {{2010 Information Theory and Applications Workshop (ITA)}},
isbn = {{978-1-4244-7012-9}},
keywords = {{spatial coupling; LDPC codes; LDPC convolutional codes}},
language = {{eng}},
publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
title = {{Asymptotically Regular LDPC Codes with Linear Distance Growth and Thresholds Close to Capacity}},
url = {{https://lup.lub.lu.se/search/files/5928954/3731612.pdf}},
doi = {{10.1109/ITA.2010.5454141}},
year = {{2010}},
}