arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0904.4526cs.ITcs.ARmath.IT
收藏

干涉对准的可行性条件

Feasibility Conditions for Interference Alignment

Cenk M. Yetis, Syed A. Jafar, Ahmet H. Kayran

摘要:

具有恒定信道系数的MIMO干扰网络的自由度通常是未知的。确定线性干涉对准解决方案的可行性是解决这一未决问题的关键一步。在本文中,我们的方法是将对准问题视为一个双线性方程组,并通过比较方程的数量和变量的数量来确定其可解性。为此,我们将干扰对齐问题分为两类-适当和不适当。如果方程的数目不超过变量的数目,则干涉对准问题被称为真问题。否则,它被称为不当。例子来支持的直觉,一般的信道矩阵,适当的系统几乎肯定是可行的,不适当的系统几乎肯定是不可行的。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑