DocumentCode
2516719
Title
Efficient layers-based schedules for iterative decoding of LDPC codes
Author
Presman, Noam ; Sharon, Eran ; Litsyn, Simon
Author_Institution
Sch. of Electr. Eng., Tel Aviv Univ., Ramat Aviv
fYear
2008
fDate
6-11 July 2008
Firstpage
1148
Lastpage
1152
Abstract
Efficient serial decoding schedules for LDPC codes are described. The schedules are based on dividing the Tanner graph to sub-graphs. This yields an improvement in complexity and performance over the standard schedules. An application of the introduced schedules to decoding codes based on lifted graphs is described. An analysis based on density evolution is presented and is used to predict the behavior of different schedules.
Keywords
graph theory; iterative decoding; parity check codes; LDPC codes; Tanner graph; iterative decoding; lifted graphs; low density parity check code; serial decoding; Acceleration; Bipartite graph; Convergence; Floods; Iterative algorithms; Iterative decoding; Message passing; Parity check codes; Processor scheduling; Throughput;
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.4595167
Filename
4595167
Link To Document