A complexity reducing method for iterative message passing decoding algorithms of Low-Density Parity-Check (LDPC) codes is described. It is based on lazy scheduling which involves a partial update of messages in the iterations. A Density Evolution (DE) approach is developed for optimization of the parameters for choice of the messages to be updated. Combined with an efficient serial scheduling, the resulting method reduces the decoding complexity by about 70-75% compared to the classical Belief Propagation (BP) scheme, while maintaining the same performance.
- Iterative decoding
- LDPC codes