文章基本信息

标题：A REDUCED-COMPLEXITY LDPC DECODING ALGORITHM WITH CHEBYSHEV POLYNOMIAL FITTING
本地全文：下载
作者：SHAOBO SHI ; YUE QI ; LEI LI 等
期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2013
卷号：49
期号：3
出版社：Journal of Theoretical and Applied
摘要：BP decoding algorithm is a high-performance low-density parity-check (LDPC) code decoding algorithm, but because of its high complexity, it can�t be applied to the high-speed communications systems. So in order to further reduce the implementation complexity with the minimum affection to the system performance, , we proposed a BP algorithm based on Chebyshev polynomial fitting for its good approximation performance in this paper. This method can transform the complicated exponential function into polynomial with the error at level in the process of decoding , which can reduce the consumption of memory resources considerably. At the same time, a Chebyshev unit is proposed in the process of implementation with less multiplier; we implemented a semi-parallel LDPC decoder with this method on Altera CycloneII FPGA. The simulation results show that the degradation of this method is only 0.4dB compared with conventional BP algorithm.
关键词：low-density parity-check (LDPC) code;BP algorithm;Chebyshev Polynomial Fitting