基于量子遗传算法的删余卷积码搜索  

Searching punctured convolutional codes based on quantum genetic algorithm

作　　者：邹卫霞[1] 王桂叶[1] 王振宇[1] 杜光龙[1] 高英[2] 

机构地区：[1]北京邮电大学泛网无线通信教育部重点实验室,北京100876 [2]北京邮电大学电子工程学院,北京100876

出　　处：《深圳大学学报（理工版）》2013年第6期572-577,共6页Journal of Shenzhen University(Science and Engineering)

基　　金：国家自然科学基金资助项目(61171104);中央高校基本科研业务费专项资金资助项目(G470712)~~

摘　　要：针对采用计算机穷举法进行删余卷积码好码搜索无法满足更高码率和更大约束长度的问题,提出一种基于量子遗传算法快速搜索删余卷积码好码的方法.通过量子比特编码和量子旋转门更新等方式实现适应度函数的优化求解,得到删余卷积码好码的生成多项式和删余矩阵.搜索结果表明,与计算机穷举法相比,该方法不仅收敛速度快,且灵活性较好.Currently, the search of good punctured convolutional code （PCC） is mainly based on exhaustive search. Nevertheless, the computational complexity of exhaustive search increases exponentially as the number of encoder＇s input or the constraint length increases. Therefore, the use of exhaustive search codes is limited in cases of with high bit rates and great constraint lengths. To solve the problem, a new method based on quantum genetic algorithm is proposed tor searching good PCCs. The new method optimizes the fitness function through quantum bits encoding and quantum revolving door updating. The experimental results show that the proposed method not only converges quickly but also has good flexibility when compared to exhaustive search.

关 键 词：通信网络技术 删余卷积码 距离谱 量子遗传算法 量子比特 删余矩阵 适应度函数 

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