Generalized Adaptive Diversity Gradient Descent Bit-Flipping with a Finite State Machine

In this paper, we introduce a novel gradient descent bit-flipping algorithm with a finite state machine (GDBF-wSM) for iterative decoding of low-density parity-check (LDPC) codes. The algorithm utilizes a finite state machine to update variable node potentials-for each variable node, the corresponding finite state machine adjusts the update value based on whether the node was a candidate for flipping in previous iterations. We also present a learnable framework that can optimize decoder parameters using a database of uncorrectable error patterns. The performance of the proposed algorithm is illustrated for various regular LDPC codes, both in a binary symmetric channel (BSC) and the channel with additive white Gaussian noise (AWGN). The numerical results indicate a performance improvement when comparing our algorithm to previously proposed GDBF-based approaches.

Authors

Institutions

Publication Details

Journal
Entropy
Published
2025-01-09
DOI
https://doi.org/10.3390/e27010049
Primary Topic
Error Correcting Code Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Generalized Adaptive Diversity Gradient Descent Bit-Flipping with a Finite State Machine

Srđan Brkić, Bane Vasić, Predrag Ivaniš, Jovan Milojković
Entropy
Error Correcting Code Techniques
article

Generalized Adaptive Diversity Gradient Descent Bit-Flipping with a Finite State Machine

Srđan Brkić, Bane Vasić, Predrag Ivaniš, Jovan Milojković
article en

Abstract

In this paper, we introduce a novel gradient descent bit-flipping algorithm with a finite state machine (GDBF-wSM) for iterative decoding of low-density parity-check (LDPC) codes. The algorithm utilizes a finite state machine to update variable node potentials-for each variable node, the corresponding finite state machine adjusts the update value based on whether the node was a candidate for flipping in previous iterations. We also present a learnable framework that can optimize decoder parameters using a database of uncorrectable error patterns. The performance of the proposed algorithm is illustrated for various regular LDPC codes, both in a binary symmetric channel (BSC) and the channel with additive white Gaussian noise (AWGN). The numerical results indicate a performance improvement when comparing our algorithm to previously proposed GDBF-based approaches.

EntropyVol. 27(1)
University of Arizona (US), University of Belgrade (RS)
National Science Foundation, Science Fund of the Republic of Serbia, Division of Electrical, Communications and Cyber Systems
Openalex Percentile: Top 100%
Error Correcting Code Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Generalized Adaptive Diversity Gradient Descent Bit-Flipping with a Finite State Machine — Srđan Brkić, Bane Vasić, et al. · Entropy (2025) | TGRS Research Map | TGRS