一种最大化系统用户速率下限的MIMO-MAC有限反馈干扰对齐算法

发布时间：2018-04-30 20:50

  本文选题：干扰对齐 + MIMO-MAC　； 参考：《电子学报》2017年03期

【摘要】：针对2小区MIMO-MAC中传统有限反馈干扰对齐码字选择方案的不足,本文提出了一种最大化用户速率下界的直接码字选择方案,并结合比特分配算法来减少和速率的损失,同时采用最大信干扰算法译码.不同于传统的基于最小弦距离或对齐度准则来选择码字,本文从最大化用户速率下界的角度来选择的码字;进一步地,在格拉斯曼空间中生成与期望预编码接近的码字集合,在该集合中只需简单的搜索便可找到优化的码字组合,同时实现了低复杂度和次优的全局搜索.仿真实验表明,相对于现有的典型算法,本文算法在提升系统和速率的同时,也提高了系统用户速率的下界.
[Abstract]:Aiming at the deficiency of traditional limited feedback interference alignment codeword selection scheme in 2 cell MIMO-MAC, this paper proposes a direct codeword selection scheme that maximizes the lower bound of user rate, and combines bit allocation algorithm to reduce the loss of sum rate. At the same time, the maximum signal interference algorithm is used to decode. Different from the traditional codeword selection based on the minimum chord distance or alignment criterion, this paper selects the codeword from the angle of maximizing the lower bound of the user rate, and further, generates the code word set in Glassmann space, which is close to the expected precoding. In this set, a simple search is needed to find the optimized combination of codewords, and a low complexity and sub-optimal global search is realized at the same time. The simulation results show that the proposed algorithm not only improves the system and speed, but also improves the lower bound of the system user rate.
【作者单位】： 重庆邮电大学个人通信研究所;
【基金】：国家自然科学基金(No.61271259,No.61471076) 重庆市教委科学技术研究项目(No.KJ120501,No.KJ130536) 长江学者和创新团队发展计划(No.IRT1299) 重庆市科委重点实验室专项经费(CSTC)资助课题
【分类号】：TN919.3
，

本文编号：1826166