Abstract—This paper considers error probability of much
larger absolute value symbols about reliability rate based
weighted bit-flipping (RRWBF) algorithm of low density
parity check code (LDPC). RRWBF owns better performance
and effective practicability, compared with weighted bit
flipping algorithm (WBF). This paper proposes a modified
version of this algorithm, multi-bit-threshold rate based
weighted bit flipping about LDPC decoding algorithm
(MTRWBF). The scheme solved for RRWBF and its modified
algorithms only consider flipping greater weight and slurs the
importance of the absolute value of symbols. This algorithm
turns a plurality of bits every time, which overcomes
shortcomings that IRRWBF decoding convergence speed is too
slow. Simulation results showed that the improved version
greatly fastens simulation speed, observable reduces the
decoding iterations and improves decoding performance.
Compared with RRWBF, the error ratio of the MTRWBF
with 5dB is improved from 103 to 104 as proved by
simulation results.
Index Terms—Low density parity check code (LDPC),
iterative decoding, weighted bit-flipping (WBF), reliability
rate.
The authors are with the School of Electronic Science and Engineering,
Nanjing University, Nanjing 210023, China (e-mail: zln654321@163.com,
yezh@nju.edu.cn, xiaoyehouzi@126.com).
[PDF]
Cite:Lina Zhang, Zhihui Ye, and Qi Feng, "An Improved Multi-Bit Threshold Flipping LDPC Decoding Algorithm," International Journal of Computer Theory and Engineering vol. 6, no. 6, pp. 510-514, 2014.