On Feasibility of Interference Alignment in MIMO Interference Networks

From MaRDI portal
Publication:4570517

DOI10.1109/TSP.2010.2050480zbMATH Open1392.94893arXiv0911.4507OpenAlexW2168095411MaRDI QIDQ4570517FDOQ4570517


Authors: Cenk M. Yetis, Tiangao Gou, Syed A. Jafar, Ahmet Hamdi Kayran Edit this on Wikidata


Publication date: 9 July 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Abstract: We explore the feasibility of interference alignment in signal vector space -- based only on beamforming -- for K-user MIMO interference channels. Our main contribution is to relate the feasibility issue to the problem of determining the solvability of a multivariate polynomial system, considered extensively in algebraic geometry. It is well known, e.g. from Bezout's theorem, that generic polynomial systems are solvable if and only if the number of equations does not exceed the number of variables. Following this intuition, we classify signal space interference alignment problems as either proper or improper based on the number of equations and variables. Rigorous connections between feasible and proper systems are made through Bernshtein's theorem for the case where each transmitter uses only one beamforming vector. The multi-beam case introduces dependencies among the coefficients of a polynomial system so that the system is no longer generic in the sense required by both theorems. In this case, we show that the connection between feasible and proper systems can be further strengthened (since the equivalency between feasible and proper systems does not always hold) by including standard information theoretic outer bounds in the feasibility analysis.


Full work available at URL: https://arxiv.org/abs/0911.4507







Cited In (10)





This page was built for publication: On Feasibility of Interference Alignment in MIMO Interference Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4570517)