Two-staged informed dynamic scheduling for sequential belief propagation decoding of LDPC codes

Authors:
Saejoon Kim;Karam Ko;Jun Heo;Ji-Hwan Kim
Affiliations:
Department of Computer Science and Engineering, Sogang University, Seoul, Korea;Department of Computer Science and Engineering, Sogang University, Seoul, Korea;School of Electrical Engineering, Korea University, Seoul, Korea;Department of Computer Science and Engineering, Sogang University, Seoul, Korea
Venue:
IEEE Communications Letters
Year:
2009

Citing 2
Cited 0

Regular and irregular progressive edge-growth tanner graphs

IEEE Transactions on Information Theory
Efficient Serial Message-Passing Schedules for LDPC Decoding

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent studies have shown that sequential belief propagation decoding of low-density parity-check codes can increase the decoding convergence speed while simultaneously improving the asymptotic performance compared to the conventional flooding scheme. Two of the practical sequential decoding schemes known are the ones by Casado et al. [1] in which informed dynamic scheduling is used for scheduling the sequential updates of the messages. In this letter, we propose a two-staged informed dynamic scheduling that unifies and outperforms the two schemes of [1].