201. Multiple candidates bit-flipping algorithms for decoding LDPC codes
- Author
-
Chunjuan Diao, Zhiliang Huang, Hua-Min Chen, and Ming Chen
- Subjects
Set (abstract data type) ,Scheme (programming language) ,Bit (horse) ,Computer science ,Probability of error ,Electrical and Electronic Engineering ,Low-density parity-check code ,Algorithm ,computer ,Decoding methods ,computer.programming_language - Abstract
This letter proposes an effective scheme to improve the error performance of conventional bit-flipping BF algorithms for decoding low-density parity-check codes. The proposed scheme, which is referred to as the multiple-candidates MC scheme, constructs a set of candidates for the starting vector of the iterative decoding procedure. Each candidate vector in the set is generated by randomly flipping several high error probability bits of the original hard-decision vector. Simulation results show that two typical BF algorithms applying the MC scheme achieve noticeable gains over the original BF algorithms with moderate increase in computational cost. Copyright © 2012 John Wiley & Sons, Ltd.
- Published
- 2012