Relative-Residual-Based Dynamic Schedule for Belief Propagation Decoding of LDPC Codes  

基于相对残余度的LDPC码置信传播译码调度算法(英文)

作　　者：黄捷 张立军 

机构地区：[1]School of Electronics and Information Engineering,Beijing Jiaotong University

出　　处：《China Communications》2011年第5期47-53,共7页中国通信（英文版）

基　　金：supported by the Fundamental Research Funds for the Central Universities

摘　　要：Two Relative-Residual-based Dynamic Schedules(RRDS) for Belief Propagation(BP) decoding of Low-Density Parity-Check(LDPC) codes are proposed,in which the Variable code-RRDS(VN-RRDS) is a greediness-reduced version of the Check code-RRDS(CN-RRDS).The RRDS only processes the variable(or check) node,which has the maximum relative residual among all the variable(or check) nodes in each decoding iteration,thus keeping less greediness and decreased complexity in comparison with the edge-based Variable-to-Check Residual Belief Propagation(VC-RBP) algorithm.Moreover,VN-RRDS propagates first the message which has the largest residual based on all check equations.For different types of LDPC codes,simulation results show that the convergence rate of RRDS is higher than that of VC-RBP while keeping very low computational complexity.Furthermore,VN-RRDS achieves faster convergence as well as better performance than CN-RRDS.Two Relative-Residual-based Dynamic Schedules (RRDS) for Belief Propagation (BP) decoding of Low-Density Parity-Check (LDPC) codes are proposed, in which the Variable code-RRDS (VN-RRDS) is a greediness-reduced version of the Check code-RRDS (CN-RRDS). The RRDS only processes the variable (or check) node, which has the maximum relative residual among all the variable (or check) nodes in each decoding iteration, thus keeping less greediness and decreased complexity in comparison with the edge-based Variable-to-Check Residual Belief Propagation (VC-RBP) algorithm. Moreover, VN-RRDS propagates first the message which has the largest residual based on all check e-quations. For different types of LDPC codes, simulation results show that the convergence rate of RRDS is higher than that of VC-RBP while keeping very low computational complexity. Furthermore, VN-RRDS achieves faster convergence as well as better performance than CN-RRDS.

关 键 词：LDPC codes dynamic schedule relative-residual greediness BP 

分 类 号：TN911.2[电子电信—通信与信息系统]