[论文解读] Low-Complexity Massive MIMO Subspace Estimation and Tracking from Low-Dimensional Projections

Saeid Haghighatshoar, Giuseppe Caire|arXiv (Cornell University)|Aug 8, 2016

Direction-of-Arrival Estimation Techniques被引用 4

一句话总结

本文提出了一种在大规模 MIMO 系统中通过信道向量的低维投影进行子空间估计与跟踪的低复杂度算法。通过将近似最大似然（AML）半定规划（SDP）重新表述为对角矩阵上的凸优化问题，该方法在显著降低计算成本的同时实现了接近最优的性能，从而在实际的大规模 MIMO 部署中实现了对动态信道子空间变化的实时跟踪。

ABSTRACT

Massive MIMO is a variant of multiuser MIMO, where the number of antennas $M$ at the base-station is large, and generally much larger than the number of spatially multiplexed data streams to/from the users. It has been observed that in many realistic propagation scenarios as well as in spatially correlated channel models used in standardizations, although the user channel vectors have a very high-dim $M$, they lie on low-dim subspaces due to their limited angular spread. This low-dim subspace structure remains stable across many coherence blocks and can be exploited in several ways to improve the system performance. A main challenge, however, is to estimate this signal subspace from samples of users' channel vectors as fast and efficiently as possible. In a recent work, we addressed this problem and proposed a very effective novel algorithm referred to as Approximate Maximum-Likelihood (AML), which was formulated as a semi-definite program (SDP). In this paper, we address two problems left open in our previous work: computational complexity and tracking. The algorithm proposed in this paper is reminiscent of Multiple Measurement Vectors (MMV) problem in Compressed Sensing and is proved to be equivalent to the AML Algorithm for sufficiently dense angular grids. It has also a very low computational complexity and is able to track sharp transitions in the channel statistics very quickly. Although mainly motivated by massive MIMO applications, our proposed algorithm is of independent interest in other related subspace estimation applications. We assess the estimation/tracking performance of our proposed algorithm empirically via numerical simulations, especially in practically relevant situations where a direct implementation of the SDP would be infeasible in real-time. We also compare the performance of our algorithm with other related subspace estimation algorithms in the literature.

研究动机与目标

• 解决先前工作中在大规模 MIMO 系统中使用半定规划（SDP）进行子空间估计时计算复杂度过高的问题。
• 实现实时、低复杂度的低秩信号子空间估计，基于信道向量的低维投影。
• 将 AML 算法扩展以跟踪时变的信道统计特性，特别是子空间结构的剧烈突变。
• 为包括二维矩形阵列在内的通用阵列配置提供高效的数值实现。
• 在直接实现 SDP 因计算约束而不可行的实际场景中，证明其可行性。

提出的方法

• 该方法将原始 AML SDP 重新表述为在表示密集方位角网格上功率分布的对角矩阵上的凸优化问题。
• 引入使用对角矩阵 P 表示信号协方差的参数化形式，从而形成如下优化问题：min_{P∈D₊} tr((ḠPḠᴴ + Iₘ)⁻¹Ĉₓ) + tr(P)。
• 利用舒尔补条件将问题表达为凸规划，避免了完整的 SDP 求解。
• 通过在精细方位角网格上的导向矢量字典，实现对信号协方差矩阵的低秩近似。
• 该方法支持时变采样算子，从而实现自适应和动态的子空间跟踪。
• 通过迭代凸优化计算解，其复杂度可扩展至大规模 MIMO 系统。

实验结果

研究问题

• RQ1 计算开销昂贵的 AML SDP 公式能否被一种低复杂度的凸优化所替代，同时在大规模 MIMO 子空间估计中保持接近最优的性能？
• RQ2 所提出的方法在时间上对信道子空间结构的快速变化跟踪效果如何？
• RQ3 与固定投影相比，使用时变投影算子在子空间估计中能带来多大的性能增益？
• RQ4 对于 M ≫ K 的大规模 MIMO 系统，该算法在计算复杂度和估计精度方面如何扩展？
• RQ5 在有限射频链路和低维投影等实际约束下，该算法在多大程度上保持了准确性？

主要发现

• 所提出的算法即使在计算复杂度显著降低的情况下，仍能实现与原始 AML SDP 相当的近似最优子空间估计性能。
• 该方法实现了实时子空间跟踪，在信道统计特性发生剧烈突变后能快速收敛至新的子空间状态。
• 即使在直接实现 SDP 对于实时操作计算不可行的情况下，该算法仍能保持高精度。
• 在信噪比较低且秩较低、方位角扩展受限的信道场景中，性能增益尤为显著。
• 该算法在包括二维矩形阵列在内的多种阵列配置中表现出鲁棒性和可扩展性，且具有高效的数值实现。