Layered Dynamic Schedulings for BP Decoding of LDPC Codes over GF（q）  

作　　者：HAN Guojun LIU Xingcheng GONG Yi 

机构地区：[1]School of Information and Engineering, Guangdong University of Technology, Guangzhou 510006, China [2]Department of Electronic and Communications Engineering, Sun Yat-sen University, Guangzhou 510275, China [3]School of Mathematics and Computational Science, Sun Yat-sen University, Guangzhou 510275, China

出　　处：《Chinese Journal of Electronics》2013年第3期609-614,共6页电子学报（英文版）

基　　金：This work is supported by the National Natural Science Foundation of China （No.61172076, No.61102070, No.60970041, No.61173018）, the Science and Technology Plan of Guangzhou City of China （No.2012J4300032）.

摘　　要：A Layered dynamic scheduling （LDS） for Belief-propagation （BP） decoding of LDPC codes over GF（q） is presented, which is derived from the dynamic scheduling for the BP decoding of binary LDPC codes. In order to restrain the LDS from cycling in certain checknodes, a life-index for each check-node is adopted and the optimal value of the life-index is analyzed. Furthermore, in consideration of hardware implementation and decoding latency, a strategy, which allows many more checknodes to be updated in parallel, is introduced. Simulations show that the LDS with life-index speeds up the convergence rate and greatly improves the performance of the BP decoding at medium to high signal-to-noise ratio value, and the algorithm employing the LDS with life-index and the new strategy offers good trade-off between the performance and the decoding latency.

关 键 词：Belief-propagation （BP） Dynamic scheduling Low-density parity-check （LDPC） codes Nonbinary Residual. 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论] TN911.22[自动化与计算机技术—计算机科学与技术]