Finite alphabet iterative decoding (FAID) of the (155,64,20) Tanner code

David Declercq, Ludovic Danjean, Erbao Li, Shiva K. Planjery, Bane Vasić

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

7 Scopus citations

Abstract

It is now well established that iterative decoding approaches the performance of Maximum Likelihood Decoding of sparse graph codes, asymptotically in the block length. For a finite length sparse code, iterative decoding fails on specific subgraphs generically termed as trapping sets. Trapping sets give rise to error floor, an abrupt degradation of the code error performance in the high signal to noise ratio regime. In this paper, we will study a recently introduced class of quantized iterative decoders, for which the messages are defined on a finite alphabet and which successfully decode errors on subgraphs that are uncorrectable by conventional decoders such as the min-sum or the belief propagation. We will especially study the performance of the proposed finite alphabet iterative decoders on the famous (155,64,20) Tanner code.

Original languageEnglish (US)
Title of host publication6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010
Pages11-15
Number of pages5
DOIs
StatePublished - 2010
Event6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010 - Brest, France
Duration: Sep 6 2010Sep 10 2010

Publication series

Name6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010

Other

Other6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010
CountryFrance
CityBrest
Period9/6/109/10/10

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'Finite alphabet iterative decoding (FAID) of the (155,64,20) Tanner code'. Together they form a unique fingerprint.

  • Cite this

    Declercq, D., Danjean, L., Li, E., Planjery, S. K., & Vasić, B. (2010). Finite alphabet iterative decoding (FAID) of the (155,64,20) Tanner code. In 6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010 (pp. 11-15). [5613861] (6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010). https://doi.org/10.1109/ISTC.2010.5613861