A Low-Complexity Decoding Algorithm for RA Code with Chebyshev Polynomial Fitting

摘要：

RA (Repeat Accumulate) code has been widely used in wireless communication systems. But the BP (Belief Propagation) decoding algorithm which is commonly used in RA Code has high complexity. In order to reduce the complexity of BP algorithm while maintaining coding performance, we proposed Chebyshev-Polynomial-Fitting based BP (CPF-BP) decoding algorithm. In CPF-BP decoding algorithm, we used polynomial which is generated by chebyshev fitting algorithm instead of hyperbolic tangent operation in BP decoding algorithm to reduce the implementation complexity. Experiment and simulation results show that this low-complexity algorithm removes hyperbolic tangent operation in conventional BP algorithm with same amount of multiplier under the parameters setting in the paper. The performance degradation of CPF-BP algorithm is negligible which is less than 0.6dB at BER of 104 compared with conventional BP algorithm.

关键词： Repeat Accumulate Code Polynomial Fitting Chebyshev BP algorithm

作者: Lei Li Qin Wang Li Xu

作者单位: School of Information Engineering University of Science and Technology Beijing Beijing,China

会议类型: 国际会议

会议名称: 2010 3rd IEEE International Conference on Computer Science and Information Technology(第三届IEEE计算机科学与信息技术国际会议 ICCSIT 2010)

会议地点: 成都

会议语种:英文

页码: 421-425

在线出版日期: 2010-07-07（万方平台首次上网日期，不代表论文的发表时间）