Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2005, Vol. 28 ›› Issue (5): 59-61.doi: 10.13190/jbupt.200505.59.381

• Papers • Previous Articles     Next Articles

Parallel Decoding Algorithm of LowDensity ParityCheck Codes

LIN Xuehong,WU Weiling   

  1. School of Information Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Online:2005-10-28 Published:2005-10-28

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

CLC Number: