一种改进RA译码算法.pdfVIP

第33 卷第11 期 电 子 与 信 息 学 报 Vol.33No.11 2011 年11 月 Journal of Electronics Information Technology Nov. 2011 一种改进的RA 译码算法 张敬毅* 金明录 (大连理工大学电子信息与电气工程学部 大连 116024) 摘 要：重复累积(RA)码译码使用置信传播(BP)算法，具有接近香农限的性能，但校验节点更新时使用复杂的双 曲正切函数和反双曲正切函数，算法复杂度较高。为了降低译码算法的复杂度，且具有较好的性能，该文将查表法 和分段函数近似法结合起来，提出了一种改进的译码算法。该算法采用分段的一次函数，去近似BP 算法检验节点 变换化简后的原函数，采用非常小的查找表得到一个校正值，用校正值去修正近似函数和变换化简后的原函数之间 的误差，很好地避免了复杂函数的计算，且误差极小。该算法大大降低了译码算法的复杂度，且具有接近BP 算法 的译码性能。 关键词：重复累积码；置信传播算法；最小和算法；查找表；分段近似函数 中图分类号：TN911.22 文献标识码： A 文章编号：1009-5896(2011)11-2616-07 DOI: 10.3724/SP.J.1146.2011.00324 An Improved Decoding Algorithm of Repeat Accumulate (RA) Codes Zhang Jing-yi Jin Ming-lu (Faculty of Electronics and Electrical Engineering, Dalian University of Technology, Dalian 116024, China) Abstract: Belief Propagation (BP) decoding algorithm of Repeat Accumulate (RA) code approaches Shannon limit, but it possesses high complexity because of the use of the complex hyperbolic tangent function and the inverse hyperbolic tangent function at check nodes updating. In order to reduce the complexity with little performance sacrifice, combining the two methods lookup tables and piecewise approximation function, a modified decoding algorithm is proposed in this paper. The algorithm uses piecewise function to approximate the original function, which is obtained by transform and simplify the check node updating of BP algorithm, and use a very small lookup table to get a correction to correct error between the original function and approximate function. It can avoid the complex calculations, and get the minimal error. The algorithm greatly reduces the decoding complexity, and has a performanc