Enhancing the error correction of finite alphabet iterative decoders via adaptive decimation

Shiva Kumar Planjery, Bane V Vasic, David Declercq

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

2 Citations (Scopus)

Abstract

Finite alphabet iterative decoders (FAIDs) for LDPC codes were recently shown to be capable of surpassing the Belief Propagation (BP) decoder in the error floor region on the Binary Symmetric channel (BSC). More recently, the technique of decimation which involves fixing the values of certain bits during decoding, was proposed for FAIDs in order to make them more amenable to analysis while maintaining their good performance. In this paper, we show how decimation can be used adaptively to further enhance the guaranteed error correction capability of FAIDs that are already good on a given code. The new adaptive decimation scheme proposed has marginally added complexity but can significantly improve the slope of the error floor performance of a particular FAID. We describe the adaptive decimation scheme particularly for 7-level FAIDs which propagate only 3-bit messages and provide numerical results for column-weight three codes. Analysis suggests that the failures of the new decoders are linked to stopping sets of the code.

Original languageEnglish (US)
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages2876-2880
Number of pages5
DOIs
StatePublished - 2012
Event2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States
Duration: Jul 1 2012Jul 6 2012

Other

Other2012 IEEE International Symposium on Information Theory, ISIT 2012
CountryUnited States
CityCambridge, MA
Period7/1/127/6/12

Fingerprint

Decimation
Error correction
Error Correction
Decoding
LDPC Codes
Belief Propagation
Slope
Binary
Numerical Results

ASJC Scopus subject areas

  • Applied Mathematics
  • Modeling and Simulation
  • Theoretical Computer Science
  • Information Systems

Cite this

Planjery, S. K., Vasic, B. V., & Declercq, D. (2012). Enhancing the error correction of finite alphabet iterative decoders via adaptive decimation. In IEEE International Symposium on Information Theory - Proceedings (pp. 2876-2880). [6284050] https://doi.org/10.1109/ISIT.2012.6284050

Enhancing the error correction of finite alphabet iterative decoders via adaptive decimation. / Planjery, Shiva Kumar; Vasic, Bane V; Declercq, David.

IEEE International Symposium on Information Theory - Proceedings. 2012. p. 2876-2880 6284050.

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

Planjery, SK, Vasic, BV & Declercq, D 2012, Enhancing the error correction of finite alphabet iterative decoders via adaptive decimation. in IEEE International Symposium on Information Theory - Proceedings., 6284050, pp. 2876-2880, 2012 IEEE International Symposium on Information Theory, ISIT 2012, Cambridge, MA, United States, 7/1/12. https://doi.org/10.1109/ISIT.2012.6284050
Planjery SK, Vasic BV, Declercq D. Enhancing the error correction of finite alphabet iterative decoders via adaptive decimation. In IEEE International Symposium on Information Theory - Proceedings. 2012. p. 2876-2880. 6284050 https://doi.org/10.1109/ISIT.2012.6284050
Planjery, Shiva Kumar ; Vasic, Bane V ; Declercq, David. / Enhancing the error correction of finite alphabet iterative decoders via adaptive decimation. IEEE International Symposium on Information Theory - Proceedings. 2012. pp. 2876-2880
@inproceedings{a73ec8af9d9046738a67a5a765bccc7c,
title = "Enhancing the error correction of finite alphabet iterative decoders via adaptive decimation",
abstract = "Finite alphabet iterative decoders (FAIDs) for LDPC codes were recently shown to be capable of surpassing the Belief Propagation (BP) decoder in the error floor region on the Binary Symmetric channel (BSC). More recently, the technique of decimation which involves fixing the values of certain bits during decoding, was proposed for FAIDs in order to make them more amenable to analysis while maintaining their good performance. In this paper, we show how decimation can be used adaptively to further enhance the guaranteed error correction capability of FAIDs that are already good on a given code. The new adaptive decimation scheme proposed has marginally added complexity but can significantly improve the slope of the error floor performance of a particular FAID. We describe the adaptive decimation scheme particularly for 7-level FAIDs which propagate only 3-bit messages and provide numerical results for column-weight three codes. Analysis suggests that the failures of the new decoders are linked to stopping sets of the code.",
author = "Planjery, {Shiva Kumar} and Vasic, {Bane V} and David Declercq",
year = "2012",
doi = "10.1109/ISIT.2012.6284050",
language = "English (US)",
isbn = "9781467325790",
pages = "2876--2880",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",

}

TY - GEN

T1 - Enhancing the error correction of finite alphabet iterative decoders via adaptive decimation

AU - Planjery, Shiva Kumar

AU - Vasic, Bane V

AU - Declercq, David

PY - 2012

Y1 - 2012

N2 - Finite alphabet iterative decoders (FAIDs) for LDPC codes were recently shown to be capable of surpassing the Belief Propagation (BP) decoder in the error floor region on the Binary Symmetric channel (BSC). More recently, the technique of decimation which involves fixing the values of certain bits during decoding, was proposed for FAIDs in order to make them more amenable to analysis while maintaining their good performance. In this paper, we show how decimation can be used adaptively to further enhance the guaranteed error correction capability of FAIDs that are already good on a given code. The new adaptive decimation scheme proposed has marginally added complexity but can significantly improve the slope of the error floor performance of a particular FAID. We describe the adaptive decimation scheme particularly for 7-level FAIDs which propagate only 3-bit messages and provide numerical results for column-weight three codes. Analysis suggests that the failures of the new decoders are linked to stopping sets of the code.

AB - Finite alphabet iterative decoders (FAIDs) for LDPC codes were recently shown to be capable of surpassing the Belief Propagation (BP) decoder in the error floor region on the Binary Symmetric channel (BSC). More recently, the technique of decimation which involves fixing the values of certain bits during decoding, was proposed for FAIDs in order to make them more amenable to analysis while maintaining their good performance. In this paper, we show how decimation can be used adaptively to further enhance the guaranteed error correction capability of FAIDs that are already good on a given code. The new adaptive decimation scheme proposed has marginally added complexity but can significantly improve the slope of the error floor performance of a particular FAID. We describe the adaptive decimation scheme particularly for 7-level FAIDs which propagate only 3-bit messages and provide numerical results for column-weight three codes. Analysis suggests that the failures of the new decoders are linked to stopping sets of the code.

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

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

U2 - 10.1109/ISIT.2012.6284050

DO - 10.1109/ISIT.2012.6284050

M3 - Conference contribution

SN - 9781467325790

SP - 2876

EP - 2880

BT - IEEE International Symposium on Information Theory - Proceedings

ER -