A reliability-based message-passing schedule for iterative decoding of low-density parity-check codes is proposed. Simulation results for bit-flipping algorithms (with binary messages) show that a reliability-based schedule can provide considerable improvement in performance and decoding speed over the so-called flooding (parallel) schedule, as well as the existing graph-based schedules. The cost associated with this improvement is negligible and is equivalent to having a two-bit representation for initial messages, instead of the standard one bit for hard-decision algorithms, only at the first iteration (all the exchanged messages are still binary.

Additional Metadata
Keywords Bit-flipping (BF) algorithms, Hard-decision algorithms, Iterative decoding, Low-density parity-check (LDPC) codes, Message-passing algorithms, Message-passing sehedule, Reliability-based schedule (RBS), Schedules for iterative decoding
Persistent URL dx.doi.org/10.1109/TCOMM.2004.838704
Journal IEEE Transactions on Communications
Citation
Nouh, A. (Ahmed), & Banihashemi, A. (2004). Reliability-based schedule for bit-flipping decoding of low-density parity-check codes. IEEE Transactions on Communications, 52(12), 2038–2040. doi:10.1109/TCOMM.2004.838704