一种低复杂度的删除卷积码识别算法  

An Algorithm for Recognition of Punctured Convolutional Code of Low Complexity

作　　者：樊斌斌 FAN Bin-bin(Institute of Scientific Research Ministry,National Defense Information Institute, Wuhan 430010, China)

机构地区：[1]国防信息学院科研部研究所,武汉430010

出　　处：《电子信息对抗技术》2017年第1期18-22,共5页Electronic Information Warfare Technology

摘　　要：针对当前信息截获领域中删除卷积码识别需遍历删除模式进行校验、运算复杂度较高的不足,提出一种基于求解伪循环多项式矩阵(Poly-Cyclic Pseudo Circulant matrix,PCPC)的删除卷积码识别算法。该算法可由删除卷积码的等价生成多项式矩阵Gp(D)直接运算得到删除模式P和源卷积码基本生成多项式矩阵G(D),从而使删除卷积码的识别过程极大简化,极大降低了识别算法的复杂度。A novel algorithm for recognition of punctured convolutional code is proposed to solve the deficiency that all the puncturing patterns has to be checked and a large operation volume is done, before deleting the recognition of punctured convolutional code. The puncturing pattern P and basic generate polynomial matrix of the parent convolutional code G（D） are worked out only by the operation of equivalent generate polynomial matrix Gp （D）, and then the recognition is simplified a lot .

关 键 词：信息截获 删除卷积码 识别 低复杂度 伪循环多项式矩阵 

分 类 号：TN971.1[电子电信—信号与信息处理]