Feasibility conditions for interference alignment

Authors:
Cenk M. Yetis;Tiangao Gou;Syed A. Jafar;Ahmet H. Kayran
Affiliations:
Istanbul Technical University, Informatics Inst., Maslak, Istanbul, Turkey;Electrical Eng. and Computer Sc., University of California Irvine, Irvine, CA;Electrical Eng. and Computer Sc., University of California Irvine, Irvine, CA;Istanbul Technical University, Dept. of Electronics and Comm. Eng., Maslak, Istanbul, Turkey
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 2
Cited 4

Degrees of Freedom for the MIMO Interference Channel

IEEE Transactions on Information Theory
Interference Alignment and Degrees of Freedom of the -User Interference Channel

IEEE Transactions on Information Theory

Minimum mean squared error interference alignment

Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Real world feasibility of interference alignment using MIMO-OFDM channel measurements

MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Least squares approach to joint beam design for interference alignment in multiuser multi-input multi-output interference channels

IEEE Transactions on Signal Processing
Robust transceiver design for K-pairs quasi-static MIMO interference channels via semi-definite relaxation

IEEE Transactions on Wireless Communications

Quantified Score

Hi-index	0.01

Visualization

Abstract

The degrees of freedom (DoF) of K-user MIMO interference networks with constant channel coefficients are not known in general. Determining the feasibility of a linear interference alignment is a key step toward solving this open problem. Our approach in this paper is to view the alignment problem for interference networks as a multivariate polynomial system and determine its solvability by comparing the number of equations and the number of variables. Consequently, we divide the interference networks into two classes - proper and improper, where interference alignment is and is not achievable, respectively. An interference network is called proper if the cardinality of every subset of equations in the corresponding polynomial system is less than or equal to the number of variables involved in that subset of equations. Otherwise, it is called improper. Our intuition in this paper is that for general channel matrices, proper systems are almost surely feasible and improper systems are almost surely infeasible. We prove the direct link between proper (improper) and feasible (infeasible) systems for some important cases, thus significantly strengthening our intuition. Numerical simulation results also support our intuition.