Replica horizontal-shuffled iterative decoding of low-density parity-check codes  

作　　者：YANG Yang HUANG Jian-zhong TONG Sheng WANG Xin-mei 

机构地区：[1]State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an 710071, China [2]Department of Electrical and Computer Engineering, University of Connecticut, Storrs CT 06269, USA

出　　处：《The Journal of China Universities of Posts and Telecommunications》2010年第6期32-40,共9页中国邮电高校学报（英文版）

摘　　要：For practical considerations,it is essential to accelerate the convergence speed of the decoding algorithm used in an iterative decoding system. In this paper,replica versions of horizontal-shuffled decoding algorithms for low-density parity-check （LDPC） codes are proposed to improve the convergence speed of the original versions. The extrinsic information transfer （EXIT） chart technique is extended to the proposed algorithms to predict their convergence behavior. Both EXIT chart analysis and numerical results show that replica plain horizontal-shuffled （RPHS） decoding converges much faster than both plain horizontal-shuffled （PHS） decoding and the standard belief-propagation （BP） decoding. Furthermore,it is also revealed that replica group horizontal-shuffled （RGHS） decoding can increase the parallelism of RPHS decoding as well as preserve its high convergence speed if an equivalence condition is satisfied,and is thus suitable for hardware implementation.For practical considerations,it is essential to accelerate the convergence speed of the decoding algorithm used in an iterative decoding system. In this paper,replica versions of horizontal-shuffled decoding algorithms for low-density parity-check （LDPC） codes are proposed to improve the convergence speed of the original versions. The extrinsic information transfer （EXIT） chart technique is extended to the proposed algorithms to predict their convergence behavior. Both EXIT chart analysis and numerical results show that replica plain horizontal-shuffled （RPHS） decoding converges much faster than both plain horizontal-shuffled （PHS） decoding and the standard belief-propagation （BP） decoding. Furthermore,it is also revealed that replica group horizontal-shuffled （RGHS） decoding can increase the parallelism of RPHS decoding as well as preserve its high convergence speed if an equivalence condition is satisfied,and is thus suitable for hardware implementation.

关 键 词：REPLICA shuffled decoding LDPC codes EXIT chart convergence speed 

分 类 号：TN911.22[电子电信—通信与信息系统] TP183[电子电信—信息与通信工程]