基于查找表的BCH码快速译码算法  

A fast decoding algorithm for BCH codes based on lookup table

作　　者：孔挺[1,2] 宫芳[1] 方扬扬 

机构地区：[1]哈尔滨工程大学信息与通信工程学院,哈尔滨150001 [2]海军飞行学院教研部,辽宁葫芦岛125001

出　　处：《哈尔滨商业大学学报（自然科学版）》2011年第6期819-823,共5页Journal of Harbin University of Commerce：Natural Sciences Edition

摘　　要：针对二进制BCH码的传统查找表译码算法占用很大内存空间的问题,提出了一种减少占用内存的快速查找表译码算法.对于(31,21,5)BCH码,该算法在查找表中仅存储信息位发生1到2位错误时的错误图样和对应的伴随式,结合接收码字伴随式的汉明重量进行译码,可比传统的查找表译码算法节省了约50%的存储资源.对(31,21,5)BCH码的仿真实验表明,该算法可以有效纠正码字内发生的2个以内任意错误,而且译码速度比传统查找表译码算法提高约28%.Based on the problem that the traditional lookup table decoding method for binary BCH code needs much memory,this paper proposed an improved fast lookup table decoding algorithm to reduce the memory cost.For（31,21,5） BCH code,the proposed algorithm only contains the error patterns and the corresponding syndrome patterns which have one or two errors occur in the message block,and used the hamming weight of the syndrome of the received codeword to decode.It could save nearly 50% memory cost comparing with the traditional lookup table method,and the simulation result showed that the proposed algorithm can correct the errors efficiently with the decoding speed improving nearly 28%.

关 键 词：BCH码 查找表 伴随式 汉明重量 

分 类 号：TN911[电子电信—通信与信息系统]