大规模MIMO系统中优化导频分配方案研究  

Research on Optimized Pilot Allocation Schemes in Massive MIMO System

作　　者：瞿拓思 曹海燕[1] 许方敏[1] 方昕[1] 王秀敏 QU Tuosi;CAO Haiyan;XU Fangmin;FANG Xin;WANG Xiumin(School of Communication Engineering,Hangzhou Dianzi University,Hangzhou 310018,China;College of Information Engineering,China Jiliang University,Hangzhou 310018,China)

机构地区：[1]杭州电子科技大学通信工程学院,杭州310018 [2]中国计量大学信息工程学院,杭州310018

出　　处：《计算机工程与应用》2020年第8期60-65,共6页Computer Engineering and Applications

基　　金：国家自然科学基金(No.61501158,No.61379027)。

摘　　要：针对大规模MIMO系统中小区间干扰而导致的导频污染问题,提出了基于IGTSA(Improved Greedy and Tabu Search Algorithm,改进贪婪禁忌搜索算法)和基于CA(Competition Algorithm,竞争算法)的导频分配方案。提出的ITSA是将遗传算法中的变异操作加入禁忌算法来避免其陷入局部最优解,提升全局搜索能力。为更好地实现全局搜索与局部搜索的协调统一,引入CA进一步优化以系统可达和速率达到最大为目标的导频分配方案。相比于局部搜索算法,如GA(Greedy Algorithm,贪婪算法)和TSA(Tabu Search Algorithm,禁忌搜索算法),所提出的方案能获得更优的系统性能。仿真结果和分析证明了算法的有效性。In view of pilot contamination caused by inter-cell interference in massive MIMO system,a scheme based on IGTSA(Improved Greedy and Tabu Search Algorithm)and CA(Competition Algorithm)is proposed.The proposed IGTSA is to add the mutation operation in the genetic algorithm to the tabu search algorithm to avoid it falling into the local optimal solution,and improve the global search ability.In order to better realize the coordination of global search and local search,the introduction of CA optimizes the pilot allocation scheme with the goal of achieving max achievable rate.Compared with local search algorithms,such as greedy algorithm and tabu search algorithm,the proposed scheme can obtain better system performance.Simulation results and analysis prove the effectiveness of the algorithm.

关 键 词：大规模MIMO 导频分配 优化问题 禁忌算法 竞争算法 

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