DocumentCode
2949561
Title
A Method for Constructing LDPC Codes with Low Error Floor
Author
Sharon, Eran ; Litsyn, Simon
Author_Institution
Dept. of Electr. Eng., Tel Aviv Univ.
fYear
2006
fDate
9-14 July 2006
Firstpage
2569
Lastpage
2573
Abstract
This paper describes a novel progressive edge growth (PEG) algorithm for constructing LDPC codes with minimized block error probability over the binary erasure channel (BEC). The constructed codes provide superior performance and lower error floor compared to codes generated by previously known algorithms. Furthermore, an upper bound on the expected block error probability in the error floor region of the generated code is derived
Keywords
binary codes; channel coding; error statistics; parity check codes; LDPC codes; binary erasure channel; block error probability; lower error floor; progressive edge growth; Belief propagation; Bipartite graph; DC generators; Error probability; Floors; Greedy algorithms; Iterative decoding; Minimization methods; Parity check codes; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2006 IEEE International Symposium on
Conference_Location
Seattle, WA
Print_ISBN
1-4244-0505-X
Electronic_ISBN
1-4244-0504-1
Type
conf
DOI
10.1109/ISIT.2006.262096
Filename
4036436
Link To Document