Generalized serial schedules for iterative decoding of LDPC codes

Noam Presman, Eran Sharon, Simon Litsyn

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publication2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2008
Pages105-109
Number of pages5
DOIs
StatePublished - 2008
Event2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2008 - Eilat, Israel
Duration: 3 Dec 20085 Dec 2008

Publication series

NameIEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings

Conference

Conference2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2008
Country/TerritoryIsrael
CityEilat
Period3/12/085/12/08

Keywords

  • Decoding schedules
  • Iterative decoding
  • LDPC codes

Fingerprint

Dive into the research topics of 'Generalized serial schedules for iterative decoding of LDPC codes'. Together they form a unique fingerprint.

Cite this