Generalized serial schedules for iterative decoding of LDPC codes

Noam Presman; Eran Sharon; Simon Litsyn

doi:10.1109/EEEI.2008.4736667

Generalized serial schedules for iterative decoding of LDPC codes

Noam Presman^*, Eran Sharon, Simon Litsyn

^*Corresponding author for this work

School of Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2008
Pages	105-109
Number of pages	5
DOIs	https://doi.org/10.1109/EEEI.2008.4736667
State	Published - 2008
Event	2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2008 - Eilat, Israel Duration: 3 Dec 2008 → 5 Dec 2008

Publication series

Name	IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings

Conference

Conference	2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2008
Country/Territory	Israel
City	Eilat
Period	3/12/08 → 5/12/08

Keywords

Decoding schedules
Iterative decoding
LDPC codes

Access to Document

10.1109/EEEI.2008.4736667

Cite this

@inproceedings{2ccaee6c4edc43138b8dc8cf7891b0e2,

title = "Generalized serial schedules for iterative decoding of LDPC codes",

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 = "Decoding schedules, Iterative decoding, LDPC codes",

author = "Noam Presman and Eran Sharon and Simon Litsyn",

year = "2008",

doi = "10.1109/EEEI.2008.4736667",

language = "אנגלית",

isbn = "9781424424825",

series = "IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings",

pages = "105--109",

booktitle = "2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2008",

note = "2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2008 ; Conference date: 03-12-2008 Through 05-12-2008",

}

Presman, N, Sharon, E & Litsyn, S 2008, Generalized serial schedules for iterative decoding of LDPC codes. in 2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2008., 4736667, IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings, pp. 105-109, 2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2008, Eilat, Israel, 3/12/08. https://doi.org/10.1109/EEEI.2008.4736667

Generalized serial schedules for iterative decoding of LDPC codes. / Presman, Noam; Sharon, Eran; Litsyn, Simon.
2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2008. 2008. p. 105-109 4736667 (IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Generalized serial schedules for iterative decoding of LDPC codes

AU - Presman, Noam

AU - Sharon, Eran

AU - Litsyn, Simon

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

KW - Decoding schedules

KW - Iterative decoding

KW - LDPC codes

UR - http://www.scopus.com/inward/record.url?scp=62749103351&partnerID=8YFLogxK

U2 - 10.1109/EEEI.2008.4736667

DO - 10.1109/EEEI.2008.4736667

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:62749103351

SN - 9781424424825

T3 - IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings

SP - 105

EP - 109

BT - 2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2008

T2 - 2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2008

Y2 - 3 December 2008 through 5 December 2008

ER -

Generalized serial schedules for iterative decoding of LDPC codes

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this