Turbo-schedule for LDPC Decoding
Alexandre de Baynast, Predrag Radosavljevic, Joseph R. Cavallaro
Abstract
A major drawback of the low density parity-check codes (LDPC) versus the turbo-codes is their comparative low convergence speed: 30 iterations vs. 8-10 iterations for the turbo-codes.Recently, Hocevar showed by simulations that the convergence rate of the LDPC decoder can be accelerated by exploiting a 'turboscheduling' for the bit-node messages.In this paper, we extend this principle 1) for the check messages, 2) for both check and bit nodes messages alternatively (hybrid version).We compare the convergence speed of these schedules by performing the Density Evolution Analysis.Results show that that the convergence rate is about two times increased for most of the LDPC codes in comparison with the standard message passing.Simulations validate the effectiveness of the proposed schedules.