Table of Contents
Fetching ...

Precoder Learning for Weighted Sum Rate Maximization

Mingyu Deng, Shengqian Han

TL;DR

This work tackles weighted sum-rate maximization (WSRM) in multiuser MIMO downlinks by designing a deep neural network that respects joint unitary and permutation equivariance, enabling efficient precoder learning with UE weights. Linear weight formulations fail to capture the weight-induced policy, so the authors introduce a nonlinear weight function learned via a dedicated Edge-GNN sub-network that operates on pairwise interaction features $E_1=h_i^H x_j^{(l-1)}$ and $E_2=\alpha_i h_i^H x_j^{(l-1)}$, while preserving the symmetries. The proposed approach demonstrates superior learning and generalization performance compared with baselines (WMMSE, Model-GNN, Edge-GNN, Graph-transformer, EGAT) and achieves lower training and inference complexity. The work advances practical precoder learning for fair, low-latency downlink transmissions by embedding structural priors directly into the network design.

Abstract

Weighted sum rate maximization (WSRM) for precoder optimization effectively balances performance and fairness among users. Recent studies have demonstrated the potential of deep learning in precoder optimization for sum rate maximization. However, the WSRM problem necessitates a redesign of neural network architectures to incorporate user weights into the input. In this paper, we propose a novel deep neural network (DNN) to learn the precoder for WSRM. Compared to existing DNNs, the proposed DNN leverage the joint unitary and permutation equivariant property inherent in the optimal precoding policy, effectively enhancing learning performance while reducing training complexity. Simulation results demonstrate that the proposed method significantly outperforms baseline learning methods in terms of both learning and generalization performance while maintaining low training and inference complexity.

Precoder Learning for Weighted Sum Rate Maximization

TL;DR

This work tackles weighted sum-rate maximization (WSRM) in multiuser MIMO downlinks by designing a deep neural network that respects joint unitary and permutation equivariance, enabling efficient precoder learning with UE weights. Linear weight formulations fail to capture the weight-induced policy, so the authors introduce a nonlinear weight function learned via a dedicated Edge-GNN sub-network that operates on pairwise interaction features and , while preserving the symmetries. The proposed approach demonstrates superior learning and generalization performance compared with baselines (WMMSE, Model-GNN, Edge-GNN, Graph-transformer, EGAT) and achieves lower training and inference complexity. The work advances practical precoder learning for fair, low-latency downlink transmissions by embedding structural priors directly into the network design.

Abstract

Weighted sum rate maximization (WSRM) for precoder optimization effectively balances performance and fairness among users. Recent studies have demonstrated the potential of deep learning in precoder optimization for sum rate maximization. However, the WSRM problem necessitates a redesign of neural network architectures to incorporate user weights into the input. In this paper, we propose a novel deep neural network (DNN) to learn the precoder for WSRM. Compared to existing DNNs, the proposed DNN leverage the joint unitary and permutation equivariant property inherent in the optimal precoding policy, effectively enhancing learning performance while reducing training complexity. Simulation results demonstrate that the proposed method significantly outperforms baseline learning methods in terms of both learning and generalization performance while maintaining low training and inference complexity.

Paper Structure

This paper contains 13 sections, 1 theorem, 18 equations, 5 figures, 1 table.

Key Result

Proposition 1

The function ${{ \overline{\mathcal{G}}^{\left( l \right)}\left( {{\mathbf{X}}^{\left( l-1 \right)}}, \mathbf{H}, \mathbf{\Lambda} \right)}}$ can be expressed in terms of the elements $\mathbf{h}_{i}^{\text{H}}\mathbf{x}_{j}^{\left( l-1 \right)}$ and ${{\alpha }_{i}}\mathbf{h}_{i}^{\text{H}}\mathbf{ where $\mathsf{\mathcal{G}}^{\left( l \right)}(\cdot)$ is a function of $\mathbf{E}_1, \mathbf{E}_2

Figures (5)

  • Figure 1: Learning performance at different cell-edge SNRs with $K=16$ and $N=32$.
  • Figure 2: CDF of the average rates of UEs.
  • Figure 3: Generalization performance to the number of UEs with $N=32$.
  • Figure 4: Generalization performance to the number of antennas with $K=16$.
  • Figure 5: CDF of the average rates of UEs with generalization.

Theorems & Definitions (1)

  • Proposition 1