摘要
现有的信道编码识别方法通常基于矩阵化简来进行识别,其容错性能较差。针对此问题,提出了一种新的RS码识别方法。首先建立了盲识别模型,利用矩阵秩函数识别RS码的二进制衍生码长,利用码根信息差熵函数识别本原多项式;在此基础上,利用码根统计完成生成多项式的识别。该方法避免了繁琐的矩阵化简方法,复杂度较低。实验结果表明,在较高误码率环境下,该识别方法能够利用较少数据完成对RS码的识别,且识别效果较好。
A blind recognition method of RS codes based on roots information dispersion entropy is proposed using codes roots static of cyclic codes. The blind recognition model is established, and integer roots distributing is statistical by searching codes length. Code length is recognized by information dispersion entropy function. With the relevant roots distributing, the integer roots static is changed to symbol roots static by searching primitive polynomials, and symbol roots of creating polynomial are obtained. Thus the creating polynomial is recognized using polynomial multiplication in Galoias field. The fussy traditional simplification of matrices is avoided. In high BER, the method can achieve recognition using fewer data and has better recognition effect.
出处
《电子信息对抗技术》
2011年第2期36-40,共5页
Electronic Information Warfare Technology
关键词
RS码
码根
信息差熵
盲识别
RS codes
code root
information dispersion entropy
blind recognition
