Joint Detection and Decoding: A Graph Neural Network Approach
Jannis Clausius, Marvin R\"ubenacke, Daniel Tandler, Stephan ten Brink

TL;DR
This paper introduces a graph neural network-based method for joint detection and decoding in communication channels, improving robustness and performance over traditional algorithms, especially under cycle and channel uncertainty conditions.
Contribution
It proposes a novel GNN architecture for joint detection and decoding that is robust to cycles and channel uncertainties, enabling end-to-end deep learning optimization.
Findings
GNN outperforms SPA-based detection in cycle and CSI uncertainty scenarios.
Achieves 6.25 dB gain in high-order modulation turbo detection.
Parallel flooding schedule reduces latency and enhances error correction.
Abstract
Narrowing the performance gap between optimal and feasible detection in inter-symbol interference (ISI) channels, this paper proposes to use graph neural networks (GNNs) for detection that can also be used to perform joint detection and decoding (JDD). For detection, the GNN is build upon the factor graph representations of the channel, while for JDD, the factor graph is expanded by the Tanner graph of the parity-check matrix (PCM) of the channel code, sharing the variable nodes (VNs). A particularly advantageous property of the GNN is a) the robustness against cycles in the factor graphs which is the main problem for sum-product algorithm (SPA)-based detection, and b) the robustness against channel state information (CSI) uncertainty at the receiver. Additionally, we propose using an input embedding resulting in a GNN independent of the channel impulse response (CIR). Consequently, a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications
