一种基于LDPC码译码的改进型最小和译码算法及仿真  

A Novel Modified MS Algorithm Based on LDPC Code Decoder

作　　者：焦冬莉[1] 谭艳丽[1] 赵永强[1] 薄晓宁 

机构地区：[1]太原工业学院电子工程系,山西太原030008

出　　处：《山西电子技术》2017年第1期22-25,共4页Shanxi Electronic Technology

摘　　要：基于LDPC码译码原理提出了一种新的高效的最小和译码算法。对基于双曲正切规则的校验节点更新过程中的两个方向的处理进行了简化。出于减少水平处理过程中近似误差的考虑,新算法降低了复杂度。垂直方向的部分与和积译码算法相同,另一部分采用MS算法简化了计算。与严格的逼近方法相比,该方法具有计算复杂度低的优点。仿真结果表明,新提出的算法可以非常接近传统译码算法的性能。A novel efficient Min-sum （MS） algorithm with LPDC code is hyperbolic tangent rule, the check node update with two horizontal processes proposed in this paper. Basing on the is modified with similar calculation. The proposed algorithm reduces the complexity, which is motivated by reducing the approximation error in the hori- zontal process. One part of the vertical process is the same with sum-product algorithm （ SPA）, and the other part adopts MS algorithm and simplifies the calculation. Compared with the exiting approximations, the proposed method has low computational complexity than SP algorithm. The simulation results show that the performance of this algorithm is very close to the general algorithm.

关 键 词：计算复杂度 MS算法 仿真 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]