Horizontal-Shuffled Scheduling for the Low Density Parity Check Codes Decoding for WiMAX Application

摘要

In this paper we deal with the problem of the implementation of the simplified iterative decoding algorithms of Low Density Parity Check codes (LDPC). These algorithms correspond to a simplified version of the belief propagation algorithm (BP) in the logarithmic domain. Knowing that the Self Adjustable Offset Min Sum Algorithm (SAOMSA) algorithm allows a calculation complexity reduction and improve the performance, we suggest the use of the horizontal-shuffled scheduling instead of the usually used flooding. In the case of WiMAX standard, results show an increase of the convergence speed, which approaches the BP algorithm.