%0 Conference Paper %F Oral %T Non-surjective finite alphabet iterative decoders %+ Equipes Traitement de l'Information et Systèmes (ETIS - UMR 8051) %+ Commissariat à l'énergie atomique et aux énergies alternatives - Laboratoire d'Electronique et de Technologie de l'Information (CEA-LETI) %+ Politehnica University of Timisoara (UPT) %A Truong Nguyen-Ly, Thien %A Le, Khoa %A Savin, Valentin %A Declercq, D %A Ghaffari, F %A Boncalo, O %Z FrancoRomanian (ANR-UEFISCDI) Joint Research Programme “Blanc-2013”, project DIAMOND. %< avec comité de lecture %B Communications (ICC), 2016 IEEE International Conference on %C Kuala Lumpur, Malaysia %P 1 - 6 %8 2016-05-22 %D 2016 %R 10.1109/ICC.2016.7511111 %Z Engineering Sciences [physics]Conference papers %X 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. %G English %2 https://cea.hal.science/cea-01573434/document %2 https://cea.hal.science/cea-01573434/file/2016-ICC_Non-Surjective%20Finite%20Alphabet%20Iterative%20Decoders.pdf %L cea-01573434 %U https://cea.hal.science/cea-01573434 %~ CEA %~ CNRS %~ UNIV-CERGY %~ OPENAIRE %~ ETIS %~ ETIS-ASTRE %~ ETIS-ICI %~ DRT %~ LETI %~ CEA-GRE %~ CY-TECH-SM