When does one redundant parity-check equation matter?

Stefan Laendner, Thorsten Hehn, Olgica Milenkovic, Johannes B. Huber

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We analyze the effect of redundant parity-check equations on the error-floor performance of low-density paritycheck (LDPC) codes used over the additive white Gaussian noise (AWGN) channel. Our findings show that a large number of iterative decoding errors in the [2640, 1320] Margulis code, confined to point trapping sets in the standard Tanner graph, can be corrected if only one redundant parity-check equation is added to the decoder's matrix. We also derive an analytic expression relating the number of rows in the parity-check matrix of a code and the parameters of trapping sets in the code's graph.

Original languageEnglish (US)
Title of host publicationIEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
DOIs
StatePublished - Dec 1 2006
Externally publishedYes
EventIEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference - San Francisco, CA, United States
Duration: Nov 27 2006Dec 1 2006

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference

Other

OtherIEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
CountryUnited States
CitySan Francisco, CA
Period11/27/0612/1/06

Keywords

  • Lovàsz local lemma
  • Margulis code
  • Redundant parity-checks
  • Trapping sets

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'When does one redundant parity-check equation matter?'. Together they form a unique fingerprint.

Cite this