arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.01320eess.SPcs.ITmath.IT
收藏

具有每AP功率约束的无蜂窝大规模MIMO的广义约简WMMSE方法

Generalized Reduced-WMMSE Approach for Cell-Free Massive MIMO With Per-AP Power Constraints

Wonsik Yoo, Daesung Yu, Hoon Lee, Seok-Hwan Park

AI总结:

针对无蜂窝大规模MIMO协作波束成形优化,本文提出按AP分解并利用拉格朗日对偶求闭式解的G-R-WMMSE方法及自适应并行执行,复杂度降低超99%且性能基本不变。

摘要:

本文研究了无蜂窝大规模MIMO(mMIMO)系统中协作波束成形向量的优化问题,其中多天线接入点(AP)支持多个用户的下行数据传输。尽管加权最小均方误差(WMMSE)算法及其变体已取得成功,但它们对随天线数量和AP数量扩展的计算复杂度缺乏细致研究。我们提出了一种广义约简WMMSE(G-R-WMMSE)方法,其复杂度显著低于传统WMMSE。我们将波束成形系数集合划分为若干子向量,每个子向量对应一个特定AP。这种划分方法将原始WMMSE问题分解到各个AP上。通过利用拉格朗日对偶分析,可以为每个子问题推导闭式解,从而大幅减轻计算负担。此外,我们提出了采用自适应步长并行执行所提G-R-WMMSE的方案,旨在进一步降低时间复杂度。数值结果验证,与传统WMMSE方案相比,所提G-R-WMMSE方案实现了超过99%的复杂度节省,同时保持几乎相同的性能。

英文摘要:

The optimization of cooperative beamforming vectors in cell-free massive MIMO (mMIMO) systems is presented where multi-antenna access points (APs) support downlink data transmission of multiple users. Albeit the successes of the weighted minimum mean squared error (WMMSE) algorithm and their variants, they lack careful investigations about computational complexity that scales with the number of antennas and APs. We propose a generalized and reduced WMMSE (G-R-WMMSE) approach whose complexity is significantly lower than conventional WMMSE. We partition the set of beamforming coefficients into subvectors, with each subvector corresponding to a specific AP. Such a partitioning approach decomposes the original WMMSE problem across individual APs. By leveraging the Lagrange duality analysis, a closed-form solution can be derived for each subproblem, which substantially reduces the computation burden. Additionally, we present a parallel execution of the proposed G-R-WMMSE with adaptive step sizes, aiming at further reducing the time complexity. Numerical results validate that the proposed G-R-WMMSE schemes achieve over 99% complexity savings compared to the conventional WMMSE scheme while maintaining almost the same performance.

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

↑