DocumentCode
2514133
Title
On the guaranteed error correction capability of LDPC codes
Author
Chilappagari, Shashi Kiran ; Nguyen, Dung Viet ; Vasic, Bane ; Marcellin, Michael W.
Author_Institution
Dept. of Electr. & Comput. Eng., Univ. of Arizona, Tucson, AZ
fYear
2008
fDate
6-11 July 2008
Firstpage
434
Lastpage
438
Abstract
We investigate the relation between the girth and the guaranteed error correction capability of gamma-left regular LDPC codes when decoded using the bit flipping (serial and parallel) algorithms. A lower bound on the number of variable nodes which expand by a factor of at least 3gamma/4 is found based on the Moore bound. An upper bound on the guaranteed correction capability is established by studying the sizes of smallest possible trapping sets.
Keywords
decoding; error correction codes; parity check codes; LDPC codes; Moore bound; bit flipping algorithms; error correction capability; AWGN; Algorithm design and analysis; Error correction; Error correction codes; Graph theory; Iterative algorithms; Iterative decoding; Message passing; Parity check codes; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2008. ISIT 2008. IEEE International Symposium on
Conference_Location
Toronto, ON
Print_ISBN
978-1-4244-2256-2
Electronic_ISBN
978-1-4244-2257-9
Type
conf
DOI
10.1109/ISIT.2008.4595023
Filename
4595023
Link To Document