Derived dynamic scheduling for belief propagation decoding of LDPC codes

Abstract

AbstractAmong numerous dynamic scheduling strategies for low‐density parity‐check codes, many of them are of high complexity due to repetitive computation and ordering of belief residuals. To address these challenges, two novel approaches are proposed: the derived informed variable‐to‐check residual belief propagation and the derived variable‐node and variable‐to‐check‐edge residual belief propagation for low‐density parity‐check codes. Simulation results show that the derived dynamic scheduling exhibits a substantial gain of approximately 0.15 dB in signal‐to‐noise ratio over the non‐derived one with considerably lower decoding complexity when targeting a bit‐error rate of 10−4.