Complexity Comparison of Non-Binary LDPC Decoders - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Complexity Comparison of Non-Binary LDPC Decoders

Résumé

This paper presents a detailed complexity study of the existing non-binary LDPC decoding algorithms in order to rigorously compare them from a hardware perspective. The Belief Propagation algorithm is first considered as well as its derivative versions in the frequency and logarithm domains. We then focus on the Extended Min-Sum and its recent simplified version. For each algorithm, the number of operations in an elementary step of the check and variable nodes is determined. Finally we evaluate the interest of the application of the simplified Extended Min-Sum algorithm to a new family of non-binary LDPC codes designed in the framework of the DaVinci project

Mots clés

Domaines

Electronique
Fichier principal
Vignette du fichier
ICT_Summit_NB_LDPC.pdf (812.2 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00479614 , version 1 (01-05-2010)

Identifiants

  • HAL Id : hal-00479614 , version 1

Citer

Laura Conde-Canencia, Ali Al-Ghouwayel, Emmanuel Boutillon. Complexity Comparison of Non-Binary LDPC Decoders. ICT MobileSummit, Jun 2009, Santander, Spain. pp.1-8. ⟨hal-00479614⟩
494 Consultations
277 Téléchargements

Partager

Gmail Facebook X LinkedIn More