Abstract

For LDPC decoding, bit-flipping (BF) algorithms are much simpler than the min-sum algorithms (MSA). However, BF algorithms have the disadvantages of poorer performances and higher iteration counts than MSA. To increase the BF performances, this paper presents a novel BF algorithm, called Low-Correlation Multibit-flipping (LCMBF) algorithm, which flips more than one bit in each iteration. High performances are achieved by flipping those bits with low correlation as much as possible. As such, the chances of introducing additional error bits are greatly reduced. Overall, the proposed algorithm achieves better BER performances and requires less iteration numbers than conventional BF algorithms.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call