Grouping-Based Interference Alignment With IA-Cell Assignment in Multi-Cell MIMO MAC Under Limited Feedback

Grouping-Based Interference Alignment With IA-Cell Assignment in Multi-Cell MIMO MAC Under Limited Feedback
复制标题

DOI:
10.1109/tsp.2015.2496356
复制
发表时间:
2014-09
影响因子:
5.4
通讯作者:
Pan Cao;Alessio Zappone;Eduard Axel Jorswieck
Pan Cao;Alessio Zappone;Eduard Axel Jorswieck
中科院分区:
工程技术1区
文献类型:
--
作者:
Pan Cao;Alessio Zappone;Eduard Axel Jorswieck

文献摘要

被引文献

相似文献

干扰对齐(IA)是一种有效减轻干扰并增强无线通信网络容量的有前途的技术。针对有限反馈下的多小区干扰多输入多输出(MIMO)多址接入信道(MAC)网络,提出了一种基于分组的干扰对齐(GIA)算法,并优化了IA-Cell分配。本文的工作主要包括三个部分:1)在自由度(DoF)和最优线性收发器设计方面对GIA进行了改进(包括一些新的改进),从而实现了低复杂度和分布式实现; 2)在GIA的基础上,引入了IA-Cell分配的概念。在不同回程开销的情况下,提出了三种IA-Cell分配算法,并研究了它们的DoF和速率性能; 3)研究了IA预编码器有限反馈下GIA算法的性能。为了实现有效的反馈,动态反馈比特分配(DBA)问题制定和解决的封闭形式。实际的实现,回程开销的要求,和所提出的算法的复杂性进行了分析。数值结果表明,我们提出的算法大大优于传统的GIA在无限和有限的反馈。
Interference alignment (IA) is a promising technique to efficiently mitigate interference and to enhance the capacity of a wireless communication network. This paper proposes a grouping-based interference alignment (GIA) with optimized IA-Cell assignment for the multiple cells interfering multiple-input multiple-output (MIMO) multiple access channel (MAC) network under limited feedback. This work consists of three main parts: 1) an improved version (including some new improvements) of the GIA with respect to the degrees of freedom (DoF) and optimal linear transceiver design is provided, which allows for low-complexity and distributed implementation; 2) based on the GIA, the concept of IA-Cell assignment is introduced. Three IA-Cell assignment algorithms are proposed with different backhaul overhead and their DoF and rate performance is investigated; 3)the performance of the proposed GIA algorithms is studied under limited feedback of IA precoders. To enable efficient feedback, a dynamic feedback bit allocation (DBA) problem is formulated and solved in closed-form. The practical implementation, the backhaul overhead requirements, and the complexity of the proposed algorithms are analyzed. Numerical results show that our proposed algorithms greatly outperform the traditional GIA under both unlimited and limited feedback.