Soft Graph Transformer for MIMO Detection
Not on the map. Why?
Abstract (arXiv)
We propose the Soft Graph Transformer (SGT), a soft-input-soft-output neural architecture designed for MIMO detection. While Maximum Likelihood (ML) detection achieves optimal accuracy, its exponential complexity makes it infeasible in large systems, and conventional message-passing algorithms rely on asymptotic assumptions that often fail in finite dimensions. Recent Transformer-based detectors show strong performance but typically overlook the MIMO factor graph structure and cannot exploit prior soft information. SGT addresses these limitations by combining self-attention, which encodes contextual dependencies within symbol and constraint subgraphs, with graph-aware cross-attention, which performs structured message passing across subgraphs. Its soft-input interface allows the integration of auxiliary priors, producing effective soft outputs while maintaining computational efficiency. Experiments demonstrate that SGT achieves near-ML performance and offers a flexible and interpretable framework for receiver systems that leverage soft priors.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 10 of its 26 references that are in the map. First posted on arXiv 16 Sep 2025.
Builds on
10 of 26 references.
References · 10
- 2017Attention Is All You Needcited by 60,361
- 2017Neural Message Passing for Quantum Chemistrycited by 3,487
- 2022Sionna: An Open-Source Library for Next-Generation Physical Layer Researchcited by 145
- 2022Error Correction Code Transformercited by 47
- 2017Deep MIMO Detectioncited by 26
- 2024CrossMPT: Cross-attention Message-Passing Transformer for Error Correcting Codescited by 21
- 2020RE-MIMO: Recurrent and Permutation Equivariant Neural MIMO Detectioncited by 20
- 2020Memory AMPcited by 9
- 2022GNN-Enhanced Approximate Message Passing for Massive/Ultra-Massive MIMO Detectioncited by 4
- 2024Graph Neural Network-based Joint Equalization and Decodingcited by 2
Built on by
Citing papers per year: 2026: 3.
3 papers.