Adaptive threshold technique for bit-flipping decoding of low-density parity-check codes

Authors:
Junho Cho;Wonyong Sung
Affiliations:
School of Electrical Engineering and Computer Science, Seoul National University, Seoul, Korea;School of Electrical Engineering and Computer Science, Seoul National University, Seoul, Korea
Venue:
IEEE Communications Letters
Year:
2010

Citing 4
Cited 0

Factor graphs and the sum-product algorithm

IEEE Transactions on Information Theory
The capacity of low-density parity-check codes under message-passing decoding

IEEE Transactions on Information Theory
Low-density parity-check codes based on finite geometries: a rediscovery and new results

IEEE Transactions on Information Theory
Improved bit-flipping decoding of low-density parity-check codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The bit-flipping (BF) algorithm for decoding of low-density parity-check (LDPC) codes requires less complex hardware than other decoding algorithms, but its error correcting performance needs to be improved. In this letter, a threshold adaptation scheme is applied to BF algorithm based decoding of LDPC codes. Our experiments show that the optimal threshold value for BF depends on the error conditions, and threshold adjustment during decoding helps to prevent meaningless no-flipping iterations. Based on these statistical observations, the adaptive threshold technique is proposed to pursue both the maximum error correcting capability and the fastest decoding convergence.