Non-surjective finite alphabet iterative decoders

Thien Truong Nguyen-Ly (1, 2) , Khoa Le (1) , Valentin Savin (2) , D Declercq (1) , F Ghaffari (1) , O Boncalo (3)

1 ETIS - UMR 8051 - Equipes Traitement de l'Information et Systèmes
2 CEA-LETI - Commissariat à l'énergie atomique et aux énergies alternatives - Laboratoire d'Electronique et de Technologie de l'Information
3 UPT - Universității Politehnica Timișoara [România] = Polytechnic University of Timişoara [Romania] = Université polytechnique de Timișoara [Roumanie]

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.

Domaines: Sciences de l'ingénieur [physics]

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⟩