In this letter, we present a new message-passing schedule for the decoding of low-density parity-check (LDPC) codes. This approach, designated "probabilistic schedule," takes into account the structure of the Tanner graph (TG) of the code. We show by simulation that the new schedule offers a much better performance/complexity trade-off. This work also suggests that scheduling plays an important role in iterative decoding and that a schedule that matches the structure of the TG is desirable.

Belief propagation algorithm, Codes, Codes on graphs, Decoding, Iterative decoding, Iterative methods, LDPC codes, Message-passing schedule, Sum-product algorithm
dx.doi.org/10.1109/4234.957379
IEEE Communications Letters
Department of Systems and Computer Engineering

Mao, Y. (Yongyi), & Banihashemi, A. (2001). Decoding low-density parity-check codes with probabilistic scheduling. IEEE Communications Letters, 5(10), 414–416. doi:10.1109/4234.957379