Non-surjective finite alphabet iterative decoders

Thien Truong Nguyen-Ly; Khoa Le; Valentin Savin; D Declercq; F Ghaffari; O Boncalo

doi:10.1109/ICC.2016.7511111

Non-surjective finite alphabet iterative decoders

Thien Truong Nguyen-Ly ^{1, 2} Khoa Le ¹ Valentin Savin ² D Declercq ¹ F Ghaffari ¹ O Boncalo ³

1 ETIS - Equipes Traitement de l'Information et Systèmes

2 CEA-LETI - Laboratoire d'Electronique et des Technologies de l'Information

3 UPT - Politehnica University of Timisoara

Abstract : This paper introduces a new theoretical framework, akin to the use of imprecise message storage in Low Density Parity Check (LDPC) decoders, which is seen as an enabler for cost-effective hardware designs. The proposed framework is the one of Non-Surjective Finite Alphabet Iterative Decoders (NS-FAIDs), and it is shown to provide a unified approach for several designs previously proposed in the literature. NS-FAIDs are optimized by density evolution for WiMAX irregular LDPC codes and we show they provide different trade-offs between hardware complexity and decoding performance. In particular, we derive a set of 27 NS-FAIDs that provide decoding gains up to 0.36 dB, while yielding a memory / interconnect reduction up to 25% / 30% compared to the Min-Sum decoder.

Document type :

Conference papers

Domain :

Engineering Sciences [physics]

Liste complète des métadonnées

Cited literature [13 references] Display Hide Download

https://hal-cea.archives-ouvertes.fr/cea-01573434
Contributor : Raffaele d'Errico <>
Submitted on : Wednesday, August 9, 2017 - 3:29:09 PM
Last modification on : Monday, February 25, 2019 - 4:34:20 PM

2016-ICC_Non-Surjective Finite...

Files produced by the author(s)

Non-surjective finite alphabet iterative decoders

File

Identifiers

Collections

Citation

Export

Metrics

179

60

Contact

Non-surjective finite alphabet iterative decoders

File

Identifiers

Collections

Citation

Export

Share

Metrics

179

60

Contact