Optimization of Non Binary Parity Check Coefficients - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Information Theory Année : 2019

Optimization of Non Binary Parity Check Coefficients

Résumé

This paper generalizes the method proposed by Pouillat et al. for the determination of the optimal Galois Field coefficients of a Non-Binary LDPC parity check constraint based on the binary image of the code. Optimal, or almost-optimal, parity check coefficients are given for check degree varying from 4 to 20 and Galois Field varying from GF(64) up to GF(1024). For all given sets of coefficients, no codeword of Hamming weight two exists. A reduced complexity algorithm to compute the binary Hamming weight 3 of a parity check is proposed. When the number of sets of coefficients is too high for an exhaustive search and evaluation, a local greedy search is performed. Explicit tables of coefficients are given. The proposed sets of coefficients can effectively replace the random selection of coefficients often used in NB-LDPC construction.

Domaines

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

Dates et versions

hal-01575521 , version 1 (21-08-2017)
hal-01575521 , version 2 (07-06-2018)
hal-01575521 , version 3 (10-12-2018)

Identifiants

Citer

Emmanuel Boutillon. Optimization of Non Binary Parity Check Coefficients. IEEE Transactions on Information Theory, 2019, 65 (4), pp.2092-2100. ⟨10.1109/TIT.2018.2881436⟩. ⟨hal-01575521v3⟩
200 Consultations
211 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More