论文标题
迭代算法引起的深度链接神经网络:多源MIMO系统的预编码设计
Iterative Algorithm Induced Deep-Unfolding Neural Networks: Precoding Design for Multiuser MIMO Systems
论文作者
论文摘要
优化理论辅助算法在多源多输入多输出(MU-MIMO)系统中的预编码设计方面受到了极大的关注。尽管最终的优化算法能够提供出色的性能,但它们通常需要相当大的计算复杂性,这会阻碍其在实时系统中的实际应用。在这项工作中,为了解决这个问题,我们首先提出了一个深度折叠框架的框架,其中一般形式的迭代算法诱导的深度解释神经网络(IAIDNN)以基质形式开发,以更好地解决通信系统中的问题。然后,我们实施了提出的DeepunFolding框架,以解决MU-MIMO系统中预编码设计的总和最大化问题。开发了基于经典加权最小均电误差(WMMSE)迭代算法的结构的有效IAIDNN。具体而言,将迭代的WMMSE算法展开为层结构,其中引入了许多可训练的参数以替换正向传播中的高复杂性操作。为了训练网络,提出了IAIDNN的广义链规则来描述背面传播中两个相邻层之间梯度的复发关系。此外,我们讨论了所提出的方案的计算复杂性和概括能力。仿真结果表明,提出的IAIDNN有效地实现了迭代WMMSE算法的性能,并具有降低的计算复杂性。
Optimization theory assisted algorithms have received great attention for precoding design in multiuser multiple-input multiple-output (MU-MIMO) systems. Although the resultant optimization algorithms are able to provide excellent performance, they generally require considerable computational complexity, which gets in the way of their practical application in real-time systems. In this work, in order to address this issue, we first propose a framework for deep-unfolding, where a general form of iterative algorithm induced deep-unfolding neural network (IAIDNN) is developed in matrix form to better solve the problems in communication systems. Then, we implement the proposed deepunfolding framework to solve the sum-rate maximization problem for precoding design in MU-MIMO systems. An efficient IAIDNN based on the structure of the classic weighted minimum mean-square error (WMMSE) iterative algorithm is developed. Specifically, the iterative WMMSE algorithm is unfolded into a layer-wise structure, where a number of trainable parameters are introduced to replace the highcomplexity operations in the forward propagation. To train the network, a generalized chain rule of the IAIDNN is proposed to depict the recurrence relation of gradients between two adjacent layers in the back propagation. Moreover, we discuss the computational complexity and generalization ability of the proposed scheme. Simulation results show that the proposed IAIDNN efficiently achieves the performance of the iterative WMMSE algorithm with reduced computational complexity.