Ensemble weight enumerators for protographs: A proof of Abu Surra's conjecture and a continuous relaxation for a faster enumeration

Abstract : 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.
Keywords : Nickel
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01461712
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Wednesday, February 8, 2017 - 1:55:55 PM
Last modification on : Thursday, July 25, 2019 - 4:34:16 PM
Long-term archiving on : Tuesday, May 9, 2017 - 1:17:59 PM

File

benaddi_17191.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01461712, version 1
  • OATAO : 17191

Collections

Citation

Tarik Benaddi, Charly Poulliat, Marie-Laure Boucheret, Benjamin Gadat, Guy Lesthievent. Ensemble weight enumerators for protographs: A proof of Abu Surra's conjecture and a continuous relaxation for a faster enumeration. IEEE International Symposium on Information Theory (ISIT 2015), Jun 2015, Hong Kong, Hong Kong SAR China. pp. 2889-2893. ⟨hal-01461712⟩

Share

Metrics

Record views

257

Files downloads

130