A Belief Propagation Algorithm with Set-Breaking to Lower Error-Floors of Low-Density Parity-Check Codes  

作　　者：MA Kexiang LIYongzhao ZHANG Hailin ZHU Caizhi ZHANG Yuming 

机构地区：[1]State Key Laboratory of ISN, Xidian University, Xi'an 710071, China

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

基　　金：This work is supported in part by the National Natural Science Foundation of China （No.61072069）, Fundamental Research Funds for the Central Universities （No.72001859）, Important Nationa Science and Technology Specific Projects （No.2011ZX03003-001-04 and No.2012ZX03003012-003）, Special Project for State Key Laboratory of ISN （No.ISN120201）, State Key Laboratory of Integrated Services Network （No.ISN090105）, and the 111 Project （No.B08038）.

摘　　要：In order to more exactly describe the errorfloor phenomenon in the iterative decoding of Low-density parity-check （LDPC） codes, a modified concept of the stable trapping set is introduced. Based on this new concept, an improved belief propagation algorithm with setbreaking mechanism is proposed to lower the error-floors of LDPC codes. Message ranking of the bit nodes in the stable trapping sets will be greatly lowered than that of other bit nodes in the iterative decoding process. By using this characteristic to label the bit nodes in the set, the corresponding initial log likelihood ratios will be flipped to break the stable trapping set and restart to decode. Simulation results verify the validity of the proposed algorithm.

关 键 词：Low-density parity-check （LDPC） Trapping set Set-breaking Error floor. 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程] TN911.22[自动化与计算机技术—控制科学与工程]