Reduced complexity Chase-Pyndiah decoding algorithm for turbo product codes

Turbo product codes (TPC) are very suitable for applications requiring a large code length, a high code-rate, and good error performance. In the Chase decoding algorithm, normally a few least reliable positions are selected and the test sequences are generated from these positions. This paper proposes two methods to lower the complexity of the Chase-Pyndiah decoding algorithm. The first scheme reduces the number of least reliable positions by excluding those having relatively low error probabilities. The other one minimizes computations on unnecessary positions in an algebraic decoder. With these methods, we can significantly reduce the number of test sequences and lower the number of utilized positions for constructing an extended candidate codeword set. We show the simulation results with a squared (64, 57, 4) extended Hamming code-based TPC.

[1]  Jing Li,et al.  On the performance of high-rate TPC/SPC codes and LDPC codes over partial response channels , 2002, IEEE Trans. Commun..

[2]  Ramesh Pyndiah,et al.  Near-optimum decoding of product codes: block turbo codes , 1998, IEEE Trans. Commun..

[3]  Wei Liu,et al.  Low-Power High-Throughput BCH Error Correction VLSI Design for Multi-Level Cell NAND Flash Memories , 2006, 2006 IEEE Workshop on Signal Processing Systems Design and Implementation.

[4]  Kang Wang,et al.  Adaptive SNR estimation based decoding algorithm for block turbo codes , 2009, 2009 Fourth International Conference on Communications and Networking in China.

[5]  Ying-Chang Liang,et al.  MAP Decoding Algorithm for Extended Turbo Product Codes over Flat Fading Channel , 2006, 2006 Fortieth Asilomar Conference on Signals, Systems and Computers.

[6]  Xia Zhang,et al.  Overlapped Time Division Multiplexing System Using Turbo Product Code , 2010, 2010 6th International Conference on Wireless Communications Networking and Mobile Computing (WiCOM).

[7]  Alain Glavieux,et al.  Reflections on the Prize Paper : "Near optimum error-correcting coding and decoding: turbo codes" , 1998 .

[8]  Steven W. McLaughlin,et al.  A parallel decoder for low latency decoding of turbo product codes , 2002, IEEE Communications Letters.

[9]  David Chase,et al.  Class of algorithms for decoding block codes with channel measurement information , 1972, IEEE Trans. Inf. Theory.

[10]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[11]  Guido Torelli,et al.  On-chip error correcting techniques for new-generation flash memories , 2003, Proc. IEEE.

[12]  Peter Elias,et al.  Error-free Coding , 1954, Trans. IRE Prof. Group Inf. Theory.