Belief-Propagation Decoding of LDPC Codes with Variable Node-Centric Dynamic Schedules

02/22/2021
by   Tofar C. -Y. Chang, et al.
0

Belief propagation (BP) decoding of low-density parity-check (LDPC) codes with various dynamic decoding schedules have been proposed to improve the efficiency of the conventional flooding schedule. As the ultimate goal of an ideal LDPC code decoder is to have correct bit decisions, a dynamic decoding schedule should be variable node (VN)-centric and be able to find the VNs with probable incorrect decisions and having a good chance to be corrected if chosen for update. We propose a novel and effective metric called conditional innovation (CI) which serves this design goal well. To make the most of dynamic scheduling which produces high-reliability bit decisions, we limit our search for the candidate VNs to those related to the latest updated nodes only. Based on the CI metric and the new search guideline separately or in combination, we develop several highly efficient decoding schedules. To reduce decoding latency, we introduce multi-edge updating versions which offer extra latency-performance tradeoffs. Numerical results show that both single-edge and multi-edge algorithms provide better decoding performance against most dynamic schedules and the CI-based algorithms are particularly impressive at the first few decoding iterations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/20/2022

Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices

The recent success in constructing asymptotically good quantum low-densi...
research
04/01/2018

Adaptive Group Shuffled Decoding for LDPC Codes

We propose new grouping methods for group shuffled (GS) decoding of both...
research
11/26/2020

Generalized Mutual Information-Maximizing Quantized Decoding of LDPC Codes

In this paper, we propose a general framework of the mutual infomration-...
research
03/24/2023

An Optimization Model for Offline Scheduling Policy of Low-density Parity-check Codes

In this study, an optimization model for offline scheduling policy of lo...
research
02/01/2022

Automorphism Ensemble Decoding of Quasi-Cyclic LDPC Codes by Breaking Graph Symmetries

We consider automorphism ensemble decoding (AED) of quasi-cyclic (QC) lo...
research
10/12/2020

Learning to Decode: Reinforcement Learning for Decoding of Sparse Graph-Based Channel Codes

We show in this work that reinforcement learning can be successfully app...
research
07/26/2023

Reinforcement Learning for Sequential Decoding of Generalized LDPC Codes

In this work, we propose reinforcement learning (RL) for sequential deco...

Please sign up or login with your details

Forgot password? Click here to reset