Belief-Propagation-Approximated Decoding of Low-Density Parity-Check Codes  

作　　者：SONGHui-shi ZHANGPing 

机构地区：[1]School of Telecommunication Engineering,Beijing University of Posts and Telecommunications.Beijing100876,P.R.China

出　　处：《The Journal of China Universities of Posts and Telecommunications》2004年第1期24-28,共5页中国邮电高校学报（英文版）

基　　金：ThisworkissupportedbytheNationalHighTechnologyResearchandDevelopmentProgram"863"ofChina (No.2 0 0 1AA1 2 30 1 6) ;andbytheBeijingSAMSUNGTelecomR&DCenter.

摘　　要：In this paper, we propose a new reduced-complexity decoding algorithm of Low-Density Parity-Check (LDPC) codes, called Belief-Propagation-Approximated (BPA) algorithm, which utilizes the idea of normalization and translates approximately the intricate nonlinear operation in the check nodes of the original BP algorithm to only one operation of looking up the table. The normalization factors can be obtained by simulation, or theoretically. Simulation results demonstrate that BPA algorithm exhibits fairly satisfactory bit error performance on the Additive White Gaussian Noise (AWGN) channel.

关 键 词：LDPC codes BPA algorithm NORMALIZATION 

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