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

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

doi:10.1109/ISTC.2014.6955095

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 proceeding › Conference 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 language	English (US)
Title of host publication	International Symposium on Turbo Codes and Iterative Information Processing, ISTC
Publisher	IEEE Computer Society
Pages	107-111
Number of pages	5
ISBN (Electronic)	9781479959853
DOIs	https://doi.org/10.1109/ISTC.2014.6955095
State	Published - Nov 12 2014
Event	2014 8th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2014 - Bremen, Germany Duration: Aug 18 2014 → Aug 22 2014

Publication series

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

Other

Other	2014 8th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2014
Country/Territory	Germany
City	Bremen
Period	8/18/14 → 8/22/14

ASJC Scopus subject areas

Computational Theory and Mathematics
Information Systems
Theoretical Computer Science

Access to Document

10.1109/ISTC.2014.6955095

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). Article 6955095 (International Symposium on Turbo Codes and Iterative Information Processing, ISTC). 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; Vasić, Bane et al.
International Symposium on Turbo Codes and Iterative Information Processing, ISTC. IEEE Computer Society, 2014. p. 107-111 6955095 (International Symposium on Turbo Codes and Iterative Information Processing, ISTC).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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., 6955095, International Symposium on Turbo Codes and Iterative Information Processing, ISTC, 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, Vasić B, 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. (International Symposium on Turbo Codes and Iterative Information Processing, ISTC). doi: 10.1109/ISTC.2014.6955095

@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 Bane Vasi{\'c} and Valentin Savin",

note = "Publisher Copyright: {\textcopyright} 2014 IEEE.; 2014 8th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2014 ; Conference date: 18-08-2014 Through 22-08-2014",

year = "2014",

month = nov,

day = "12",

doi = "10.1109/ISTC.2014.6955095",

language = "English (US)",

series = "International Symposium on Turbo Codes and Iterative Information Processing, ISTC",

publisher = "IEEE Computer Society",

pages = "107--111",

booktitle = "International Symposium on Turbo Codes and Iterative Information Processing, ISTC",

}

TY - GEN

T1 - Finite alphabet iterative decoders robust to faulty hardware

T2 - 2014 8th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2014

AU - Dupraz, Elsa

AU - Declercq, David

AU - Vasić, Bane

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

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

SP - 107

EP - 111

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

PB - IEEE Computer Society

Y2 - 18 August 2014 through 22 August 2014

ER -

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

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this