arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2305.16679eess.SP
收藏

非方阵差分大规模MIMO的最优但低复杂度优化方法

Optimal but Low-Complexity Optimization Method for Nonsquare Differential Massive MIMO

Yuma Katsuki, Naoki Ishikawa

AI总结:

本文针对非方阵差分大规模MIMO提出一种将离散非线性优化改造为连续线性优化的低复杂度方法,实现即时收敛,并在任意发射天线数下以几乎可忽略的优化成本获得最佳编码增益。

摘要:

本文提出了一种用于非方阵差分大规模MIMO的最优但低复杂度优化方法。传统非方阵差分编码需要离散非线性优化,我们对其进行了新的修改,以执行低复杂度的连续线性优化。与传统方法相比,这种新方法表现出即时收敛的特性。此外,所提出的差分编码可被视为相干广义空间调制的差分对应方案。我们的数值比较表明,尽管优化成本几乎可以忽略不计,但所提出的方法在任意数量的发射天线下均能实现最佳的编码增益。

英文摘要:

In this paper, we propose an optimal but low-complexity optimization method for nonsquare differential massive MIMO. While a discrete nonlinear optimization is required for the conventional nonsquare differential coding, we newly modify it to perform a low-complexity continuous linear optimization. This novel method exhibits immediate convergence as compared to the conventional method. Additionally, the proposed differential coding can be regarded as a differential counterpart of the coherent generalized spatial modulation. Our numerical comparisons demonstrate that the proposed method achieves the best coding gain for any number of transmit antennas, although the optimization cost is nearly negligible.

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

↑