2012/11/15 by Liangzhong Ruan, Vincent K. N. Lau, Moe Z. Win · 88 citations
Computer Science · Engineering · Mathematics · #Advanced MIMO Systems Optimization #Applied mathematics #Beamforming #Channel (broadcasting) #Combinatorics #Computer science #Cooperative Communication and Network Coding #Full-Duplex Wireless Communications #Independence (probability theory) #Interference (communication) #Interference alignment #MIMO #Mathematical analysis #Mathematical optimization #Mathematics #Network topology #Polynomial #Range (aeronautics) #Telecommunications #Topology (electrical circuits) #cs.IT #math.IT
paper · pdf · doi:10.1109/tsp.2013.2241056
published in IEEE Transactions on Signal Processing 61(8), 2066-2077 (Institute of Electrical and Electronics Engineers) · accepted by IEEE Trans. Signal Process
arxiv created 2012/11/15 · openalex publication_date 2013/01/18 · arxiv updated 2013/08/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Interference alignment (IA) has attracted great attention in the last few years for its breakthrough performance in interference networks. However, despite the numerous works dedicated to IA, the feasibility conditions of IA remains unclear for most network topologies. 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 MIMO interference networks with general configurations. We have further proved that this sufficient condition coincides with the necessary conditions under a wide range of configurations. These results further consolidate the theoretical basis of IA.