Improvements for decoding algorithm of turbo product code

On the basis of Lu´s syndrome-based decoding algorithm, we propose an improved decoding algorithm for turbo product code, which has lower complexity and latency. On one hand, the proposed algorithm further reduces the computational complexity and the decoding latency by simplifying the calculation of syndrome and selecting a proper number of least reliable bits. On the other hand, this algorithm obtains extra coding gain by using a stricter judgment condition. Finally, we apply our algorithm to the parallel decoding structure. Simulation results demonstrate that the proposed algorithm can reduce the complexity and latency effectively at the cost of less than 0.1dB BER performance degradation, so it is very suitable for these delay-sensitive applications.