An Efficient Decoder for Turbo Product Codes with Multi-Error Correcting Codes

Abstract

In this paper, Chase decoding algorithm for turbo product codes (TPCs) built with multi-error-correcting codes is investigated. A method is proposed to reduce the decoding of test patterns (TPs) as well as the calculation of syndromes and metrics. In the beginning, syndromes and metrics of the first half of TPs are calculated recursively. After decoding of one TP, according to the error bit positions, other TPs that will have the same decoded codeword are identified and rejected from decoding. In the mean time, if these TPs fall into the range of second half of TPs, their syndromes and metrics need not to be calculated either. Simulations results for TPCs built with eBCH(64,51,6,2) or eBCH(64,45,8,3) are presented to demonstrate the efficiency of the proposed method. Moreover, this method that reduces the inherent redundancy in Chase decoding does not cause any degradation in coding gain.