Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

GLOBECOM

2009

IEEE

2009

IEEE

—The degrees of freedom (DoF) of K-user MIMO interference networks with constant channel coefﬁcients are not known in general. Determining the feasibility of a linear interference alignment is a key step toward solving this open problem. Our approach in this paper is to view the alignment problem for interference networks as a multivariate polynomial system and determine its solvability by comparing the number of equations and the number of variables. Consequently, we divide the interference networks into two classes - proper and improper, where interference alignment is and is not achievable, respectively. An interference network is called proper if the cardinality of every subset of equations in the corresponding polynomial system is less than or equal to the number of variables involved in that subset of equations. Otherwise, it is called improper. Our intuition in this paper is that for general channel matrices, proper systems are almost surely feasible and improper systems are...

Related Content

Added |
20 May 2010 |

Updated |
20 May 2010 |

Type |
Conference |

Year |
2009 |

Where |
GLOBECOM |

Authors |
Cenk M. Yetis, Tiangao Gou, Syed Ali Jafar, Ahmet H. Kayran |

Comments (0)