电子学报 ›› 2021, Vol. 49 ›› Issue (6): 1108-1116.DOI: 10.12263/DZXB.20200478

• 学术论文 • 上一篇    下一篇

基于迭代消元的卷积码快速识别

吴昭军1,3, 张立民1, 钟兆根2, 刘仁鑫1   

  1. 1. 海军航空大学信息融合研究所, 山东烟台 264001;
    2. 海军航空大学航空基础学院, 山东烟台 264001;
    3. 西南电子电信研究所, 四川成都 610041
  • 收稿日期:2020-05-20 修回日期:2020-06-13 出版日期:2021-06-25 发布日期:2022-06-25
  • 通讯作者: 张立民(通信作者) 男,1966年出生于辽宁开原.现为海军航空大学教授、博士生导师.主要研究方向为卫星信号处理及应用.E-mail:iamzlm@163.com
  • 作者简介:吴昭军 男,1992年9月出生于四川蓬溪县.现为西南电子电信研究所工程师.主要研究方向为:信道编码盲识别.E-mail:wuzhaojun1992@qq.com;钟兆根 男,1984年出生于江西南昌,博士现为海军航空大学讲师,主要研究方向为通信信号盲分离与统计信号处理.Email:zhongzhaogen@163.com;刘仁鑫 男,1995年生,山东潍坊人,海军航空大学硕士研究生,研究方向为信道编码识别.E-mail:iamlrxin@163.com
  • 基金资助:
    国家自然科学基金重大研究计划(No.91538201);泰山学者工程专项经费资助(No.Ts201511020)

Fast Recognition of Convolutional Codes Based on Iterative Elimination

WU Zhao-jun1,3, ZHANG Li-min1, ZHONG Zhao-gen2, LIU Ren-xin1   

  1. 1. Department of Information Fusion, Naval Aviation University, Yantai, Shandong 264001, China;
    2. School of Aviation Basis, Naval Aviation University, Yantai, Shandong 264001, China;
    3. Southwest Institute of Electronics and Telecommunications, Chengdu, Sichuan 610041, China
  • Received:2020-05-20 Revised:2020-06-13 Online:2021-06-25 Published:2022-06-25

摘要: 针对现有算法在卷积码参数识别过程中存在计算量大、容错性差的缺点,提出了一种基于迭代消元的快速识别方法.算法首先在理论上分析了基于传统高斯消元识别算法的性能,验证并给出了可靠出现一次校验向量的最少消元迭代次数;其次,通过遍历可能的最小校验约束长度和卷积码码率,构建消元矩阵,求解疑似校验向量;最后基于最小错误判决准则设定判决门限,实现在高误码率下校验多项式矩阵快速识别.仿真结果表明,推导的理论性能与仿真结果一致,提出的算法具有较强的容错性能.与现有方法相比,复杂度明显降低.在智能通信或通信侦察领域具有较好的应用前景.

关键词: 智能通信, 卷积码, 迭代消元, 最小错误判决准则, 硬判决, 盲识别

Abstract: In order to overcome the shortcomings of high computational complexity and low fault tolerance of the existing algorithms for recognition of convolutional codes,a fast convolutional code identification method based on iterative elimination is proposed.Firstly,the proposed algorithm analyzed the performance of the traditional Gauss elimination method,and the minimum number of iterations was given to ensure the presence of check vectors.Secondly,by traversing the possible minimum constraint length and convolutional code rate,the elimination matrix was constructed,and as a result,the suspected check vectors were obtained.Finally,we set the decision threshold based on the minimum error decision criterion,which realized fast identification of check polynomial matrix at high bit error rate.The simulation results show that the theoretical performance is consistent with the simulation results,and the proposed algorithm has strong fault-tolerant performance.Compared with the existing algorithms,the proposed algorithm has advantages in computational efficiency,and it has a good prospect in application of intelligent communication or communication reconnaissance.

Key words: intelligent communication, convolutional code, iterative elimination, minimum error decision criterion, hard decision, blind recognition

中图分类号: