Generalized and doubly generalized LDPC codes with random component codes for the binary erasure channel

In this paper, a method for the asymptotic analysis of generalized low-density parity-check (GLDPC) codes and doubly generalized low-density parity-check (D-GLDPC) codes over the binary erasure channel (BEC), based on extrinsic information transfer (EXIT) chart, is described. This method overcomes the problem consisting of 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 component codes are unknown. According to the proposed technique, GLDPC codes and D-GLDPC codes where the generalized check and variable component codes are random codes with minimum distance at least 2, are considered. A technique is then developed which finds the EXIT chart for the overall GLDPC or D-GLDPC code, by evaluating the expected EXIT function for each check and variable component code. This technique is finally combined with the differential evolution algorithm in order to generate some...

• Type: Journal
• Year: 2010
• Where: TIT
• Authors: Enrico Paolini, Marc P. C. Fossorier, Marco Chiani
• Keywords: D-gldpc Codes, Education, Random Codes, TIT 2010, Variable Component Code