基于模拟退火算法的(2,1,m)卷积码盲识别  

Blind Recognition of (2,1,m) Convolutional Code Based on Simulated Annealing Algorithm

作　　者：刘杰[1] 张立民[1] 钟兆根[1] 

机构地区：[1]海军航空工程学院,山东烟台264001

出　　处：《无线电通信技术》2014年第6期47-49,共3页Radio Communications Technology

基　　金：国家自然科学基金项目(61102167)

摘　　要：卷积码是数字通信中常采用的信道编码形式。针对(2,1,m)卷积码的盲识别问题,提出了一种基于模拟退火算法的新方法。首先根据码特征给出了识别的数学模型,然后基于该模型对方法的基本原理和实现过程进行了详细的介绍,并给出了各参数的选取方法。最后,采用蒙特卡洛方法进行了仿真验证。仿真结果表明,算法性能优异,在误码率高达10-2量级时,能有效实现对常用(2,1,m)卷积码的识别。相比于现有的卷积码识别方法,该算法性能优异且计算复杂度较低。The convolutional code is channel coding form that often used in digital communication.For the blind recognition problem of（2,1,m） convoluntional code,a new method based on simulated annealing algorithm is proposed.Firstly,the mathematical model is given based on code features.Then the basic principle and implementation process are described in detail,and the method to choose parameters is given.Finally,the simulation verification is given by using Monte Carlo method.The simulation results show that the recognition of（2,1,m） convolutional code can be easily achieved even when the bit error rate is as high as 10-2order.Compared with other methods,the algorithm has excellent performance and low computational complexity.

关 键 词：模拟退火算法 卷积码 盲识别 

分 类 号：TN911.23[电子电信—通信与信息系统]