二进制BCH码的一种盲识别方法  

Blind recognition method of binary BCH code

作　　者：王甲峰[1] 岳旸[1] 权友波[1] 

机构地区：[1]中国工程物理研究院电子工程研究所,四川绵阳621900

出　　处：《信息与电子工程》2011年第5期591-595,共5页information and electronic engineering

摘　　要：提出二进制BCH码的一种盲识别方法。该算法适用于本原和非本原二进制BCH码。首先,在帧长度已知的条件下,根据循环特性,给出一种分组长度的统计识别方法;然后,根据循环特性及各种约束条件得到备选多项式;再根据校正子权重和最小原则,得到最优多项式;最后通过因式分解得到生成多项式的最终估计表达式。仿真表明,本文算法具有较强的抗随机误码能力,而且其识别性能随着参加统计的码字数增多而提高。该算法不涉及矩阵运算,因此非常适合硬件实现。A blind recognition of the binary BCH code was proposed.The method was applied to both primitive and non-primitive binary BCH codes.A statistic recognition method was first proposed based on the cyclic feature under the condition of having known the frame length.And then candidate polynomials were achieved based on the cyclic feature and other restrictions.From the candidate polynomials,the best polynomial was selected according to the minimum rule of the weights sum of the syndromes.Finally,the best polynomial was factorized to get the recognition result of the generator polynomial.The simulation results show that the method possesses the capability of anti-random bit error,and the algorithm involved in this method is very simple,so it is suitable to be used in practice.

关 键 词：二进制BCH码 盲识别 分组长度 生成多项式 

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