Mean field and mixed mean field iterative decoding of low-density parity-check codes

Abstract

In this paper, the mean field (MF) and mixed mean field (MMF) algorithms for decoding low-density parity-check (LDPC) codes are considered. The MF principle is well established in statistical physics and artificial intelligence. Instead of using a single completely factorized approximated distribution as in the MF approach, the mixed MF algorithm forms a weighted average of several MF distributions as an approximation of the true posterior probability distribution. The MF decoding algorithm for linear block codes is derived and shown to be an approximation of the a posteriori probability (APP) decoding algorithm. The MF approach is then developed in the context of iterative decoding and presented as an approximation of the popular belief propagation decoding method. These results are extended to iterative decoding with the MMF algorithm. Simulation results show that the MF and MMF decoding algorithms yield a good performance-complexity tradeoff, especially when employed for decoding LDPC codes based on finite geometries.