A method for the asymptotic analysis of doubly-generalized low-density parity-check (D-GLDPC) codes on the binary erasure channel (BEC) is described. The proposed method is based on extrinsic information transfer (EXIT) charts. It permits to overcome the impossibility to evaluate the EXIT function for the check or variable component codes, in situations where the information functions or split information functions for the component code are unknown. According to the proposed method, D-GLDPC codes where the check and variable component codes are random codes from an expurgated ensemble, are considered. A technique is then developed which permits to obtain the EXIT chart for the overall D-GLDPC code, by evaluating the expected EXIT function for each check and variable component code. This technique is then combined with differential evolution (DE) algorithm in order to generate some optimal D-GLDPC degree distributions. Numerical results on long, random codes, are presented which reveal how D-GLDPC codes can outperform standard LDPC codes in terms of both waterfall performance and error floor.

Analysis of Doubly-Generalized LDPC Codes with Random Component Codes for the Binary Erasure Channel

PAOLINI, ENRICO;CHIANI, MARCO
2006

Abstract

A method for the asymptotic analysis of doubly-generalized low-density parity-check (D-GLDPC) codes on the binary erasure channel (BEC) is described. The proposed method is based on extrinsic information transfer (EXIT) charts. It permits to overcome the impossibility to evaluate the EXIT function for the check or variable component codes, in situations where the information functions or split information functions for the component code are unknown. According to the proposed method, D-GLDPC codes where the check and variable component codes are random codes from an expurgated ensemble, are considered. A technique is then developed which permits to obtain the EXIT chart for the overall D-GLDPC code, by evaluating the expected EXIT function for each check and variable component code. This technique is then combined with differential evolution (DE) algorithm in order to generate some optimal D-GLDPC degree distributions. Numerical results on long, random codes, are presented which reveal how D-GLDPC codes can outperform standard LDPC codes in terms of both waterfall performance and error floor.
Proc. of the 44th Allerton Conference on Communications, Control and Computing
13
22
E. Paolini; M. Fossorier; M. Chiani
File in questo prodotto:
Eventuali allegati, non sono esposti

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11585/99148
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 10
  • ???jsp.display-item.citation.isi??? ND
social impact