Abstract:

Baed on decoding performance, complexity and latency of low density parity check (LDPC) codes, a lowcomplexity parallel decoding algorithm was proposed. By simplifying the message sent from check nodes to bit nodes, the complexity of the algorithm approaches that of the “minisum” algorithm. Simulation results show that the performance is very close to belief propagation algorithm in performance.

Key words: low density parity check code, bipartite graph, belief propagation algorithm