Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 895782, 14 pages
http://dx.doi.org/10.1155/2014/895782
Research Article

A Parallel Decoding Algorithm for Short Polar Codes Based on Error Checking and Correcting

Laboratory of Satellite Communications, College of Communications Engineering, PLA University of Science and Technology, Nanjing 210007, China

Received 4 May 2014; Accepted 8 July 2014; Published 23 July 2014

Academic Editor: Lei Cao

Copyright © 2014 Yingxian Zhang et al. 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. E. Arikan, “Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels,” IEEE Transactions on Information Theory, vol. 55, no. 7, pp. 3051–3073, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. E. Arikan and E. Telatar, “On the rate of channel polarization,” in Proceedings of the IEEE International Symposium on Information Theory (ISIT '09), pp. 1493–1495, June-July 2009. View at Publisher · View at Google Scholar · View at Scopus
  3. S. B. Korada, E. Şaşoğlu, and R. Urbanke, “Polar codes: characterization of exponent, bounds, and constructions,” IEEE Transactions on Information Theory, vol. 56, no. 12, pp. 6253–6264, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. I. Tal and A. Vardy, “List decoding of polar codes,” in Proceedings of the IEEE International Symposium on Information Theory Proceedings (ISIT '11), pp. 1–5, St. Petersburg, Russia, August 2011. View at Publisher · View at Google Scholar · View at Scopus
  5. I. Tal and A. Vardy, “List decoding of polar codes,” http://arxiv.org/abs/1206.0050.
  6. K. Chen, K. Niu, and J.-R. Lin, “Improved successive cancellation decoding of polar codes,” IEEE Transactions on Communications, vol. 61, no. 8, pp. 3100–3107, 2013. View at Publisher · View at Google Scholar · View at Scopus
  7. K. Niu and K. Chen, “CRC-aided decoding of polar codes,” IEEE Communications Letters, vol. 16, no. 10, pp. 1668–1671, 2012. View at Publisher · View at Google Scholar · View at Scopus
  8. A. Alamdar-Yazdi and F. R. Kschischang, “A simplified successive-cancellation decoder for polar codes,” IEEE Communications Letters, vol. 15, no. 12, pp. 1378–1380, 2011. View at Publisher · View at Google Scholar · View at Scopus
  9. G. Sarkis and W. J. Gross, “Increasing the throughput of polar decoders,” IEEE Communications Letters, vol. 17, no. 4, pp. 725–728, 2013. View at Publisher · View at Google Scholar · View at Scopus
  10. G. Sarkis, P. Giard, A. Vardy, C. Thibeault, and W. J. Gross, “Fast polar decoders: algorithm and implementation,” IEEE Journal on Selected Areas in Communications, vol. 32, no. 5, pp. 946–957, 2014. View at Publisher · View at Google Scholar
  11. P. Giard, G. Sarkis, C. Thibeault, and W. J. Gross, “A fast software polar decoder,” http://arxiv.org/abs/1306.6311.
  12. E. Arikan, H. Kim, G. Markarian, U. Özür, and E. Poyraz, “Performance of short polar codes under ML decoding,” in Proceedings of the ICT-Mobile Summit Conference, June 2009.
  13. S. Kahraman and M. E. Çelebi, “Code based efficient maximum-likelihood decoding of short polar codes,” in Proceedings of the IEEE International Symposium on Information Theory (ISIT '12), pp. 1967–1971, Cambridge, Mass, USA, July 2012. View at Publisher · View at Google Scholar · View at Scopus
  14. N. Goela, S. B. Korada, and M. Gastpar, “On LP decoding of polar codes,” in Proceedings of the IEEE Information Theory Workshop (ITW '10), pp. 1–5, Dublin, Ireland, September 2010. View at Publisher · View at Google Scholar · View at Scopus
  15. E. Arikan, “A performance comparison of polar codes and reed-muller codes,” IEEE Communications Letters, vol. 12, no. 6, pp. 447–449, 2008. View at Publisher · View at Google Scholar · View at Scopus
  16. N. Hussami, S. B. Korada, and R. Urbanke, “Performance of polar codes for channel and source coding,” in Proceedings of the IEEE International Symposium on Information Theory (ISIT '09), pp. 1488–1492, July 2009. View at Publisher · View at Google Scholar · View at Scopus
  17. E. Arikan, “Polar codes: a pipelined implementation,” in Proceedings of the 4th International Symposium on Broadband Communication (ISBC '10), pp. 11–14, July 2010.
  18. A. Eslami and H. Pishro-Nik, “On bit error rate performance of polar codes in finite regime,” in Proceedings of the 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton '10), pp. 188–194, October 2010. View at Publisher · View at Google Scholar · View at Scopus
  19. A. Eslami and H. Pishro-Nik, “On finite-length performance of polar codes: stopping sets, error floor, and concatenated design,” IEEE Transactions on Communications, vol. 61, no. 3, pp. 919–929, 2013. View at Publisher · View at Google Scholar
  20. E. Arikan, “Systematic polar coding,” IEEE Communications Letters, vol. 15, no. 8, pp. 860–862, 2011. View at Publisher · View at Google Scholar · View at Scopus
  21. J. L. Massey, “Catastrophic error-propagation in convolutional codes,” in Proceedings of the 11th Midwest Symposium on Circuit Theory, pp. 583–587, January 1968.
  22. R. G. Gallager, “Low-density parity-check codes,” IEEE Transactions on Information Theory, vol. 8, pp. 21–28, 1962. View at Google Scholar · View at MathSciNet
  23. D. Divsalar and C. Jones, “CTH08-4: protograph LDPC codes with node degrees at least 3,” in Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM '06), pp. 1–5, San Francisco, Calif, USA, December 2006. View at Publisher · View at Google Scholar · View at Scopus