Non-surjective finite alphabet iterative decoders

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.
Type de document :
Communication dans un congrès
Communications (ICC), 2016 IEEE International Conference on, May 2016, Kuala Lumpur, Malaysia. pp.1 - 6, 2016, 〈10.1109/ICC.2016.7511111〉
Liste complète des métadonnées

Littérature citée [15 références]  Voir  Masquer  Télécharger

https://hal-cea.archives-ouvertes.fr/cea-01573434
Contributeur : Raffaele D'Errico <>
Soumis le : mercredi 9 août 2017 - 15:29:09
Dernière modification le : lundi 21 août 2017 - 08:56:27

Fichier

2016-ICC_Non-Surjective Finite...
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Thien Truong Nguyen-Ly, Khoa Le, Valentin Savin, D Declercq, F Ghaffari, et al.. Non-surjective finite alphabet iterative decoders. Communications (ICC), 2016 IEEE International Conference on, May 2016, Kuala Lumpur, Malaysia. pp.1 - 6, 2016, 〈10.1109/ICC.2016.7511111〉. 〈cea-01573434〉

Partager

Métriques

Consultations de la notice

87

Téléchargements de fichiers

17