Efficient incremental algorithms for the sparse resultant and the mixed volume
Journal of Symbolic Computation
Interference alignment and cancellation
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
A novel signaling for communication on MIMO Y channel: signal space alignment for network coding
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
IEEE Transactions on Information Theory
The approximate capacity of the many-to-one and one-to-many Gaussian interference channels
IEEE Transactions on Information Theory
Degrees of Freedom for the MIMO Interference Channel
IEEE Transactions on Information Theory
Degrees of Freedom Region of the MIMO X Channel
IEEE Transactions on Information Theory
Interference Alignment and Degrees of Freedom of the -User Interference Channel
IEEE Transactions on Information Theory
Communication Over MIMO X Channels: Interference Alignment, Decomposition, and Performance Analysis
IEEE Transactions on Information Theory
Spatial interweave for a MIMO secondary interference channel with multiple primary users
Proceedings of the 4th International Conference on Cognitive Radio and Advanced Spectrum Management
Joint MMSE transceiver designs and performance benchmark for CoMP transmission and reception
ISRN Communications and Networking
Privacy analysis in mobile social networks: the influential factors for disclosure of personal data
International Journal of Wireless and Mobile Computing
An iterative algorithm for multi-user inference channel based on subspace projection
International Journal of Wireless and Mobile Computing
Hi-index | 35.68 |
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 which is 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 multibeam 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.