更正三個錯位元的BCH碼之快速解碼器

　　　　　首先，本文證明了當m為奇數時，碼長為n=2??-1 之更正三個錯位元的本質二元 BCH 碼是由三個碼長相同（ n=2 ?? -1 ）之漢明碼（ Hamming code ）所組成。 其次，利 用此特性及估測徵狀的技術， 本文提出簡易、快速而且適用於碼長很大時的 BCH 碼之解碼 演算法。依據提出的解碼演算法，本文利用五個 2 ?鶠? m 位元的唯讀記憶體及一些簡單的 邏輯閘設計出電路簡單之解碼器。經比較分析，本文設計的解碼器較其他解碼器快且電路簡 單。
　　　　　A triple-error-correcting primitive binary BCH codes with odd m is proved as the intersection of three Hamming codes of the same code length (n=2 ?? -1) in this paper. With this property and syndrome estimation technique, we propose a simple and fast BCH code decoding algorithm, which is suitable for long code length. According to this decoding algorithm, we designed a decoder by using five ROMs and some logic gates. Compare with conventional decoders, our decoder is simpler in complexity and the decoding speed is faster than the others.