Efficient Chase-2 decoding algorithm for linear block codes

All test patterns are decoded in the conventional Chase-2 algorithm, but only a few candidate codewords are derived. In this work, a highly efficient Chase-2 decoding algorithm has been proposed, where only the test patterns that can be decoded into distinct candidate codewords are processed. It means that the total number of decoding attempts is reduced from that of the test patterns to that of the candidate codewords, which consequently reduces the complexity, especially in high signal-to-noise ratio (SNR) region. The criterion of the test pattern selection is based on the property of minimum Hamming distance, it can be expected that the proposed algorithm can be applied to all linear block codes without performance degradation compared to the conventional Chase-2 algorithm.