Decoding low-density parity-check codes with probabilistic scheduling

In this letter, we present a new message-passing schedule for the decoding of low-density parity-check (LDPC) codes. This approach, designated "probab ilistic 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 be tter performance/complexity trade-off. This work also suggests that schedul ing plays an important role in iterative decoding and that a schedule that matches the structure of the TG is desirable.