High Throughput FPGA Implementation for regular Non-Surjective Finite Alphabet Iterative Decoders - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

High Throughput FPGA Implementation for regular Non-Surjective Finite Alphabet Iterative Decoders

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

Abstract

—This paper deals with the recently introduced class of Non-Surjective Finite Alphabet Iterative Decoders (NS-FAIDs). First, optimization results for an extended class of regular NS-FAIDs are presented. They reveal different possible trade-offs between decoding performance and hardware implementation efficiency. To validate the promises of optimized NS-FAIDs in terms of hardware implementation benefits, we propose two high-throughput hardware architectures, integrating NS-FAIDs decoding kernels. Implementation results show that NS-FAIDs allow significant improvements in terms of both throughput and hardware resources consumption, as compared to a baseline Min-Sum decoder, with even better or only slightly degraded decoding performance.
Fichier principal
Vignette du fichier
17-ICC_High Throughput FPGA Implementation for Regular NS-FAIDs.pdf (411.76 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

cea-01567164 , version 1 (21-07-2017)

Identifiers

Cite

Thien Truong Nguyen-Ly, Valentin Savin, Xavier Popon, David Declercq. High Throughput FPGA Implementation for regular Non-Surjective Finite Alphabet Iterative Decoders. 2017 IEEE International Conference on Communications Workshops (ICC Workshops), May 2017, Paris, France. pp.961 - 966, ⟨10.1109/ICCW.2017.7962783⟩. ⟨cea-01567164⟩
184 View
210 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More