Analysis of LDPC decoding schedules

Eran Sharon; Noam Presman; Simon Litsyn

doi:10.1109/ISIT.2009.5205776

Analysis of LDPC decoding schedules

Eran Sharon^*, Noam Presman, Simon Litsyn

^*Corresponding author for this work

School of Electrical Engineering

Tel Aviv University

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

1 Scopus citations

Abstract

Schedule is the order of passing messages between vertices of the bipartite graph defining an LDPC code during decoding. Schedules may significantly differ in the rate of decoding convergence. New efficient generalized serial schedules are described and analyzed. They provide significant convergence rate speedup factors compared to previously known schedules. For the proposed schedules, combinatorial and probabilistic analysis is presented, explaining the fast convergence observed in simulations. Using it, LDPC ensembles for which significantly better convergence rates can be obtained are identified.

Original language	English
Title of host publication	2009 IEEE International Symposium on Information Theory, ISIT 2009
Pages	1669-1673
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2009.5205776
State	Published - 2009
Event	2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of Duration: 28 Jun 2009 → 3 Jul 2009

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8102

Conference

Conference	2009 IEEE International Symposium on Information Theory, ISIT 2009
Country/Territory	Korea, Republic of
City	Seoul
Period	28/06/09 → 3/07/09

Keywords

Belief propagation
Density evolution
Iterative decoding
LDPC codes

Access to Document

10.1109/ISIT.2009.5205776

Cite this

@inproceedings{38e47f79f4ef4f279e441c5b342679e7,

title = "Analysis of LDPC decoding schedules",

abstract = "Schedule is the order of passing messages between vertices of the bipartite graph defining an LDPC code during decoding. Schedules may significantly differ in the rate of decoding convergence. New efficient generalized serial schedules are described and analyzed. They provide significant convergence rate speedup factors compared to previously known schedules. For the proposed schedules, combinatorial and probabilistic analysis is presented, explaining the fast convergence observed in simulations. Using it, LDPC ensembles for which significantly better convergence rates can be obtained are identified.",

keywords = "Belief propagation, Density evolution, Iterative decoding, LDPC codes",

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

year = "2009",

doi = "10.1109/ISIT.2009.5205776",

language = "אנגלית",

isbn = "9781424443130",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "1669--1673",

booktitle = "2009 IEEE International Symposium on Information Theory, ISIT 2009",

note = "2009 IEEE International Symposium on Information Theory, ISIT 2009 ; Conference date: 28-06-2009 Through 03-07-2009",

}

Sharon, E, Presman, N & Litsyn, S 2009, Analysis of LDPC decoding schedules. in 2009 IEEE International Symposium on Information Theory, ISIT 2009., 5205776, IEEE International Symposium on Information Theory - Proceedings, pp. 1669-1673, 2009 IEEE International Symposium on Information Theory, ISIT 2009, Seoul, Korea, Republic of, 28/06/09. https://doi.org/10.1109/ISIT.2009.5205776

TY - GEN

T1 - Analysis of LDPC decoding schedules

AU - Sharon, Eran

AU - Presman, Noam

AU - Litsyn, Simon

PY - 2009

Y1 - 2009

N2 - Schedule is the order of passing messages between vertices of the bipartite graph defining an LDPC code during decoding. Schedules may significantly differ in the rate of decoding convergence. New efficient generalized serial schedules are described and analyzed. They provide significant convergence rate speedup factors compared to previously known schedules. For the proposed schedules, combinatorial and probabilistic analysis is presented, explaining the fast convergence observed in simulations. Using it, LDPC ensembles for which significantly better convergence rates can be obtained are identified.

AB - Schedule is the order of passing messages between vertices of the bipartite graph defining an LDPC code during decoding. Schedules may significantly differ in the rate of decoding convergence. New efficient generalized serial schedules are described and analyzed. They provide significant convergence rate speedup factors compared to previously known schedules. For the proposed schedules, combinatorial and probabilistic analysis is presented, explaining the fast convergence observed in simulations. Using it, LDPC ensembles for which significantly better convergence rates can be obtained are identified.

KW - Belief propagation

KW - Density evolution

KW - Iterative decoding

KW - LDPC codes

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

U2 - 10.1109/ISIT.2009.5205776

DO - 10.1109/ISIT.2009.5205776

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

AN - SCOPUS:70449478530

SN - 9781424443130

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1669

EP - 1673

BT - 2009 IEEE International Symposium on Information Theory, ISIT 2009

T2 - 2009 IEEE International Symposium on Information Theory, ISIT 2009

Y2 - 28 June 2009 through 3 July 2009

ER -

Analysis of LDPC decoding schedules

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this