Reliability-based schedule for decoding low-density parity-check codes
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 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 2-bit representation for initial messages, instead of the standard 1-bit for hard-decision algorithms, only at the first iteration (all the exchanged messages are still binary).
|Keywords||Bit-flipping algorithms, Hard-decision algorithms, Iterative decoding, Low-density parity-check (LDPC) codes, Message-passing algorithms, Message-passing schedule, Reliability-based schedule, Schedules for iterative decoding|
|Conference||2004 IEEE International Conference on Communications|
Nouh, A. (Ahmed), & Banihashemi, A. (2004). Reliability-based schedule for decoding low-density parity-check codes. In IEEE International Conference on Communications (pp. 444–447).