A Scalable Graph Neural Network Decoder for Short Block Codes
Not on the map. Why?
Abstract (arXiv)
In this work, we propose a novel decoding algorithm for short block codes based on an edge-weighted graph neural network (EW-GNN). The EW-GNN decoder operates on the Tanner graph with an iterative message-passing structure, which algorithmically aligns with the conventional belief propagation (BP) decoding method. In each iteration, the "weight" on the message passed along each edge is obtained from a fully connected neural network that has the reliability information from nodes/edges as its input. Compared to existing deep-learning-based decoding schemes, the EW-GNN decoder is characterised by its scalability, meaning that 1) the number of trainable parameters is independent of the codeword length, and 2) an EW-GNN decoder trained with shorter/simple codes can be directly used for longer/sophisticated codes of different code rates. Furthermore, simulation results show that the EW-GNN decoder outperforms the BP and deep-learning-based BP methods from the literature in terms of the decoding error rate.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 9 of its 24 references that are in the map. First posted on arXiv 13 Nov 2022.
Builds on
9 of 24 references.
References · 9
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2017Neural Message Passing for Quantum Chemistrycited by 3,487
- 2019A Comprehensive Survey on Graph Neural Networkscited by 2,919
- 2019What Can Neural Networks Reason About?cited by 159
- 2017Deep Learning Methods for Improved Decoding of Linear Codescited by 66
- 2016Learning to Decode Linear Codes Using Deep Learningcited by 61
- 2019Hyper-Graph-Network Decoders for Block Codescited by 42
- 2020Pruning Neural Belief Propagation Decoderscited by 10
- 2022Neural Decoding with Optimization of Node Activationscited by 4
Built on by
Not cited yet.