Non-surjective finite alphabet iterative decoders - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Non-surjective finite alphabet iterative decoders

(1, 2) , (1) , (2) , (1) , (1) , (3)
1
2
3

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.
Fichier principal
Vignette du fichier
2016-ICC_Non-Surjective Finite Alphabet Iterative Decoders.pdf (176.27 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

cea-01573434 , version 1 (09-08-2017)

Identifiers

Cite

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, ⟨10.1109/ICC.2016.7511111⟩. ⟨cea-01573434⟩
157 View
220 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More