Title :
Ensemble Pseudocodeword Weight Enumerators for Protograph-Based Generalized LDPC Codes
Author :
Abu-Surra, Shadi ; Divsalar, Dariush ; Ryan, William E.
Author_Institution :
Univ. of Arizona, Tucson, AZ, USA
Abstract :
Recently, pseudocodewords of Tanner graphs of LDPC codes have been used to explain the behavior of iterative decoders for these codes. In this paper, finite-length pseudocodeword weight enumerators for protograph-based generalized-LDPC code ensembles are obtained. Then asymptotic results are derived from the finite-length results by letting the block length go to infinity. The asymptotic results allow us to determine whether or not the typical minimum pseudocodeword weight grows linearly with codeword length. We give examples with Hamming component codes.
Keywords :
Hamming codes; graph theory; parity check codes; Hamming component codes; Tanner graphs; William finite-length pseudocode- word weight enumerators; protograph-based generalized LDPC Codes; AWGN; Convergence; H infinity control; Iterative decoding; Laboratories; NASA; Parity check codes; Peer to peer computing; Propulsion; Space technology;
Conference_Titel :
Global Telecommunications Conference, 2009. GLOBECOM 2009. IEEE
Conference_Location :
Honolulu, HI
Print_ISBN :
978-1-4244-4148-8
DOI :
10.1109/GLOCOM.2009.5425250
