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

被引:17
作者
Cao, Pan [1 ,2 ]
Zappone, Alessio [1 ]
Jorswieck, Eduard A. [1 ]
机构
[1] Tech Univ Dresden, Commun Lab, Chair Commun Theory, D-01062 Dresden, Germany
[2] Univ Edinburgh, Inst Digital Commun, Edinburgh EH9 3JL, Midlothian, Scotland
基金
英国工程与自然科学研究理事会;
关键词
Dynamic feedback bit allocation; Grassmainn subspace quantization; interfering MIMO networks; interference alignment (IA); IA-cell assignment; limited feedback; small cells; CODEBOOK DESIGN; QUANTIZATION; MANIFOLDS; SELECTION; NETWORKS; CHANNELS;
D O I
10.1109/TSP.2015.2496356
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页码:1336 / 1351
页数:16
相关论文
共 45 条
  • [1] What Will 5G Be?
    Andrews, Jeffrey G.
    Buzzi, Stefano
    Choi, Wan
    Hanly, Stephen V.
    Lozano, Angel
    Soong, Anthony C. K.
    Zhang, Jianzhong Charlie
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2014, 32 (06) : 1065 - 1082
  • [2] [Anonymous], P IEEE ISWCS
  • [3] [Anonymous], 1989, The Stable Marriage Problem: Structure and Algorithms
  • [4] [Anonymous], P IEEE ISIT JUN
  • [5] [Anonymous], P IEEE ISIT JUN
  • [6] [Anonymous], EV UN TERR RAD ACC E
  • [7] [Anonymous], LOW COMPLEXITY SUM R
  • [8] [Anonymous], 1974, J. Math. Econ.
  • [9] [Anonymous], P IEEE ISIT JUN
  • [10] Size versus stability in the marriage problem
    Biro, Peter
    Manlove, David F.
    Mittal, Shubham
    [J]. THEORETICAL COMPUTER SCIENCE, 2010, 411 (16-18) : 1828 - 1841