The Feasibility Conditions for Interference Alignment in MIMO Networks

Interference alignment (IA) has attracted great attention in the last few years for its breakthrough performance in interference networks. However, despite the numerous works dedicated to IA, the feasibility conditions of IA remains unclear for most network topologies. The IA feasibility analysis is challenging as the IA constraints are sets of high-degree polynomials, for which no systematic tool to analyze the solvability conditions exists. In this work, by developing a new mathematical framework that maps the solvability of sets of polynomial equations to the linear independence of their first-order terms, we propose a sufficient condition that applies to MIMO interference networks with general configurations. We have further proved that this sufficient condition coincides with the necessary conditions under a wide range of configurations. These results further consolidate the theoretical basis of IA.

[1]  Shlomo Shamai,et al.  Degrees of Freedom Region of the MIMO $X$ Channel , 2008, IEEE Transactions on Information Theory.

[2]  Tomoaki Ohtsuki,et al.  Interference alignment in the 2 × (1 + N) MIMO model , 2010, 2010 IEEE Globecom Workshops.

[3]  Zhi-Quan Luo,et al.  On the Degrees of Freedom Achievable Through Interference Alignment in a MIMO Interference Channel , 2011, IEEE Transactions on Signal Processing.

[4]  David Tse,et al.  Feasibility of interference alignment for the MIMO interference channel: The symmetric square case , 2011, 2011 IEEE Information Theory Workshop.

[5]  E. Kunz.  Introduction to commutative algebra and algebraic geometry , 1984 .

[6]  Joe W. Harris,et al.  Algebraic Geometry: A First Course , 1995 .

[7]  Amir K. Khandani,et al.  Communication Over MIMO X Channels: Interference Alignment, Decomposition, and Performance Analysis , 2008, IEEE Transactions on Information Theory.

[8]  Robert W. Heath,et al.  Interference alignment via alternating minimization , 2009, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing.

[9]  Carl D. Meyer,et al.  Matrix Analysis and Applied Linear Algebra , 2000 .

[10]  Syed Ali Jafar,et al.  Degrees of Freedom of Wireless Networks With Relays, Feedback, Cooperation, and Full Duplex Operation , 2009, IEEE Transactions on Information Theory.

[11]  A. H. Kayran,et al.  On Feasibility of Interference Alignment in MIMO Interference Networks , 2009, IEEE Transactions on Signal Processing.

[12]  Donal O'Shea,et al.  Ideals, varieties, and algorithms - an introduction to computational algebraic geometry and commutative algebra (2. ed.) , 1997, Undergraduate texts in mathematics.

[13]  A. H. Kayran,et al.  On Feasibility of Interference Alignment in MIMO Interference Networks , 2009, IEEE Transactions on Signal Processing.

[14]  Syed Ali Jafar,et al.  Approaching the Capacity of Wireless Networks through Distributed Interference Alignment , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[15]  Syed Ali Jafar,et al.  Interference Alignment and Degrees of Freedom of the $K$-User Interference Channel , 2008, IEEE Transactions on Information Theory.

[16]  Namyoon Lee,et al.  Degrees of Freedom on the K-User MIMO Interference Channel with Constant Channel Coefficients for Downlink Communications , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[17]  Erwin Riegler,et al.  On the achievability of interference alignment in the K-user constant MIMO interference channel , 2009, 2009 IEEE/SP 15th Workshop on Statistical Signal Processing.