arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1301.6196cs.ITmath.IT
收藏

K用户常系数MIMO信道干扰对齐解的个数

On the Number of Interference Alignment Solutions for the K-User MIMO Channel with Constant Coefficients

Óscar González, Carlos Beltrán, Ignacio Santamaría

摘要:

在本文中,我们研究的数量不同的干扰对齐(IA)的解决方案在K用户多输入多输出(MIMO)干扰信道,当对齐是通过波束成形和不允许符号扩展。我们专注于IA方程的数量与变量的数量相匹配的情况。在这种情况下,IA的解决方案的数量是有限的和恒定的任何通道实现的零措施集,正如我们证明的文件中,它是由一个积分公式,可以用Monte Carlo积分方法进行数值近似。更准确地说,对齐解决方案的数量是与问题的几何形状相关的某个厄米特矩阵的行列式的缩放平均值。有趣的是,虽然这个行列式在任意点的值可以用来检查IA问题的可行性,但它的平均值(适当缩放)给出了解决方案的数量。对于单梁系统的渐近增长率的数量的解决方案进行了分析,并与经典的组合问题的一些连接。尽管如此,我们的研究结果可以适用于任意干扰MIMO网络,任何数量的用户,每个用户的天线和流。

英文摘要:

In this paper, we study the number of different interference alignment (IA) solutions in a K-user multiple-input multiple-output (MIMO) interference channel, when the alignment is performed via beamforming and no symbol extensions are allowed. We focus on the case where the number of IA equations matches the number of variables. In this situation, the number of IA solutions is finite and constant for any channel realization out of a zero-measure set and, as we prove in the paper, it is given by an integral formula that can be numerically approximated using Monte Carlo integration methods. More precisely, the number of alignment solutions is the scaled average of the determinant of a certain Hermitian matrix related to the geometry of the problem. Interestingly, while the value of this determinant at an arbitrary point can be used to check the feasibility of the IA problem, its average (properly scaled) gives the number of solutions. For single-beam systems the asymptotic growth rate of the number of solutions is analyzed and some connections with classical combinatorial problems are presented. Nonetheless, our results can be applied to arbitrary interference MIMO networks, with any number of users, antennas and streams per user.

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

↑