Analysis of LDPC decoding schedules

Eran Sharon, Noam Presman, Simon Litsyn

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 languageEnglish
Title of host publication2009 IEEE International Symposium on Information Theory, ISIT 2009
Pages1669-1673
Number of pages5
DOIs
StatePublished - 2009
Event2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of
Duration: 28 Jun 20093 Jul 2009

Publication series

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

Conference

Conference2009 IEEE International Symposium on Information Theory, ISIT 2009
Country/TerritoryKorea, Republic of
CitySeoul
Period28/06/093/07/09

Keywords

  • Belief propagation
  • Density evolution
  • Iterative decoding
  • LDPC codes

Fingerprint

Dive into the research topics of 'Analysis of LDPC decoding schedules'. Together they form a unique fingerprint.

Cite this