Gradient Descent Bit Flipping Algorithms for Decoding LDPC Codes
Tadashi Wadayama, Keisuke Nakamura, Masayuki Yagita, Yuuki Funahashi,, Shogo Usami, Ichi Takumi

TL;DR
This paper introduces gradient descent bit flipping algorithms for LDPC code decoding, offering a simplified and gradient-based approach derived from a non-linear objective function.
Contribution
It presents a new class of BF algorithms called GDBF, which are derived from a gradient descent framework for LDPC decoding.
Findings
Effective decoding performance demonstrated
Simplified algorithm structure compared to traditional methods
Theoretical foundation from gradient descent formulation
Abstract
A novel class of bit-flipping (BF) algorithms for decoding low-density parity-check (LDPC) codes is presented. The proposed algorithms, which are called gradient descent bit flipping (GDBF) algorithms, can be regarded as simplified gradient descent algorithms. Based on gradient descent formulation, the proposed algorithms are naturally derived from a simple non-linear objective function.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsError Correcting Code Techniques · Advanced Wireless Communication Techniques · Telecommunications and Broadcasting Technologies
