基于码根信息差熵和码根统计的BCH码识别方法

Recognition Method of BCH Codes Based on Roots Information Dispersion Entropy and Roots Statistic

现有的信道编码识别方法通常是基于矩阵化简来进行识别,其容错性能较差,提出了基于码根信息差熵和码根统计的BCH(本原循环)码的识别方法,该方法先利用码根信息差熵函数识别BCH码的码长,进而利用码根统计获取生成多项式的整数根,通过遍历该域中的本原多项式以寻求满足BCH码生成多项式根性质的码根和本原多项式,从而实现BCH码的盲识别。理论分析及仿真实验表明:在较高误码率的影响下,码根信息差熵和码根统计对二进制本原BCH码进行识别,效果较好。

Recent recognition methods of channel coding are based on the simplification of matrices,and their error-resilient capabilities are not ideal.A recognition method based on roots information dispersion and roots statistic was proposed in this paper,the code length was recognized by using roots information dispersion entropy function,then integral roots of the creating polynomial were gained by roots statistic,the symbolic roots which satisfied the characters of BCH codes creating polynomial roots were found by searching the primitive polynomials in finite fields.Under the case of high BER,both theoretical analysis and simulation experiment showed high performance of the roots information dispersion entropy and roots statistic recognition method.