DocumentCode
2516815
Title
Ensemble weight enumerators for protograph-based doubly generalized LDPC codes
Author
Wang, Yige ; Wang, Chung-Li ; Fossorier, M.
Author_Institution
Dept. of Electr. Eng., Univ. of Hawaii at Manoa, Honolulu, HI
fYear
2008
fDate
6-11 July 2008
Firstpage
1168
Lastpage
1172
Abstract
Protograph-based doubly generalized LDPC (DGLDPC) codes are explored in this paper. We extend (and in the process simplify) the technique for computing the ensemble weight enumerators of protograph-based LDPC and GLDPC codes to DGLDPC codes. We find that with careful design, protograph-based DGLDPC codes can have a better asymptotic growth rate of minimum distance than that of the protograph-based LDPC and GLDPC codes. Simulation results confirm that protograph-based DGLDPC codes have a low error floor.
Keywords
parity check codes; asymptotic growth rate; ensemble weight enumerators; low error floor; protograph-based doubly generalized LDPC codes; Computational modeling; H infinity control; Parity check codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2008. ISIT 2008. IEEE International Symposium on
Conference_Location
Toronto, ON
Print_ISBN
978-1-4244-2256-2
Electronic_ISBN
978-1-4244-2257-9
Type
conf
DOI
10.1109/ISIT.2008.4595171
Filename
4595171
Link To Document