DocumentCode :
1829401
Title :
A Euclidean Geometry Based Algebraic Construction Technique for Girth-8 Gallager LDPC Codes
Author :
Flanagan, Mark F. ; Craddock, John ; Fewer, Colm P. ; Redmond, Stephen J.
Author_Institution :
Dept. of Electron. & Electr. Eng., Univ. Coll. Dublin
fYear :
2006
fDate :
22-26 Oct. 2006
Firstpage :
76
Lastpage :
80
Abstract :
A construction technique is proposed for low-density parity-check (LDPC) codes based on finite Euclidean geometries EG(m,2s). These codes are shown to be regular Gallager codes with Tanner graphs of girth eight. The minimum distance of these codes is shown to be lower-bounded by 2m. The codes are also amenable to an efficient partly parallel decoder implementation, which may be used in conjunction with the turbo decoding message passing (TDMP) algorithm for LDPC decoding. Finally, simulation results show that these codes have very good error-correcting performance
Keywords :
algebraic geometric codes; decoding; error correction codes; graph theory; parity check codes; turbo codes; Euclidean geometry; Girth-8 Gallager LDPC codes; Tanner graphs; algebraic construction technique; error-correcting performance; low-density parity-check codes; partly parallel decoder; turbo decoding message passing; AWGN channels; Block codes; Conferences; Decoding; Educational institutions; Information geometry; Information theory; Message passing; Parity check codes; Sparse matrices;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Workshop, 2006. ITW '06 Chengdu. IEEE
Conference_Location :
Chengdu
Print_ISBN :
1-4244-0067-8
Electronic_ISBN :
1-4244-0068-6
Type :
conf
DOI :
10.1109/ITW2.2006.323760
Filename :
4119258
Link To Document :
بازگشت