NB-LDPC check node with pre-sorted input - Ecole Nationale d'Ingénieurs de Brest Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

NB-LDPC check node with pre-sorted input

Emmanuel Boutillon

Résumé

Non-binary low-density parity-check codes have better communication performance compared to their binary counterparts but they suffer from higher complexity, especially for the check node processing. In this paper a sorting of the input vectors based on a reliability criteria is performed prior to the check node processing. This presorting process allows the Extended Min-Sum (EMS) check node process to focus its effort mainly on the weakest inputs. Proof is given for a check node of degree 12 in GF(64) for the syndrome based algorithm with a number of computed syndromes reduced by a factor of four which directly impacts the check node complexity without performance degradation. Index Terms—NB-LDPC, Check Node, syndrome-based, EMS.

Mots clés

Domaines

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

Dates et versions

hal-01365548 , version 1 (13-09-2016)

Identifiants

  • HAL Id : hal-01365548 , version 1

Citer

Cédric Marchand, Emmanuel Boutillon. NB-LDPC check node with pre-sorted input. International Symposium on Turbo Codes & Iterative Information Processing 2016, Sep 2016, Brest, France. ⟨hal-01365548⟩
135 Consultations
330 Téléchargements

Partager

Gmail Facebook X LinkedIn More