Pre-sorted Forward-Backward NB-LDPC Check Node Architecture - Archive ouverte HAL
Communication Dans Un Congrès Année : 2016

Pre-sorted Forward-Backward NB-LDPC Check Node Architecture

Résumé

This paper deals with reduced-complexity NB-LDPC check node implementation based on the Extended Min-Sum algorithm. We propose to apply a recently introduced pre-sorting technique to the forward-backward architecture. The pre-sorting of the check node inputs allows for significant complexity reduction. Simulation and synthesis results showed that this approach does not introduce any performance loss and can lead to significant area reduction in FPGA implementations (up to 54% for high check node degrees).

Domaines

Electronique
Fichier principal
Vignette du fichier
SIPS_2016_NB_LDPC_sorted_FB-1.pdf (1.1 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01390916 , version 1 (02-11-2016)

Identifiants

  • HAL Id : hal-01390916 , version 1

Citer

Hassan Harb, Cédric Marchand, Laura Conde-Canencia, Emmanuel Boutillon, Ali Al Ghouwayel. Pre-sorted Forward-Backward NB-LDPC Check Node Architecture. IEEE International Workshop on Signal Processing Systems (SIPS'2016), Oct 2016, Dallas, United States. ⟨hal-01390916⟩
108 Consultations
593 Téléchargements

Partager

More