Computer Science – Information Theory
Scientific paper
2009-04-29
IEEE Transactions on Signal Processing, Sep. 2010, Vol. 58, Issue: 9, Pages: 4771-4782
Computer Science
Information Theory
6 pages. Submitted to IEEE Globecom March 31 2009
Scientific paper
The degrees of freedom of MIMO interference networks with constant channel coefficients are not known in general. Determining the feasibility of a linear interference alignment solution is a key step toward solving this open problem. Our approach in this paper is to view the alignment problem as a system of bilinear equations and determine its solvability by comparing the number of equations and the number of variables. To this end, we divide interference alignment problems into two classes - proper and improper. An interference alignment problem is called proper if the number of equations does not exceed the number of variables. Otherwise, it is called improper. Examples are presented to support the intuition that for generic channel matrices, proper systems are almost surely feasible and improper systems are almost surely infeasible.
Jafar Syed A.
Kayran Ahmet H.
Yetis Cenk M.
No associations
LandOfFree
Feasibility Conditions for Interference Alignment does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Feasibility Conditions for Interference Alignment, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Feasibility Conditions for Interference Alignment will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-511124