Analysis of Efficient Scheduling in Layered Decoding of GLDPC Codes
For researchers working on error-correcting codes, this provides a principled approach to scheduling in layered decoding of GLDPC codes, though the gains are incremental and domain-specific.
This paper identifies scheduling sequence characteristics that improve decoding efficiency for GLDPC codes under layered message-passing, showing that prioritizing constraint nodes with larger minimum distance, fewer minimum-weight codewords, and shorter code length yields better performance. A scheduling algorithm based on these characteristics is validated via simulations.
In this study, we investigate the characteristics of scheduling sequences that enable efficient decoding of generalized low-density parity-check (GLDPC) codes under the layered message-passing algorithm. In particular, we show that scheduling sequences leading to higher decoding efficiency should prioritize the update of constraint nodes corresponding to subcodes with larger minimum distance, fewer minimum-weight codewords, and shorter code length. Based on these characteristics, we design a scheduling algorithm, which further demonstrates the effectiveness of these characteristics through simulation experiments.