Parallel decoding of interleaved single parity check turbo product codes

In this paper, both complexity and performance aspects of serially concatenated 2-D single parity check turbo product codes are investigated. The extremely simple Max-Log-MAP decoding is alternatively derived with only three additions needed to compute each bit´s extrinsic information. Parallel decoding structure is proposed to increase the decoding throughput while a new helical interleaver is constructed to further improve the coding gain. For performance evaluation, (16, 14, 2)² single parity check turbo product codes with code rate 0.766 over an AWGN channel using QPSK are considered. The simulation results using Max-Log-MAP decoding show that it can achieve BER of 10^-5 at SNR of 3.8 dB with 8 iterations. Compared to the same rate and codeword length turbo product code composed of extended Hamming codes, the considered scheme can achieve similar performance with much less complexity. Other implementation issues such as the finite precision analysis and efficient sorting circuit design are also presented.