arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2005.13134cs.ITeess.SPmath.IT
收藏

大规模MIMO中的鲁棒预编码:一种深度学习方法

Robust Precoding in Massive MIMO: A Deep Learning Approach

Junchao Shi, Wenjin Wang, Xinping Yi, Xiqi Gao, Geoffrey Ye Li

摘要:

本文研究了大规模多输入多输出(MIMO)通信系统中基站采用均匀平面阵列(UPA)的情况,研究了不完全信道状态信息(CSI)下的下行链路预编码问题。通过利用瞬时和统计CSI,我们的目标是设计预编码向量以最大化遍历速率(例如,总费率、最低费率等)受到总发射功率约束。为了最大限度地提高遍历速率的上界,我们利用相应的拉格朗日公式,并确定最佳预编码器的结构特征作为广义特征值问题的解决方案。因此,高维预编码器设计问题变成低维功率控制问题。拉格朗日乘子在确定预编码器方向和功率参数方面起着至关重要的作用,但直接求解具有挑战性。为了计算出拉格朗日乘数,我们开发了一个通用框架,该框架由一个直接从CSI学习的适当设计的神经网络支撑。为了进一步减轻计算负担,我们得到了一个低复杂度的框架分解成计算效率高的子问题与瞬时和统计CSI分别处理。与现有的迭代算法相比,离线预训练的神经网络在保持几乎相同性能的情况下,大大降低了预编码的在线计算复杂性。

英文摘要:

In this paper, we consider massive multiple-input-multiple-output (MIMO) communication systems with a uniform planar array (UPA) at the base station (BS) and investigate the downlink precoding with imperfect channel state information (CSI). By exploiting both instantaneous and statistical CSI, we aim to design precoding vectors to maximize the ergodic rate (e.g., sum rate, minimum rate and etc.) subject to a total transmit power constraint. To maximize an upper bound of the ergodic rate, we leverage the corresponding Lagrangian formulation and identify the structural characteristics of the optimal precoder as the solution to a generalized eigenvalue problem. As such, the high-dimensional precoder design problem turns into a low-dimensional power control problem. The Lagrange multipliers play a crucial role in determining both precoder directions and power parameters, yet are challenging to be solved directly. To figure out the Lagrange multipliers, we develop a general framework underpinned by a properly designed neural network that learns directly from CSI. To further relieve the computational burden, we obtain a low-complexity framework by decomposing the original problem into computationally efficient subproblems with instantaneous and statistical CSI handled separately. With the off-line pretrained neural network, the online computational complexity of precoding is substantially reduced compared with the existing iterative algorithm while maintaining nearly the same performance.

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

↑