一种扩展部分BCH码纠错能力的方法

Method of extending error-correcting capability of some BCH codes

提出一种简单的查表译码算法以扩展某些BCH码的纠错能力.首先搜索出BCH(n,k,t)码能够纠正的码重为t+1的错误图样,再将这些错误图样与码重小于t+1的错误图样放在一起,根据它们对应的伴随式大小进行排序,优化存储于硬件设备中,从而进行查表法译码.仿真表明:对于BCH码,采用这种译码方法,在相同的码长和信息比特数的条件下,能够比一般的BCH译码方法纠正更多错误,而且译码电路相对简单,译码速度快.这种提高纠错能力的译码方法对所有的二进制线性循环码都是适用的.

A simple decoding algorithm to improve the error-correcting capability of some BCH codes by searching the relation tables is presented. It is found out that all the error patterns whose weights are equal to t + 1 and that BCH (n, k, t) codes can correct. Then these error patterns and those whose weights are less than t + 1 are ordered according to their corresponding syndrome values. The ordered error patterns are optimized to be stored in hardware devices so that decoding can be realized by searching the relation tables. The simulation results show that when the code bits and information bits are the same, this decoding method can correct more error bits than usual decoding methods. The decoding circuits are comparatively simpler and the decoding speeds are faster. This decoding method of improving the error-correcting capability is applicable to all binary linear cyclic codes.