The feasibility conditions of interference alignment for MIMO interference networks
Name
Win_Feasibility conditions.pdf
Size
1.4 MB
Format
Adobe PDF
Checksum (MD5)
d3f9355d4d49170ebaf26159d5bab5d2
Author(s)
Ruan, Liangzhong
Lau, Vincent K. N.
Win, Moe Z.
Date Issued
July 2012
Journal
2012 IEEE International Symposium on Information Theory Proceedings
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Ruan, Liangzhong, Vincent K. N. Lau, and Moe Z. Win. “The feasibility conditions of interference alignment for MIMO interference networks.” In 2012 IEEE International Symposium on Information Theory Proceedings, 2486-2490. Institute of Electrical and Electronics Engineers, 2012.
Version
Original manuscript
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 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.
Description
Original Manuscript 15 Nov 2012
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ISIT.2012.6283963
