Abstract
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 firstorder 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
