Learning Optimal Linear Precoding for Cell-Free Massive MIMO with GNN

Benjamin Parlier, Lou Salaün, Hong Yang
6/6/2024
eess.SPcs.AIcs.LG

No official code found. Best implementation: Nokia-Bell-Labs/olp-gnn (11 stars, BSD-3-Clause-Clear, last commit 2025-03-22).

Abstract

We develop a graph neural network (GNN) to compute, within a time budget of 1 to 2 milliseconds required by practical systems, the optimal linear precoder (OLP) maximizing the minimal downlink user data rate for a Cell-Free Massive MIMO system - a key 6G wireless technology. The state-of-the-art method is a bisection search on second order cone programming feasibility test (B-SOCP) which is a magnitude too slow for practical systems. Our approach relies on representing OLP as a node-level prediction task on a graph. We construct a graph that accurately captures the interdependence relation between access points (APs) and user equipments (UEs), and the permutation equivariance of the Max-Min problem. Our neural network, named OLP-GNN, is trained on data obtained by B-SOCP. We tailor the OLP-GNN size, together with several artful data preprocessing and postprocessing methods to meet the runtime requirement. We show by extensive simulations that it achieves near optimal spectral efficiency in a range of scenarios with different number of APs and UEs, and for both line-of-sight and non-line-of-sight radio propagation environments.

View on arXivView PDF

Code Implementations(1)

BSD-3-Clause-Clear
113PythonMay 29, 20241 years agoBSD-3-Clause-Clear

Similar Papers

Cite this paper

@article{parlier2024learning,
  title  = {Learning Optimal Linear Precoding for Cell-Free Massive MIMO with GNN},
  author = {Benjamin Parlier and Lou Salaün and Hong Yang},
  year   = {2024},
  eprint = {2406.04456},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2406.04456v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2406.04456.svg)](https://codeofpaper.com/paper/2406.04456)

Discussion