Analysis of TDMP Algorithm of LDPC Codes Based on Density Evolution and Gaussian Approximation

• Main Authors: Xiumin Wang, Hong Chang, Jun Li, Weilin Cao, Liang Shan
• Format: Article
• Language: English
• Published: MDPI AG 2019-05-01
• Series: Entropy
• Subjects: density evolution; Gaussian approximation; BP algorithm; TDMP algorithm; convergence speed
• Online Access: https://www.mdpi.com/1099-4300/21/5/457

Based on density evolution analysis of the existing belief propagation (BP) algorithm, the Turbo Decoding Message Passing (TDMP) algorithm was analyzed from the perspective of density evolution and Gaussian approximation, and the theoretical analysis process of TDMP algorithm was given. When calculating the prior message of each layer of the TDMP algorithm, the check message of the previous iteration should be subtracted. Therefore, the result will not be convergent, if the TDMP algorithm is directly analyzed based on density evolution and Gaussian approximation. We researched the TDMP algorithm based on the symmetry conditions to obtain the convergent result. When using density evolution (DE) and Gaussian approximation to analyze the decoding convergence of the TDMP algorithm, we can provide a theoretical basis for proving the superiority of the algorithm. Then, based on the DE theory, we calculated the probability density function (PDF) of the check-to-variable information of TDMP and its simplified algorithm, and then gave it a calculation based on the process of the normalization factor. Simulation results show that the decoding convergence speed of the TDMP algorithm was faster and the iterations were smaller compared to the BP algorithm under the same conditions.