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

Elsa Dupraz, David Declercq, Bane V Vasic, Valentin Savin

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

13 Citations (Scopus)

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 (Print)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

Other

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

Fingerprint

Hardware
Iterative decoding
Threshold Phenomena
Iterative Decoding
LDPC Codes
Error Model
Evolution Equation
Ensemble
Verify
Simulation

ASJC Scopus subject areas

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

Cite this

Dupraz, E., Declercq, D., Vasic, B. V., & 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] IEEE Computer Society. https://doi.org/10.1109/ISTC.2014.6955095

Finite alphabet iterative decoders robust to faulty hardware : Analysis and selection. / Dupraz, Elsa; Declercq, David; Vasic, Bane V; Savin, Valentin.

International Symposium on Turbo Codes and Iterative Information Processing, ISTC. IEEE Computer Society, 2014. p. 107-111 6955095.

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

Dupraz, E, Declercq, D, Vasic, BV & 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., 6955095, IEEE Computer Society, pp. 107-111, 2014 8th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2014, Bremen, Germany, 8/18/14. https://doi.org/10.1109/ISTC.2014.6955095
Dupraz E, Declercq D, Vasic BV, Savin V. Finite alphabet iterative decoders robust to faulty hardware: Analysis and selection. In International Symposium on Turbo Codes and Iterative Information Processing, ISTC. IEEE Computer Society. 2014. p. 107-111. 6955095 https://doi.org/10.1109/ISTC.2014.6955095
Dupraz, Elsa ; Declercq, David ; Vasic, Bane V ; Savin, Valentin. / Finite alphabet iterative decoders robust to faulty hardware : Analysis and selection. International Symposium on Turbo Codes and Iterative Information Processing, ISTC. IEEE Computer Society, 2014. pp. 107-111
@inproceedings{f5cbf2118900415d99b3b2d8924efc02,
title = "Finite alphabet iterative decoders robust to faulty hardware: Analysis and selection",
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.",
author = "Elsa Dupraz and David Declercq and Vasic, {Bane V} and Valentin Savin",
year = "2014",
month = "11",
day = "12",
doi = "10.1109/ISTC.2014.6955095",
language = "English (US)",
isbn = "9781479959853",
pages = "107--111",
booktitle = "International Symposium on Turbo Codes and Iterative Information Processing, ISTC",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Finite alphabet iterative decoders robust to faulty hardware

T2 - Analysis and selection

AU - Dupraz, Elsa

AU - Declercq, David

AU - Vasic, Bane V

AU - Savin, Valentin

PY - 2014/11/12

Y1 - 2014/11/12

N2 - 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.

AB - 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.

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

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

U2 - 10.1109/ISTC.2014.6955095

DO - 10.1109/ISTC.2014.6955095

M3 - Conference contribution

AN - SCOPUS:84911894694

SN - 9781479959853

SP - 107

EP - 111

BT - International Symposium on Turbo Codes and Iterative Information Processing, ISTC

PB - IEEE Computer Society

ER -