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

基于改进欧几里得算法的卷积码快速盲识别算法
引用本文:解辉,王丰华,黄知涛,张锡祥. 基于改进欧几里得算法的卷积码快速盲识别算法[J]. 国防科技大学学报, 2012, 34(6): 158-162
作者姓名:解辉  王丰华  黄知涛  张锡祥
作者单位:1. 国防科技大学电子科学与工程学院,湖南长沙,410073
2. 西南电子设备研究所,四川成都,610000
基金项目:国家自然科学基金资助项目,教育部新世纪优秀人才支持计划项目
摘    要:卷积码盲识别技术在信号截获、智能移动通信、多点广播通信等领域具有广泛应用,针对卷积码的快速盲识别问题,对经典欧几里得算法进行了改进,提出了一种基于改进欧几里得算法的卷积码的快速盲识别方法。算法对卷积码码率进行遍历,通过欧几里得迭代算法求解卷积的校验多项式,实现了任意码率卷积码的快速盲识别。对算法进行了仿真,仿真结果验证了算法的有效性,且算法的计算量小于文献中已有算法。

关 键 词:卷积码  盲识别  欧几里得
收稿时间:2012-04-16

A fast method for blind recognition of convolutional codes based on improved Euclidean algorithm
XIE Hui,WANG Fenghu,HUANG Zhitao and ZHANG Xixiang. A fast method for blind recognition of convolutional codes based on improved Euclidean algorithm[J]. Journal of National University of Defense Technology, 2012, 34(6): 158-162
Authors:XIE Hui  WANG Fenghu  HUANG Zhitao  ZHANG Xixiang
Affiliation:1.College of Electronic Science and Engineering,National University of Defense Technology,Changsha 410073,China; 2.Southwest China Research Institute of Electronic Equipment,Chengdu 610000,China)
Abstract:Blind recognition of convolutional codes is widely used in the fields of information interception, intelligent mobile communication and multicast communication. In order to solve the problem of fast recognition of convolutional codes, the classical Euclidean algorithm is improved, and a method for blind recognition of convolutional codes based on improved Euclidean algorithm is proposed. Code rate is searched first, the check polynomial of convolutional codes is solved through iterative process, and the convolutional codes can be identified quickly. Validity of the algorithm is verified by the simulation results, and computational load is less than the algorithms in the literature reviewed.
Keywords:convolutional code   blind recognition   Euclidean
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《国防科技大学学报》浏览原始摘要信息
点击此处可从《国防科技大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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