二进制本原BCH码的参数盲识别  

Blind recognition of binary primitive BCH codes parameters

作　　者：王兰勋[1] 李丹芳[1] 汪洋[1] 

机构地区：[1]河北大学电子信息工程学院,河北保定071002

出　　处：《河北大学学报（自然科学版）》2012年第4期416-420,428,共6页Journal of Hebei University(Natural Science Edition)

基　　金：河北省自然科学基金资助项目(F2009000224)

摘　　要：针对BCH码的盲识别问题,提出一种基于欧几里德算法的最大公因式的识别方法.首先,根据循环移位码字求取最大公因式,得到最大公因式的系数矩阵.然后,分析最大公因式的次数分布规律确定码长,由系数矩阵求出生成多项式.该识别方法简单易行,无繁杂的矩阵运算.理论分析及仿真实验表明,无误码时使用较小的数据量就可有效识别;误码率为10-2,数据量足够时,识别效果仍然较好.A recognition method based on Euclidean algorithm is proposed to solve the problem of the blind recognition of BCH code. First, according to the cycle shifting code, a greatest common factor is achieved and many common factors constitute a coefficient matrix. Moreover, the times distribution of the greatest common factors were analyzed and the code length was obtained and polynomial generated by coefficient matrix. The recognition method is simple, and the fussy calculation of matrices is avoided. Both theoretical analysis and simulation results show that using fewer data can recognize effectively in no error and the recognition has better performance in BER.

关 键 词：BCH码 欧几里德算法 最大公因式 盲识别 

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