Low complexity iterative decoding algorithm for low-density parity-check (LDPC) codes

The reliability ratio weighted based bit-flipping (RRWBF) algorithm for decoding low-density parity-check (LDPC) codes has recently been developed to provide the best performance among all existing bit-flipping based algorithms. The implementation efficient reliability ratio weighted based bit-flipping (IERRWBF) algorithm speedup the original algorithm to decrease the processing time used. A drawback for this algorithm is the decrease in the improvement as the maximum number of iterations assigned for the algorithm increase as a large percentage of decoding time is spent on the iteration part without any change in the performance. In this paper, a modified version for this algorithm is proposed to solve this drawback by reducing the number of iterations required to achieve the same performance of the existing IERRWBF algorithm using efficient number of iterations instead of using the maximum number of iterations for decoding without any change in the performance of the IERRWBF.