DocumentCode
2191824
Title
Generalized serial 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, Israel
fYear
2008
fDate
3-5 Dec. 2008
Firstpage
105
Lastpage
109
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; scheduling; LDPC code; Tanner graph theory; density evolution analysis; generalized serial scheduling; iterative decoding; low density parity check code; Acceleration; Bipartite graph; Convergence; Floods; Iterative algorithms; Iterative decoding; Message passing; Parity check codes; Processor scheduling; Throughput; Decoding Schedules; Iterative Decoding; LDPC Codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Electrical and Electronics Engineers in Israel, 2008. IEEEI 2008. IEEE 25th Convention of
Conference_Location
Eilat
Print_ISBN
978-1-4244-2481-8
Electronic_ISBN
978-1-4244-2482-5
Type
conf
DOI
10.1109/EEEI.2008.4736667
Filename
4736667
Link To Document