Asymptotically Good LDPC Convolutional Codes with AWGN Channel Thresholds Close to the Shannon Limit
(2010) International Symposium on Turbo Codes & Related Topics (ISTC), 2010 p.324-328- Abstract
- In this paper, we perform an iterative decoding threshold analysis of LDPC block code ensembles formed by terminating (J,K)-regular and irregular AR4JA-based LDPC convolutional codes. These ensembles have minimum distance growing linearly with block length and their thresholds approach the Shannon limit as the termination factor tends to infinity. Results are presented for various ensembles and termination factors, which allow a code designer to trade-off between distance growth rate and threshold.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/3731191
- 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 6th International Symposium on Turbo Codes & Iterative Information Processing
- pages
- 324 - 328
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- International Symposium on Turbo Codes & Related Topics (ISTC), 2010
- conference location
- Brest, France
- conference dates
- 2010-09-06 - 2010-09-10
- external identifiers
-
- scopus:78649252804
- ISBN
- 978-1-4244-6744-0
- DOI
- 10.1109/ISTC.2010.5613891
- language
- English
- LU publication?
- no
- id
- b22942dd-a538-403c-82d7-4ff98fcd63e8 (old id 3731191)
- date added to LUP
- 2016-04-04 11:50:15
- date last changed
- 2022-02-21 05:21:44
@inproceedings{b22942dd-a538-403c-82d7-4ff98fcd63e8, abstract = {{In this paper, we perform an iterative decoding threshold analysis of LDPC block code ensembles formed by terminating (J,K)-regular and irregular AR4JA-based LDPC convolutional codes. These ensembles have minimum distance growing linearly with block length and their thresholds approach the Shannon limit as the termination factor tends to infinity. Results are presented for various ensembles and termination factors, which allow a code designer to trade-off between distance growth rate and threshold.}}, author = {{Lentmaier, Michael and Mitchell, David G.M. and Fettweis, Gerhard and Costello Jr., Daniel J.}}, booktitle = {{2010 6th International Symposium on Turbo Codes & Iterative Information Processing}}, isbn = {{978-1-4244-6744-0}}, keywords = {{spatial coupling; LDPC codes; LDPC convolutional codes}}, language = {{eng}}, pages = {{324--328}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, title = {{Asymptotically Good LDPC Convolutional Codes with AWGN Channel Thresholds Close to the Shannon Limit}}, url = {{https://lup.lub.lu.se/search/files/5866532/3731193.pdf}}, doi = {{10.1109/ISTC.2010.5613891}}, year = {{2010}}, }