Shuffled Iterative Decoding
J. Zhang, M.P.C. Fossorier · IEEE Transactions on Communications · 2005
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.