Analysis of Efficient Scheduling in Layered Decoding of GLDPC Codes

TL;DR

This paper investigates scheduling strategies for layered decoding of GLDPC codes, highlighting the importance of updating certain constraint nodes to improve decoding efficiency, and proposes a new scheduling algorithm validated by simulations.

Contribution

The paper identifies key characteristics for efficient scheduling in layered decoding of GLDPC codes and introduces a novel scheduling algorithm based on these insights.

Findings

Scheduling sequences that prioritize certain constraint nodes improve decoding efficiency.

The proposed scheduling algorithm outperforms traditional methods in simulations.

Abstract

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.