Reduced Complexity Decoding Algorithm of LDPC Codes using Node Elimination

We propose a modified belief propagation algorithm that uses node elimination for bit nodes of large log-likelihood ratio. With this algorithm, we can reduce decoding complexity and improve performance by enhancing the cycle properties. Simulation results show that the decoding complexity is reduced and the proposed algorithm outperforms the belief propagation algorithm in the high-E_b/N_o region