摘要
伴随通信对抗由信号层向信息层的发展,信道编码识别已成为信息截获恢复领域一个亟需解决的问题。针对(2,1,m)卷积码盲识别问题,提出了一种基于校验统计的识别方法,该方法首先通过统计的方法求出最佳匹配的校验矩阵,进而推导出生成多项式矩阵。最后,通过MATLAB实例仿真验证了该方法能够有效识别出所有(2,1,m)卷积码,且具有很好的容错性能。
In view of the communication countermeasure development from signal to information, the recognition of channel coding is a problem that must be solved in information interception. A method is proposed based on parity-check statistics, to recognize the （2, 1, m） convolutional code. Firstly, the best parity-check matrix is achieved by statistic, and then the generator polynomial matrix is de- duced. At last, the simulation of MATLAB proves that all （2, 1, m） convolutional code could be recognized, this method has a good performance of error-resilient.
出处
《电子信息对抗技术》
2013年第1期1-4,9,共5页
Electronic Information Warfare Technology
关键词
信息截获
卷积码盲识别
校验统计
生成多项式
information interception
blind recognition of convolutional code
parity-check statistics
generator polynomial matrix
