Pith. sign in

REVIEW 1 cited by

Graph Neural Networks for Channel Decoding

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

arxiv 2207.14742 v2 pith:HDHXRZIY submitted 2022-07-29 cs.IT cs.LGmath.IT

classification cs.ITcs.LGmath.IT
keywords decodingchannelcodesgraphneuralcodecompetitiveconventional
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this work, we propose a fully differentiable graph neural network (GNN)-based architecture for channel decoding and showcase a competitive decoding performance for various coding schemes, such as low-density parity-check (LDPC) and BCH codes. The idea is to let a neural network (NN) learn a generalized message passing algorithm over a given graph that represents the forward error correction (FEC) code structure by replacing node and edge message updates with trainable functions. Contrary to many other deep learning-based decoding approaches, the proposed solution enjoys scalability to arbitrary block lengths and the training is not limited by the curse of dimensionality. We benchmark our proposed decoder against state-of-the-art in conventional channel decoding as well as against recent deep learning-based results. For the (63,45) BCH code, our solution outperforms weighted belief propagation (BP) decoding by approximately 0.4 dB with significantly less decoding iterations and even for 5G NR LDPC codes, we observe a competitive performance when compared to conventional BP decoding. For the BCH codes, the resulting GNN decoder can be fully parametrized with only 9640 weights.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. 5G LDPC Linear Transformer for Channel Decoding

    cs.LG 2025-01 conditional novelty 5.0 of 10

    A linear-attention transformer decoder achieves bit error rate comparable to a standard transformer and better than one-iteration belief propagation on 5G NR LDPC codes, with O(n) instead of O(n^2) complexity.

Pith tools