CAJ | 학술논문

针对信息截获领域中（n，n-1，m）卷积码盲识别问题，提出基于遗传算法的盲识别方法。该方法在矩阵分析得到编码参数之后，利用遗传算法的全局搜索能力实现对基本校验多项式矩阵的精确识别，进而实现对基本生成多项式矩阵的识别。仿真表明：该方法能够在高误码条件下实现对（n，n-1，m）卷积码的盲识别，且运算量相对于以往的高容错识别方法得到降低。
침대신식절획영역중（n，n-1，m）권적마맹식별문제，제출기우유전산법적맹식별방법。해방법재구진분석득도편마삼수지후，이용유전산법적전국수색능력실현대기본교험다항식구진적정학식별，진이실현대기본생성다항식구진적식별。방진표명：해방법능구재고오마조건하실현대（n，n-1，m）권적마적맹식별，차운산량상대우이왕적고용착식별방법득도강저。
Considering blind recognition of (n,n -1,m) convolutional code in information interception,a recognition method based on genetic algorithm is proposed. After obtaining coding characters through matrix analysis,this method achieves accurate recognition of the basic check polynomial matrix by utilizing global searching ability of the genetic algorithm. Then,recognition of basic generator polynomial matrix is realized. The simulation shows that this method can blindly recognise (n,n-1,m)convolutional code in a high BER environment,while its computing efforts get lower compared with high fault-tolerant methods before.