Open AccessEfficient Chase‐2 decoding algorithm for linear block codes
Author(s) -
Lee HuangChang,
Chen YuCheng
Publication year - 2019
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2019.1506
Subject(s) - decoding methods , algorithm , hamming distance , block code , berlekamp–welch algorithm , hamming code , block (permutation group theory) , list decoding , computer science , chase , sequential decoding , selection algorithm , mathematics , noise (video) , encoding (memory) , selection (genetic algorithm) , concatenated error correction code , combinatorics , artificial intelligence , database , image (mathematics)
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.