基于遗传算法的（2,1,m）卷积码盲识别

摘要

电子对抗正逐步由信号层向信息层发展,信道编码的识别成为信息截获领域一个重要的课题。针对（2,1,m）卷积码盲识别问题,提出了一种基于遗传算法的识别方法,该方法具有很好的容错性能和快速识别能力。最后,通过MATLAB仿真验证了该方法能够识别出卷积码的校验多项式,进而求得生成多项式。%The electronic warfare (EW) is developing from signal to information, channel coding recognition becomes a vital problem in information interception. One method of recognition is pro- posed based on genetic algorithm in order to recognize the (2, 1, m ) convolutional coding. This method has the good performance of error-resilient and the ability of efficient recognition. At last, the simulation by Matlab proves that the parity-check polynomial could be recognized, and the generator polynomial could be calculated with the parity-check polynomial by this method.