Abstract:

Extensive simulations show that for some low density paritycheck (LDPC) codes of low row/colum weight, the modified sum of the magnitude based weighted bit flipping (MSMWBF) decoding algorithm performs extraordinarily well. However, this dose not hold when it comes to large row/colum weight finitegeometry LDPC codes,which is first theoretically analyzed. Secondly,improvement in performance is observed for large row/colum weight LDPC codes by considering an additive offset term for the parity check equation reliability of the above algorithm. Simulation results show that the performance of the improved scheme is better than that of the MSMWBF algorithm about 0.63 dB at bit error rate of 10E-5 over the additive white Gaussian noise channel with only a modest increase in computational complexity.