Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 371206, 6 pages
http://dx.doi.org/10.1155/2013/371206
Research Article

Weighted-Bit-Flipping-Based Sequential Scheduling Decoding Algorithms for LDPC Codes

School of Information Science and Engineering, Southeast University, Nanjing 210096, China

Received 24 April 2013; Accepted 22 June 2013

Academic Editor: Yudong Zhang

Copyright © 2013 Qing Zhu and Le-nan Wu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. G. Gallager, “Low-density parity-check codes,” IRE Transactions on Information Theory, vol. 8, no. 1, pp. 21–28, 1962. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. D. J. C. MacKay and R. M. Neal, “Near Shannon limit performance of low density parity check codes,” Electronics Letters, vol. 32, no. 18, pp. 1645–1646, 1996. View at Publisher · View at Google Scholar · View at Scopus
  3. R. J. McEliece, D. J. C. MacKay, and J.-F. Cheng, “Turbo decoding as an instance of Pearl's “belief propagation” algorithm,” IEEE Journal on Selected Areas in Communications, vol. 16, no. 2, pp. 140–152, 1998. View at Publisher · View at Google Scholar · View at Scopus
  4. F. R. Kschischang, B. J. R. Frey, and H.-A. Loeliger, “Factor graphs and the sum-product algorithm,” IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 498–519, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  5. Y. Zhang, Y. Jun, G. Wei, and L. Wu, “Find multi-objective paths in stochastic networks via chaotic immune PSO,” Expert Systems with Applications, vol. 37, no. 3, pp. 1911–1919, 2010. View at Publisher · View at Google Scholar · View at Scopus
  6. Y. Zhang, L. Wu, G. Wei, and S. Wang, “A novel algorithm for all pairs shortest path problem based on matrix multiplication and pulse coupled neural network,” Digital Signal Processing, vol. 21, no. 4, pp. 517–521, 2011. View at Publisher · View at Google Scholar · View at Scopus
  7. Y. Zhang and L. Wu, “Optimal multi-level thresholding based on maximum Tsallis entropy via an artificial bee colony approach,” Entropy, vol. 13, no. 4, pp. 841–859, 2011. View at Publisher · View at Google Scholar · View at Scopus
  8. D. Burshtein, “On the errror correction of regular LDPC codes using the flipping algorithm,” IEEE Transactions on Information Theory, vol. 54, no. 2, pp. 517–530, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. M. Jiang, C. Zhao, Z. Shi, and Y. Chen, “An improvement on the modified weighted bit flipping decoding algorithm for LDPC codes,” IEEE Communications Letters, vol. 9, no. 9, pp. 814–816, 2005. View at Publisher · View at Google Scholar · View at Scopus
  10. X. Wu, C. Zhao, and X. You, “Parallel weighted bit-flipping decoding,” IEEE Communications Letters, vol. 11, no. 8, pp. 671–673, 2007. View at Publisher · View at Google Scholar · View at Scopus
  11. X. Wu, C. Ling, M. Jiang, E. Xu, C. Zhao, and X. You, “New insights into weighted bit-flipping decoding,” IEEE Transactions on Communications, vol. 57, no. 8, pp. 2177–2180, 2009. View at Publisher · View at Google Scholar · View at Scopus
  12. N. Miladinovic and M. P. C. Fossorier, “Improved bit-flipping decoding of low-density parity-check codes,” IEEE Transactions on Information Theory, vol. 51, no. 4, pp. 1594–1606, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. H. Kfir and I. Kanter, “Parallel versus sequential updating for belief propagation decoding,” Physica A, vol. 330, no. 1-2, pp. 259–270, 2003. View at Publisher · View at Google Scholar · View at Scopus
  14. M. M. Mansour and N. R. Shanbhag, “High-throughput LDPC decoders,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 11, no. 6, pp. 976–996, 2003. View at Publisher · View at Google Scholar · View at Scopus
  15. D. E. Hocevar, “A reduced complexity decoder architecture via layered decoding of LDPC codes,” in Proceedings of the IEEE Workshop on Signal Processing Systems Design and Implementation (SIPS '04), pp. 107–112, October 2004. View at Scopus
  16. J. Zhang, Y. Wang, M. Fossorier, and J. S. Yedidia, “Replica shuffled iterative decoding,” in Proceedings of the IEEE International Symposium on Information Theory Proceedings (ISIT '05), pp. 454–458, 2005.
  17. J. Zhang and M. P. C. Fossorier, “Shuffled iterative decoding,” IEEE Transactions on Communications, vol. 53, no. 2, pp. 209–213, 2005. View at Publisher · View at Google Scholar · View at Scopus
  18. A. I. V. Casado, M. Griot, and R. D. Wesel, “Improving LDPC decoders via informed dynamic scheduling,” in Proceedings of the IEEE Information Theory Workshop (ITW '07), pp. 208–213, Tahoe City, CA, USA, September 2007. View at Publisher · View at Google Scholar · View at Scopus
  19. A. I. V. Casado, M. Griot, and R. D. Wesel, “Informed dynamic scheduling for belief-propagation decoding of LDPC codes,” in Proceedings of the IEEE International Conference on Communications (ICC '07), pp. 932–937, Glasgow, UK, June 2007. View at Publisher · View at Google Scholar · View at Scopus
  20. D. Levin, S. Litsyn, and E. Sharon, “Lazy scheduling for LDPC decoding,” IEEE Communications Letters, vol. 11, no. 1, pp. 70–72, 2007. View at Publisher · View at Google Scholar · View at Scopus
  21. A. I. V. Casado, M. Griot, and R. D. Wesel, “LDPC decoders with informed dynamic scheduling,” IEEE Transactions on Communications, vol. 58, no. 12, pp. 3470–3479, 2010. View at Publisher · View at Google Scholar · View at Scopus
  22. J.-H. Kim, M.-Y. Nam, and H.-Y. Song, “Variable-to-check residual belief propagation for LDPC codes,” Electronics Letters, vol. 45, no. 2, pp. 117–118, 2009. View at Publisher · View at Google Scholar · View at Scopus
  23. G. J. Han and X. Liu, “An efficient dynamic schedule for layered belief-propagation decoding of LDPC codes,” IEEE Communications Letters, vol. 13, no. 12, pp. 950–952, 2009. View at Publisher · View at Google Scholar · View at Scopus
  24. Y. Gong, X. Liu, W. Ye, and G. J. Han, “Effective informed dynamic scheduling for belief propagation decoding of LDPC codes,” IEEE Transactions on Communications, vol. 59, no. 10, pp. 2683–2691, 2011. View at Publisher · View at Google Scholar · View at Scopus