Good error-correcting codes based on very sparse matrices
IEEE Transactions on Information Theory
Hi-index | 0.00 |
This paper proposes the simplified sum-product (SSP) decoding algorithm to improve BER performance for low-density parity-check codes (LDPC). The sum-product algorithm achieves the highest BER performance among the LDPC decoding algorithms. However, based on the hyperbolic tangent and inverse hyperbolic tangent functions for the check node updates, the sum-product (SP) algorithm requires high computational complexity. To reduce computational complexity, the proposed SSP algorithm adopts a piecewise linear approximation, the logarithmic and exponential functions, which can replace multiplications and divisions with additions and subtractions. In addition, the proposed SSP algorithm can simplify both the ln[tanh(x)] and tanh-1[exp(x)] by using two quantization tables which can reduce tremendous computational complexity. Simulation results show that the proposed SSP algorithm can improve about 0.8 dB of bit error ratio (BER) performance compared with the modified sum-product algorithm.