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

David Declercq, Ludovic Danjean, Erbao Li, Shiva K. Planjery, Bane V Vasic

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

7 Citations (Scopus)

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

Other

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

Fingerprint

Iterative Decoding
Iterative decoding
Trapping
Subgraph
Maximum likelihood
Belief Propagation
Sparse Graphs
Decoding
Decode
Signal to noise ratio
Maximum Likelihood
Degradation

ASJC Scopus subject areas

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

Cite this

Declercq, D., Danjean, L., Li, E., Planjery, S. K., & Vasic, B. V. (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] https://doi.org/10.1109/ISTC.2010.5613861

Finite alphabet iterative decoding (FAID) of the (155,64,20) Tanner code. / Declercq, David; Danjean, Ludovic; Li, Erbao; Planjery, Shiva K.; Vasic, Bane V.

6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010. 2010. p. 11-15 5613861.

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

Declercq, D, Danjean, L, Li, E, Planjery, SK & Vasic, BV 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., 5613861, pp. 11-15, 6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010, Brest, France, 9/6/10. https://doi.org/10.1109/ISTC.2010.5613861
Declercq D, Danjean L, Li E, Planjery SK, Vasic BV. 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. 2010. p. 11-15. 5613861 https://doi.org/10.1109/ISTC.2010.5613861
Declercq, David ; Danjean, Ludovic ; Li, Erbao ; Planjery, Shiva K. ; Vasic, Bane V. / Finite alphabet iterative decoding (FAID) of the (155,64,20) Tanner code. 6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010. 2010. pp. 11-15
@inproceedings{b66f4322836342b495d941e19e6decc7,
title = "Finite alphabet iterative decoding (FAID) of the (155,64,20) Tanner code",
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.",
author = "David Declercq and Ludovic Danjean and Erbao Li and Planjery, {Shiva K.} and Vasic, {Bane V}",
year = "2010",
doi = "10.1109/ISTC.2010.5613861",
language = "English (US)",
isbn = "9781424467457",
pages = "11--15",
booktitle = "6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010",

}

TY - GEN

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

AU - Declercq, David

AU - Danjean, Ludovic

AU - Li, Erbao

AU - Planjery, Shiva K.

AU - Vasic, Bane V

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

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

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

U2 - 10.1109/ISTC.2010.5613861

DO - 10.1109/ISTC.2010.5613861

M3 - Conference contribution

AN - SCOPUS:78649270954

SN - 9781424467457

SP - 11

EP - 15

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

ER -