By Topic

The feasibility conditions of interference alignment for MIMO interference networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Liangzhong Ruan ; Dept. of Electron. & Comput. Eng., Hong Kong Univ. of Sci. & Technol., Hong Kong, China ; Lau, V.K.N. ; Win, M.Z.

Attributed by its breakthrough performance in interference networks, interference alignment (IA) has attracted great attention in the last few years. However, despite the tremendous works dedicated to IA, the feasibility conditions of IA processing remains unclear for most network typologies. 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 K-pairs MIMO interference networks with general typologies. We have further proved that the sufficient condition aligns with the necessary conditions under some special configurations.

Published in:

Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on

Date of Conference:

1-6 July 2012