학술논문

Deep Graph Unfolding for Beamforming in MU-MIMO Interference Networks
Document Type
Periodical
Source
IEEE Transactions on Wireless Communications IEEE Trans. Wireless Commun. Wireless Communications, IEEE Transactions on. 23(5):4889-4903 May, 2024
Subject
Communication, Networking and Broadcast Technologies
Computing and Processing
Signal Processing and Analysis
Array signal processing
Interference
Wireless networks
Tensors
Ad hoc networks
Transmitters
Optimization
Beamforming
WMMSE
algorithm unfolding
complex-valued graph neural networks
Language
ISSN
1536-1276
1558-2248
Abstract
We develop an efficient and near-optimal solution for beamforming in multi-user multiple-input-multiple-output single-hop wireless ad-hoc interference networks. Inspired by the weighted minimum mean squared error (WMMSE) method, a classical approach to solving this problem, and the principle of algorithm unfolding, we present unfolded WMMSE (UWMMSE) for MU-MIMO. This method learns a parameterized functional transformation of key WMMSE variables using graph neural networks (GNNs), where the channel and interference components of a wireless network constitute the underlying graph. These GNNs are trained through gradient descent on a network utility metric using multiple instances of the beamforming problem. Comprehensive experimental analyses illustrate the superiority of UWMMSE over the classical WMMSE and state-of-the-art learning-based methods in terms of performance, generalizability, and robustness.