REVIEW 2 cited by
Graph Neural Networks for Massive MIMO Detection
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
In this paper, we innovately use graph neural networks (GNNs) to learn a message-passing solution for the inference task of massive multiple multiple-input multiple-output (MIMO) detection in wireless communication. We adopt a graphical model based on the Markov random field (MRF) where belief propagation (BP) yields poor results when it assumes a uniform prior over the transmitted symbols. Numerical simulations show that, under the uniform prior assumption, our GNN-based MIMO detection solution outperforms the minimum mean-squared error (MMSE) baseline detector, in contrast to BP. Furthermore, experiments demonstrate that the performance of the algorithm slightly improves by incorporating MMSE information into the prior.
Forward citations
Cited by 2 Pith papers
-
Joint Detection and Decoding: A Graph Neural Network Approach
Graph neural networks operating on channel factor graphs and code Tanner graphs achieve near-optimal detection and joint detection and decoding on ISI channels, outperforming feasible classical baselines.
-
Graph Neural Network Aided Detection for the Multi-User Multi-Dimensional Index Modulated Uplink
GNN-augmented AMP and expectation propagation detectors approach ML BER in simulated compressed-sensing space-frequency index modulated multi-user MIMO uplinks, while tolerating varying numbers of active users.
Discussion (0). Continue with ORCID to comment.