关键词: Turbo乘积码, Chase-Pyndiah(C-P)算法, 迭代译码, 复杂度

Abstract: Chase-Pyndiah algorithm is one of the decoding algorithms of Turbo Product Code (TPC). Based on that, an iterative decoding algorithm involved with correlation was introduced. This algorithm avoids the computation of Euclidean distance due to the use of correlation as the metric; and uses a comparative method in the choice of the concurrent codewords, which prevents the search of competition codeword. On the basis of this study, further simplification was presented, which decreased the complexity and the latency of the decoder. Both analysis and simulation result show the advantage of the proposed algorithm over conventional algorithm in speed and performance.

Key words: Turbo Product Code (TPC), Chase-Pyndiah (C-P) alogrithm, iterative decoding, complexity