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

常系数MIMO信道中线性干扰对齐的可行性检验

A Feasibility Test for Linear Interference Alignment in MIMO Channels with Constant Coefficients

Oscar Gonzalez, Carlos Beltran, Ignacio Santamaria

摘要:

在本文中,我们考虑了线性干扰对齐(IA)的多输入多输出(MIMO)信道的常数系数为任何数量的用户,天线和每个用户的流的可行性,并提出了一个多项式时间测试这个问题。结合代数几何技术与微分拓扑的,我们首先证明了一个结果,概括了以前发表的关于这个主题。具体来说,我们认为输入集(MIMO干扰信道的复投影空间),输出集(预编码器和解码器格拉斯曼)和解决方案集(信道,解码器和预编码器满足IA多项式方程),不仅作为代数集,而且作为光滑紧致流形。利用这个数学框架,我们证明了当解簇的代数维数大于或等于输入空间的维数,且第一投影所给出的两个光滑流形的切空间之间的线性映射是一般满射时,线性对齐问题是可行的.如果该映射不是满射,则解簇以奇异的方式投影到输入空间中,并且投影是零测度集。这个结果自然会产生一个简单的可行性测试,相当于检查矩阵的秩。我们还提供了一个精确的算术版本的测试,这证明了测试IA的通用MIMO信道的可行性属于有界误差概率多项式(BPP)的复杂性类。

英文摘要:

In this paper, we consider the feasibility of linear interference alignment (IA) for multiple-input multiple-output (MIMO) channels with constant coefficients for any number of users, antennas and streams per user; and propose a polynomial-time test for this problem. Combining algebraic geometry techniques with differential topology ones, we first prove a result that generalizes those previously published on this topic. Specifically, we consider the input set (complex projective space of MIMO interference channels), the output set (precoder and decoder Grassmannians) and the solution set (channels, decoders and precoders satisfying the IA polynomial equations), not only as algebraic sets but also as smooth compact manifolds. Using this mathematical framework, we prove that the linear alignment problem is feasible when the algebraic dimension of the solution variety is larger than or equal to the dimension of the input space and the linear mapping between the tangent spaces of both smooth manifolds given by the first projection is generically surjective. If that mapping is not surjective, then the solution variety projects into the input space in a singular way and the projection is a zero-measure set. This result naturally yields a simple feasibility test, which amounts to checking the rank of a matrix. We also provide an exact arithmetic version of the test, which proves that testing the feasibility of IA for generic MIMO channels belongs to the bounded-error probabilistic polynomial (BPP) complexity class.

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

↑