A Novel LLR-BP Algorithm for LDPC Codes Based on Taylor Series and Least Squares
An effective log-likelihood-ratio-based belief propagation (LLR-BP) algorithm is proposed. It can reduce computational complexity of decoding algorithm for Low Density Parity Check (LDPC) codes. By using the Taylor series and least squares, high order multiplication based on the hyperbolic tangent (tanh) rule is converted to a first-order multiplication and addition after simplification. Moreover, all the logarithmic and exponential operations disappear without significant loss of the decoding performance. The simulation results show that the performance of the proposed scheme is similar to the general LLR-BP. In particular, we show that the modified algorithm with low complexity can achieve better BER than the other decoding algorithm in high signal-to-noise ratio region.