Lazy scheduling forLDPC decoding
Daniel Levin, Eran Sharon, Simon Li · IEEE Communications Letters · 2007
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
Cited by 33 works. doi:10.1109/lcomm.2007.061454
Authors
References
- Low-density parity-check codes
- Low-Density Parity-Check Codes
- The capacity of low-density parity-check codes under message-passing decoding
- Near optimum universal belief propagation based decoding of low-density parity check codes
- Shuffled belief propagation decoding
- Two-dimensional correction for min-sum decoding of irregular LDPC codes
- Reduced Complexity LDPC Decoding using Forced Convergence
- Graph-Based Message-Passing Schedules for Decoding LDPC Codes
- Reduced latency iterative decoding of LDPC codes
- Forced Convergence Decoding of LDPC Codes - EXIT Chart Analysis and Combination with Node Complexity Reduction Techniques