Ensemble weight enumerators for protographs: A proof of Abu Surra's conjecture and a continuous relaxation for a faster enumeration
Résumé
In this paper, we provide a proof for the conjecture made by Abu Surra et al. [1] to simplify the computation of ensemble input output weight enumerators for protograph-based low density parity check (LDPC) codes. Furthermore, we propose a new method to compute more efficiently the ensemble weight enumerator. This approach can be applied particularly to lighten the computations for high rate codes, generalized LDPC codes or spatially coupled LDPC codes.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...