Dynamic Weighted Bit-Flipping Decoding Algorithms for LDPC Codes
Tofar C.-Y. Chang, Yu T. Su

TL;DR
This paper introduces novel dynamic weighted bit-flipping algorithms for LDPC decoding, enhancing performance and complexity tradeoffs by updating checksum weights and selection rules based on node reliabilities.
Contribution
It proposes new flipping functions, selection rules, and update schedules that improve decoding performance while maintaining low complexity.
Findings
New decoders outperform traditional BF algorithms.
Performance comparable to normalized min-sum algorithm.
Reduced complexity with minimal performance loss.
Abstract
Bit-flipping (BF) decoding of low-density parity-check codes is of low complexity but gives inferior performance in general. To improve performance and provide new BF decoder options for complexity-performance tradeoffs, we propose new designs for the flipping function (FF), the flipped bit selection (FBS) rule and the checksum weight updating schedule. The new FF adjusts the checksum weights in every iteration while our FBS rules take more information into account. These two modifications represent efforts to track more closely the evolutions of both check and variable nodes' reliabilities. Two selective update schedules are proposed to offer more performance and complexity tradeoffs. The combinations of the new FBS rule and known FFs result in new BF decoders with improved performance and a modest complexity increase. On the other hand, combining the new FF and FBS rule gives a new…
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.
