Reduced Complexity Dynamic Schedule for Layered Decoding of LDPC Codes

Low-density parity-check (LDPC) codes have been selected as the coding scheme of the data channel in 5G communication. To enhance the performance of conventional layered decoding of LDPC codes, various dynamic schedules have been proposed recently. However, these dynamic schedules suffer from high complexity. In this paper, we propose a reduced complexity dynamic layered schedule for LDPC codes, where the layer to be updated is determined based on the residual of each layer. Moreover, an adjustable parameter is introduced to achieve a better performance-complexity trade-off. Simulation results show that the proposed method maintains excellent error-correction performance while the computational complexity is greatly reduced, compared to the prior dynamic schedules.