首页 | 本学科首页   官方微博 | 高级检索  
     

基于遗传算法的(2,1,m)卷积码盲识别
引用本文:刘建成,杨晓静. 基于遗传算法的(2,1,m)卷积码盲识别[J]. 电子信息对抗技术, 2012, 27(5): 6-10
作者姓名:刘建成  杨晓静
作者单位:电子工程学院,合肥,230037
摘    要:电子对抗正逐步由信号层向信息层发展,信道编码的识别成为信息截获领域一个重要的课题。针对(2,1,m)卷积码盲识别问题,提出了一种基于遗传算法的识别方法,该方法具有很好的容错性能和快速识别能力。最后,通过MATLAB仿真验证了该方法能够识别出卷积码的校验多项式,进而求得生成多项式。

关 键 词:卷积码盲识别  遗传算法  容错性能  校验多项式

Blind Recognition of (2,1, m) Convolutional Coding
LIU Jian-cheng,YANG Xiao-jing. Blind Recognition of (2,1, m) Convolutional Coding[J]. , 2012, 27(5): 6-10
Authors:LIU Jian-cheng  YANG Xiao-jing
Affiliation:(Electronic Engineering Institute,Hefei 230037,China)
Abstract: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 proposed 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.
Keywords:blind recognition of convolutional code  genetic algorithm (GA)  performance of error-resilient  parity-check polynomial
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号