Shuffled versions of iterative decoding of low-density parity-check codes and turbo codes are presented. The proposed schemes have about the same computational complexity as the standard versions, and converge faster. Simulations show that the new schedules offer better performance/complexity tradeoffs, especially when the maximum number of iterations has to remain small.
No takes yet. Share an insight, caveat, or question.
Zhang et al. (2005) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: