A Euclidean Geometry Based Algebraic Construction Technique for Girth-8 Gallager LDPC Codes
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.
Mark F.Flanagan John Craddock Colm P.Fewer Stephen J.Redmond
Dept.of Electronic and Electrical Engineering University College Dublin
国际会议
2006年IEEE信息理论国际会议(Proceedings of 2006 IEEE Information Theory Workshop ITW06)
成都
英文
76-80
2006-10-22（万方平台首次上网日期，不代表论文的发表时间）