Channel-Aware Gradient Descent Bit-Flipping Algorithm for LDPC Codes

The gradient descent bit-flipping with momentum (GDBF-w/M) and probabilistic GDBF-w/M (PGDBF-w/M) algorithms significantly improve the decoding performance of the bit-flipping (BF) algorithm. In this letter, we propose a channel-aware GDBF-w/M algorithm which operates deterministically based on the...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters Vol. 29; no. 4; pp. 809 - 813
Main Authors: Min, Woohong, Yang, Kyeongcheol
Format: Journal Article
Language:English
Published: New York IEEE 01.04.2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
AWGN channels
bit-flipping algorithm
Decoding
decoding algorithms
Indexes
Iterative decoding
LDPC codes
Maximum likelihood decoding
Optimization
Probabilistic logic
Random noise
Random numbers
Reliability
Training
Vectors
ISSN:1089-7798, 1558-2558
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The gradient descent bit-flipping with momentum (GDBF-w/M) and probabilistic GDBF-w/M (PGDBF-w/M) algorithms significantly improve the decoding performance of the bit-flipping (BF) algorithm. In this letter, we propose a channel-aware GDBF-w/M algorithm which operates deterministically based on the received values from the additive white Gaussian noise (AWGN) channel. Numerical results show that the proposed algorithm does not only mitigate the error-floor phenomenon of the GDBF-w/M algorithm, but it also has better decoding performance than the PGDBF-w/M algorithm without the need for a random number generator. Furthermore, the complexity of the proposed algorithm is slightly higher than that of the GDBF-w/M algorithm.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2025.3543897