Asymptotically Good LDPC Convolutional Codes with AWGN Channel Thresholds Close to the Shannon Limit

Summary, in English

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: Michael Lentmaier; David G.M. Mitchell; Gerhard Fettweis; Daniel J. Costello Jr.
• Department/s: ELLIIT: the Linköping-Lund initiative on IT and mobile communication
• Publishing year: 2010
• Language: English
• Pages: 324-328
• Publication/Series: 2010 6th International Symposium on Turbo Codes & Iterative Information Processing
• Full text: - 245 kB; Download statistics
• Links: http://dx.doi.org/10.1109/ISTC.2010.5613891
• Document type: Conference paper
• Publisher: IEEE - Institute of Electrical and Electronics Engineers Inc.
• Topic: Electrical Engineering, Electronic Engineering, Information Engineering
• Keywords: spatial coupling; LDPC codes; LDPC convolutional codes
• Conference name: International Symposium on Turbo Codes & Related Topics (ISTC), 2010
• Conference date: 2010-09-06 - 2010-09-10
• Conference place: Brest, France
• Status: Published
• Research group: Telecommunication Theory
• ISBN/ISSN/Other: ISBN: 978-1-4244-6744-0