Intensity Reflection Coefficient Based Min-Sum Decoding for Low Density Parity Check Codes

Low Density Parity Check Codes (LDPC) give groundbreaking performance which is known to approach Shannon’s limits for sufficiently large block length. Historically and recently, LDPC have been known to give superior performance than concatenated coding. In the following paper, a proposal to modify the standard Min-Sum (MS) algorithm for decoding LDPC codes is presented. This is done by introduction of a factor, intensity reflection coefficient (IRC), in the check to bit node updating process. Simulation results demonstrate that the proposed algorithms are effective in imparting a better performance in terms of a lower bit error rate (BER) at low to medium signal to noise ratio (SNR) when compared to the traditional MS or Belief Propagation (BP) algorithm while adding a minimum amount of complexity. The proposed algorithm results in a reduced hardware complexity when implemented in VLSI.