Density evolution for two improved BP-Based decoding algorithms of LDPC codes

• Published in: IEEE communications letters Vol. 6; no. 5; pp. 208 - 210
• Main Authors: Chen, J., Fossorier, M.P.C.
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.05.2002; Institute of Electrical and Electronics Engineers; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithm design and analysis; Algorithms; Applied sciences; Back propagation; Belief propagation; Coding, codes; Convergence; Decoding; Degradation; Density; Evolution; Exact sciences and technology; Information, signal and communications theory; Iterative algorithms; Iterative decoding; Mathematical analysis; Optimization; Parity check codes; Performance analysis; Performance enhancement; Random variables; Signal and communications theory; Sum product algorithm; Telecommunications and information theory; Performance evaluation; Block code; Simulation; Signal processing; Iterative method; Decoding; Algorithm
• ISSN: 1089-7798; 1558-2558
• DOI: 10.1109/4234.1001666

In this letter, we analyze the performance of two improved belief propagation (BP) based decoding algorithms for LDPC codes, namely the normalized BP-based and the offset BP-based algorithms, by means of density evolution. The numerical calculations show that with one properly chosen parameter for each of these two improved BP-based algorithms, performances very close to that of the BP algorithm can be achieved. Simulation results for LDPC codes with code length moderately long validate the proposed optimization.