DocumentCode :
2730832
Title :
Asymptotically good LDPC convolutional codes with AWGN channel thresholds close to the Shannon limit
Author :
Lentmaier, Michael ; Mitchell, David ; Fettweis, Gerhard ; Costello, Daniel J.
Author_Institution :
Dept. of Mobile Commun. Syst., Dresden Univ. of Technol., Dresden, Germany
fYear :
2010
fDate :
6-10 Sept. 2010
Firstpage :
324
Lastpage :
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.
Keywords :
AWGN channels; convolutional codes; parity check codes; AR4JA; AWGN channel thresholds; LDPC convolutional codes; Shannon limit; iterative decoding threshold analysis; Artificial neural networks; Convolutional codes; Parity check codes; Presses;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Turbo Codes and Iterative Information Processing (ISTC), 2010 6th International Symposium on
Conference_Location :
Brest
Print_ISBN :
978-1-4244-6744-0
Electronic_ISBN :
978-1-4244-6745-7
Type :
conf
DOI :
10.1109/ISTC.2010.5613891
Filename :
5613891
Link To Document :
بازگشت