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.
Cited by 321 works. doi:10.1109/tcomm.2004.841982
Authors
References
- Low-density parity-check codes
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
- Optimal decoding of linear codes for minimizing symbol error rate
- Low-Density Parity-Check Codes
- Good error-correcting codes based on very sparse matrices
- Near optimum error correcting coding and decoding: turbo-codes
- Multiple turbo codes for deep-space communications
- High throughput low-density parity-check decoder architectures
- Shuffled belief propagation decoding
- Parallel versus sequential updating for belief propagation decoding