Bit-flipping Algorithm Research Articles

Bootstrap decoding of low-density parity-check codes

An initial bootstrap step for the decoding of low-density parity-check (LDPC) codes is proposed. Decoding is initiated by first erasing a number of less reliable bits. New values and reliabilities are then assigned to erasure bits by passing messages from nonerasure bits through the reliable check equations. The bootstrap step is applied to the weighted bit-flipping algorithm to decode a number of LDPC codes. Large improvements in both performance and complexity are observed.

Decoding of generalised low-density parity-check codes using weighted bit-flip voting

A generalised low-density parity-check code (GLDPC) is a low-density parity-check code in which the constraint nodes of the code's graph are replaced with component or subcodes other than single parity checks. Gallager's bit-flipping algorithm for LDPCs is generalised to the class of GLDPCs with Hamming subcodes. The proposed weighted bit-flip voting (WBFV) method is iterative and uses only the hard decision decoder of the Hamming subcodes. Decoding of Hamming-based GLDPCs using WBFV has been simulated on the binary symmetric channel. Simulation results are presented showing the variation in performance with voting rule, graph construction and block length. In terms of the dependence of coding gains and complexity on the GLDPC block length, the proposed method is found to display a good performance to decoding complexity trade-off. Performance is found to compete well with other more conventional hard decision decoding schemes.