Ensemble Enumerators for Protograph-Based Generalized LDPC Codes

• Main Authors: Abu-Surra, S., Ryan, W.E., Divsalar, D.
• Format: Conference Proceeding
• Language: English
• Subjects: Concatenated codes; Error probability; H infinity control; Laboratories; Maximum likelihood decoding; Maximum likelihood estimation; NASA; Parity check codes; Propulsion; Space technology
• ISSN: 1930-529X; 2576-764X
• DOI: 10.1109/GLOCOM.2007.287

Protograph-based LDPC codes have the advantages of a simple design (or search) procedure and highly structured encoders and decoders. These advantages have also been exploited in the design of protograph-based generalized LDPC (G-LDPC) codes. Recently, a technique for computing ensemble weight enumerators and stopping set enumerators for protograph-based LDPC codes has been published. In the current paper, we extend those results to protograph-based G-LDPC codes. That is, we first derive ensemble weight and stopping set enumerators for finite-length G-LDPC codes based on protographs, and then we consider the asymptotic case. In the weight enumerator case, the asymptotic results allow us to determine whether or not the typical minimum distance in the ensemble grows linearly with codeword length. In the stopping set enumerator case, the asymptotic results allows us to determine whether or not the typical smallest stopping set size grows linearly with codeword length.