Decimation-enhanced finite alphabet iterative decoders for LDPC codes on the BSC

Shiva Kumar Planjery, Bane Vasic, David Declercq

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

4 Scopus citations

Abstract

Finite alphabet iterative decoders (FAID) with multilevel messages that can surpass BP in the error floor region for LDPC codes on the BSC were previously proposed in [1]. In this paper, we propose decimation-enhanced decoders. The technique of decimation which is incorporated into the message update rule, involves fixing certain bits of the code to a particular value. Under appropriately chosen rules, decimation can significantly reduce the number of iterations required to correct a fixed number of errors, while maintaining the good performance of the original decoder in the error floor region. At the same time, the algorithm is much more amenable to analysis. We shall provide a simple decimation scheme for a particularly good 7-level FAID for column-weight three codes on the BSC, that helps to correct a fixed number of errors in fewer iterations, and provide insights into the analysis of the decoder. We shall also examine the conditions under which the decimation-enhanced 7-level FAID performs at least as good as the 7-level FAID.

Original languageEnglish (US)
Title of host publication2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Pages2383-2387
Number of pages5
DOIs
StatePublished - Oct 26 2011
Event2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 - St. Petersburg, Russian Federation
Duration: Jul 31 2011Aug 5 2011

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8104

Other

Other2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
CountryRussian Federation
CitySt. Petersburg
Period7/31/118/5/11

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'Decimation-enhanced finite alphabet iterative decoders for LDPC codes on the BSC'. Together they form a unique fingerprint.

  • Cite this

    Planjery, S. K., Vasic, B., & Declercq, D. (2011). Decimation-enhanced finite alphabet iterative decoders for LDPC codes on the BSC. In 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 (pp. 2383-2387). [6033990] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2011.6033990