DocumentCode
1891832
Title
Extended bit-filling and LDPC code design
Author
Campello, Jorge ; Modha, Dharmendra S.
Author_Institution
IBM Almaden Res. Center, San Jose, CA, USA
Volume
2
fYear
2001
fDate
2001
Firstpage
985
Abstract
Campello, Modha and Rajagopalan (see Proc. Int. Conf. Communications (ICC), Helsinki, Finland, 2001) proposed a simple-to-implement heuristic, namely, bit-filling, for constructing high rate and high girth LDPC codes. In the present work, we extend bit-filling, and demonstrate that the extended algorithm produces better codes, that is, codes with higher rate/girth and good bit error rate performance. We demonstrate the positive effect of girth on bit error rate performance
Keywords
error correction codes; error detection codes; error statistics; graph theory; BER performance; LDPC code design; Tanner graphs; bit error rate performance; extended algorithm; extended bit-filling; high girth LDPC codes; high rate LDPC codes; irregular graphs; Aging; Bipartite graph; Bit error rate; Equations; Heuristic algorithms; Iterative decoding; Parity check codes; Sparse matrices;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 2001. GLOBECOM '01. IEEE
Conference_Location
San Antonio, TX
Print_ISBN
0-7803-7206-9
Type
conf
DOI
10.1109/GLOCOM.2001.965565
Filename
965565
Link To Document