Finite alphabet iterative decoders robust to faulty hardware: Analysis and selection

Elsa Dupraz, David Declercq, Bane Vasić, Valentin Savin

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

13 Scopus citations

Abstract

In this paper, we analyze Finite Alphabet Iterative Decoders (FAIDs) running on faulty hardware. Under symmetric error models at the message level, we derive the noisy Density Evolution equations, and introduce a new noisy threshold phenomenon (called functional threshold), which accurately characterizes the convergence behavior of LDPC code ensembles under noisy-FAID decoding. The proposed functional threshold is then used to identify FAIDs which are particularly robust to the transient hardware noise. Finite-length simulations are drawn to verify the validity of the asymptotical study.

Original languageEnglish (US)
Title of host publicationInternational Symposium on Turbo Codes and Iterative Information Processing, ISTC
PublisherIEEE Computer Society
Pages107-111
Number of pages5
ISBN (Electronic)9781479959853
DOIs
StatePublished - Nov 12 2014
Event2014 8th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2014 - Bremen, Germany
Duration: Aug 18 2014Aug 22 2014

Publication series

NameInternational Symposium on Turbo Codes and Iterative Information Processing, ISTC
ISSN (Print)2165-4700
ISSN (Electronic)2165-4719

Other

Other2014 8th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2014
CountryGermany
CityBremen
Period8/18/148/22/14

    Fingerprint

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Information Systems
  • Theoretical Computer Science

Cite this

Dupraz, E., Declercq, D., Vasić, B., & Savin, V. (2014). Finite alphabet iterative decoders robust to faulty hardware: Analysis and selection. In International Symposium on Turbo Codes and Iterative Information Processing, ISTC (pp. 107-111). [6955095] (International Symposium on Turbo Codes and Iterative Information Processing, ISTC). IEEE Computer Society. https://doi.org/10.1109/ISTC.2014.6955095