On the guaranteed error-correction of decimation-enhanced iterative decoders

Shiva Kumar Planjery, David Declercq, Madiagne Diouf, Bane V Vasic

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

2 Citations (Scopus)

Abstract

Finite alphabet iterative decoders (FAIDs) proposed for LDPC codes on the binary symmetric channel are capable of surpassing the belief propagation (BP) decoder in the error floor region with lower complexity and precision, but these decoders are difficult to analyze for finite-length codes. Recently, decimation-enhanced FAIDs (DFAIDs) were proposed for column-weight-three codes. Decimation involves fixing the bit values of certain variable nodes during message-passing based on the messages they receive after some number of iterations. In this paper, we address the problem of proving the guaranteed error-correction capability of DFAIDs for column-weight-three LDPC codes. We present the methodology of the proof to derive sufficient conditions on the Tanner graph that guarantee the correction of a given error pattern in a finite number of iterations. These sufficient conditions are described as a list of forbidden graphs that must not be contained in the Tanner graph of the code. As a test case, we consider the problem of guaranteeing the correction of four errors. We illustrate the analysis for a specific 4-error pattern and provide the sufficient conditions for its correction. We also present results on the design of codes satisfying those sufficient conditions and their impact on the achievable code rate.

Original languageEnglish (US)
Title of host publicationInternational Symposium on Turbo Codes and Iterative Information Processing, ISTC
PublisherIEEE Computer Society
Pages57-61
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

Decimation
Error correction
Error Correction
LDPC Codes
Sufficient Conditions
Graph in graph theory
Message passing
Iteration
Belief Propagation
Message Passing
Low Complexity
Binary
Methodology
Vertex of a graph

ASJC Scopus subject areas

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

Cite this

Planjery, S. K., Declercq, D., Diouf, M., & Vasic, B. V. (2014). On the guaranteed error-correction of decimation-enhanced iterative decoders. In International Symposium on Turbo Codes and Iterative Information Processing, ISTC (pp. 57-61). [6955085] IEEE Computer Society. https://doi.org/10.1109/ISTC.2014.6955085

On the guaranteed error-correction of decimation-enhanced iterative decoders. / Planjery, Shiva Kumar; Declercq, David; Diouf, Madiagne; Vasic, Bane V.

International Symposium on Turbo Codes and Iterative Information Processing, ISTC. IEEE Computer Society, 2014. p. 57-61 6955085.

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

Planjery, SK, Declercq, D, Diouf, M & Vasic, BV 2014, On the guaranteed error-correction of decimation-enhanced iterative decoders. in International Symposium on Turbo Codes and Iterative Information Processing, ISTC., 6955085, IEEE Computer Society, pp. 57-61, 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.6955085
Planjery SK, Declercq D, Diouf M, Vasic BV. On the guaranteed error-correction of decimation-enhanced iterative decoders. In International Symposium on Turbo Codes and Iterative Information Processing, ISTC. IEEE Computer Society. 2014. p. 57-61. 6955085 https://doi.org/10.1109/ISTC.2014.6955085
Planjery, Shiva Kumar ; Declercq, David ; Diouf, Madiagne ; Vasic, Bane V. / On the guaranteed error-correction of decimation-enhanced iterative decoders. International Symposium on Turbo Codes and Iterative Information Processing, ISTC. IEEE Computer Society, 2014. pp. 57-61
@inproceedings{480a3ce4bcbc4d659b52317a69727d64,
title = "On the guaranteed error-correction of decimation-enhanced iterative decoders",
abstract = "Finite alphabet iterative decoders (FAIDs) proposed for LDPC codes on the binary symmetric channel are capable of surpassing the belief propagation (BP) decoder in the error floor region with lower complexity and precision, but these decoders are difficult to analyze for finite-length codes. Recently, decimation-enhanced FAIDs (DFAIDs) were proposed for column-weight-three codes. Decimation involves fixing the bit values of certain variable nodes during message-passing based on the messages they receive after some number of iterations. In this paper, we address the problem of proving the guaranteed error-correction capability of DFAIDs for column-weight-three LDPC codes. We present the methodology of the proof to derive sufficient conditions on the Tanner graph that guarantee the correction of a given error pattern in a finite number of iterations. These sufficient conditions are described as a list of forbidden graphs that must not be contained in the Tanner graph of the code. As a test case, we consider the problem of guaranteeing the correction of four errors. We illustrate the analysis for a specific 4-error pattern and provide the sufficient conditions for its correction. We also present results on the design of codes satisfying those sufficient conditions and their impact on the achievable code rate.",
author = "Planjery, {Shiva Kumar} and David Declercq and Madiagne Diouf and Vasic, {Bane V}",
year = "2014",
month = "11",
day = "12",
doi = "10.1109/ISTC.2014.6955085",
language = "English (US)",
isbn = "9781479959853",
pages = "57--61",
booktitle = "International Symposium on Turbo Codes and Iterative Information Processing, ISTC",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - On the guaranteed error-correction of decimation-enhanced iterative decoders

AU - Planjery, Shiva Kumar

AU - Declercq, David

AU - Diouf, Madiagne

AU - Vasic, Bane V

PY - 2014/11/12

Y1 - 2014/11/12

N2 - Finite alphabet iterative decoders (FAIDs) proposed for LDPC codes on the binary symmetric channel are capable of surpassing the belief propagation (BP) decoder in the error floor region with lower complexity and precision, but these decoders are difficult to analyze for finite-length codes. Recently, decimation-enhanced FAIDs (DFAIDs) were proposed for column-weight-three codes. Decimation involves fixing the bit values of certain variable nodes during message-passing based on the messages they receive after some number of iterations. In this paper, we address the problem of proving the guaranteed error-correction capability of DFAIDs for column-weight-three LDPC codes. We present the methodology of the proof to derive sufficient conditions on the Tanner graph that guarantee the correction of a given error pattern in a finite number of iterations. These sufficient conditions are described as a list of forbidden graphs that must not be contained in the Tanner graph of the code. As a test case, we consider the problem of guaranteeing the correction of four errors. We illustrate the analysis for a specific 4-error pattern and provide the sufficient conditions for its correction. We also present results on the design of codes satisfying those sufficient conditions and their impact on the achievable code rate.

AB - Finite alphabet iterative decoders (FAIDs) proposed for LDPC codes on the binary symmetric channel are capable of surpassing the belief propagation (BP) decoder in the error floor region with lower complexity and precision, but these decoders are difficult to analyze for finite-length codes. Recently, decimation-enhanced FAIDs (DFAIDs) were proposed for column-weight-three codes. Decimation involves fixing the bit values of certain variable nodes during message-passing based on the messages they receive after some number of iterations. In this paper, we address the problem of proving the guaranteed error-correction capability of DFAIDs for column-weight-three LDPC codes. We present the methodology of the proof to derive sufficient conditions on the Tanner graph that guarantee the correction of a given error pattern in a finite number of iterations. These sufficient conditions are described as a list of forbidden graphs that must not be contained in the Tanner graph of the code. As a test case, we consider the problem of guaranteeing the correction of four errors. We illustrate the analysis for a specific 4-error pattern and provide the sufficient conditions for its correction. We also present results on the design of codes satisfying those sufficient conditions and their impact on the achievable code rate.

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

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

U2 - 10.1109/ISTC.2014.6955085

DO - 10.1109/ISTC.2014.6955085

M3 - Conference contribution

AN - SCOPUS:84911868050

SN - 9781479959853

SP - 57

EP - 61

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

PB - IEEE Computer Society

ER -