基于概率逼近的本原BCH码编码参数的盲识别方法  

Blind Identification of Primitive BCH Codes Parameters Based on Probability Approximation

作　　者：阔永红[1] 曾伟涛[1] 陈健[1] 

机构地区：[1]西安电子科技大学通信工程学院,西安710071

出　　处：《电子与信息学报》2014年第2期332-339,共8页Journal of Electronics & Information Technology

基　　金：国家自然科学基金(60972072);高等学校学科创新引智计划(B08038)资助课题

摘　　要：针对本原BCH码编码参数的盲识别问题,该文提出了一种基于概率逼近的盲识别方法。首先,利用Gauss分布和Poisson分布逼近随机码字的根概率特性,确定了搜索BCH码长的门限;然后,通过分析本原域元素的检错能力及同构对域的影响,应用临近域对的方法确定编码域,提高了其识别能力;最后,给出识别生成多项式时的共轭根系表,从而减少了计算量。仿真结果表明,在较高的误码率下,该方法能快速地识别出BCH码编码所采用的编码参数。To solve the issues of blind identification of primitive BCH codes encoding parameters, a novel identification algorithm with probability approximation is presented. Frist, by taking advantage of the approximation of random code words’ root probability character which uses Gaussian distribution and Poisson distribution, the thresholds for searching code length are structured. Second, though analyzing the checking ability of the primitive element and the impact of isomorphism on searching, the coding filed is determined by using the method of nearby fields pair which improves the performace of identification. Finally, the calculation is reduced by creating and using the conjugate roots table in the recognition of generator polynomial. Simulation results show that, the proposed algorithm achieves a significant improvement in identification probability even if in high BER situation.

关 键 词：信道编码 BCH码 共轭根系 盲识别 

分 类 号：TP391[自动化与计算机技术—计算机应用技术] TN911.22[自动化与计算机技术—计算机科学与技术]