RL-Based Parallel LDPC Decoding with Clustered Scheduling

Yusuf Ozkan

doi:10.3390/e28020215

Return

RL-Based Parallel LDPC Decoding with Clustered Scheduling

2026-02-12

PRE

Yusuf Ozkan

Yakimenka, Yauhen *

Jörg Kliewer

DOI：10.3390/e28020215

Original

Original request for help

Save

Abstract

En 中文

We propose a reinforcement learning (RL)-based decoding framework for high-throughput parallel decoding of low-density parity-check (LDPC) codes using clustered scheduling. Parallel LDPC decoders must balance error-correction performance and decoding latency while avoiding memory conflicts. To address this trade-off, we construct clusters of check nodes that satisfy a two-edge independence property, which enables conflict-free row-parallel belief propagation. An RL agent is trained offline to assign Q-values to clusters and to prioritize their update order during decoding. To overcome the exponential storage requirements of existing RL-based scheduling methods, we introduce the Q-Sum method, which approximates cluster-level Q-values as the sum of Q-values of individual check nodes, reducing storage complexity from exponential to linear in the number of check nodes. We further propose an On-the-Fly clustering strategy that enforces two-edge independence dynamically during decoding and provides additional flexibility when static clustering is not feasible. Simulation results for array-based LDPC codes over additive white Gaussian noise (AWGN) channels show that the proposed methods improve the latency-versus-performance trade-off of parallel LDPC decoders, achieving lower decoding latency and higher throughput while maintaining error rates comparable to state-of-the-art decoding methods.

Keywords:

high-throughput decoding

message-passing scheduling

error-correcting codes

low-density parity-check codes

reinforcement learning