基于簇级匈牙利与联盟博弈联合的CF mMIMO导频分配算法  

Pilot Allocation Algorithm in CF mMIMO Systems Based on Cluster-level Hungarian with Coalition Game

作　　者：谭景戈 毛翔宇 郑建宏[1] TAN Jingge;MAO Xiangyu;ZHENG Jianhong(School of Communication and Information Engineering,Chongqing University of Posts and Telecommunications,Chongqing 400065,China)

机构地区：[1]重庆邮电大学通信与信息工程学院,重庆400065

出　　处：《电讯技术》2023年第11期1817-1823,共7页Telecommunication Engineering

基　　金：国家科技重大专项(2018ZX03001026-002)。

摘　　要：针对无小区大规模MIMO(Cell-Free Massive Multiple-Input Multiple-Output,CF mMIMO)系统,提出了一种基于簇级匈牙利与联盟博弈联合的导频分配算法。首先,利用用户的地理位置信息将系统中的用户划分为多个用户簇并为相同簇内的用户分配相互正交的导频序列,从空间角度减轻用户复用导频造成的导频污染;然后,在此基础上利用改进收益矩阵的匈牙利算法优化导频分配方案;最后,利用联盟博弈的思想避免因为固定的导频使用次数而带来的性能上限。仿真结果表明,该导频分配算法性能优于多种典型导频分配算法。A pilot allocation algorithm based on cluster-level Hungarian with Coalition Game is proposed for cell-free massive multiple-input multiple-output(CF mMIMO)systems.Firstly,users in the system are divided into multiple user clusters based on their geographic location information and mutually orthogonal pilot sequences are allocated to users in the same cluster,so as to reduce the pilot contamination caused by the reuse of pilots from the perspective of space.Then,the Hungarian algorithm with improved benefit matrix is used to optimize the pilot allocation scheme.Finally,the idea of Coalition Game is used to avoid the upper limit of performance due to the fixed number of pilot usages.The simulation results show that the performance of the proposed pilot allocation algorithm is better than those of many typical pilot allocation algorithms.

关 键 词：无小区大规模MIMO(CF mMIMO) 导频分配 匈牙利算法 联盟博弈 

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