Self-corrected UMP-APP decoding of LDPC codes

Abstract

In this paper we propose a very simple but powerful self-correction method for the UMP-APP decoding of LDPC codes. Like self-corrected min-sum decoding, our method does not try to correct the check node processing approximation, but it modifies the variable node processing by erasing unreliable messages. Monte-Carlo simulations show that the proposed self-corrected UMP-APP decoding performs better then common UMP-APP decoding. Estimation of the complexity and average number of iteration for self-corrected UMP-APP algorithm are also shown.