DocumentCode :
3510895
Title :
Asymptotic estimation of error fraction corrected by binary LDPC code
Author :
Rybin, Pavel ; Zyablov, Victor
Author_Institution :
Inst. for Inf. Transm. Problems, Russian Acad. of Sci., Moscow, Russia
fYear :
2011
fDate :
July 31 2011-Aug. 5 2011
Firstpage :
351
Lastpage :
355
Abstract :
This paper considers new lower bound on fraction of guaranteed corrected errors while decoding the same binary low-density parity-check (LDPC) codes with constituent single parity-check (SPC) and Hamming codes using the same iterative low-complex hard-decision algorithm as in previous works of V. Zyablov and M. Pinsker in 1975 and V. Zyablov, R. Johannesson and M. Loncar in 2009. The number of decoding iterations, required to correct the errors, is a logarithmic function of the code length. The fraction of guaranteed correctable errors computed numerically for various choices of LDPC code parameters with constituent SPC and Hamming codes shows that proposed lower bound gives the better results than previously known best lower bounds obtained by V. Zyablov and M. Pinsker in 1975 for Gallager´s LDPC codes and A. Barg and A. Mazumrad for Hamming code-based LDPC (H-LDPC) codes in 2011. Some of obtained numerical results are represented at the end of the paper to demonstrate these improvements.
Keywords :
Hamming codes; error correction codes; iterative decoding; parity check codes; Hamming code; SPC code; asymptotic estimation; binary LDPC code; binary low density parity check code; error fraction estimation; guaranteed corrected error; iteration decoding; iterative low complex hard decision algorithm; logarithmic function;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
Conference_Location :
St. Petersburg
ISSN :
2157-8095
Print_ISBN :
978-1-4577-0596-0
Electronic_ISBN :
2157-8095
Type :
conf
DOI :
10.1109/ISIT.2011.6034144
Filename :
6034144
Link To Document :
بازگشت