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 mea...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Electronics letters Jg. 55; H. 17; S. 936 - 938
Hauptverfasser: Lee, Huang-Chang, Chen, Yu-Cheng
Format: Journal Article
Sprache:Englisch
Veröffentlicht: The Institution of Engineering and Technology 22.08.2019
Schlagworte:
block codes
candidate codewords
Chase‐2 decoding algorithm
decoding
Hamming codes
Information and communications
linear block codes
linear codes
test pattern selection
test pattern selection
linear codes
block codes
Chase-2 decoding algorithm
Hamming codes
linear block codes
candidate codewords
decoding
ISSN:0013-5194, 1350-911X, 1350-911X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:Huang‐Chang Lee and Yu‐Cheng Chen: Also with Department of Neurological Surgery, Chang Gung Memorial Hospital, Taoyuan, Taiwan.
ISSN:0013-5194
1350-911X
1350-911X
DOI:10.1049/el.2019.1506