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
- Srđan Brkić (ORCID: https://orcid.org/0000-0002-9815-0650)
- Bane Vasić (ORCID: https://orcid.org/0000-0003-2365-4106)
- Predrag Ivaniš (ORCID: https://orcid.org/0000-0003-4565-1141)
- Jovan Milojković (ORCID: https://orcid.org/0009-0008-7555-3896)
Institutions
- University of Arizona (US)
- University of Belgrade (RS)
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
- National Science Foundation
- Science Fund of the Republic of Serbia
- Division of Electrical, Communications and Cyber Systems