Journal of Korea Society of Digital Industry and Information Management (디지털산업정보학회논문지)

Korea Society of Digital Industry and Information Management (디지털산업정보학회)
권호 표지
DOI QR코드

DOI QR Code

Enhanced Belief Propagation Polar Decoder for Finite Lengths

유한한 길이에서 성능이 향상된 BP 극 복호기

  • Received : 2015.07.16
  • Accepted : 2015.08.21
  • Published : 2015.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we discuss the belief propagation decoding algorithm for polar codes. The performance of Polar codes for shorter lengths is not satisfactory. Motivated by this, we propose a novel technique to improve its performance at short lengths. We showed that the probability of messages passed along the factor graph of polar codes, can be increased by multiplying the current message of nodes with their previous message. This is like a feedback path in which the present signal is updated by multiplying with its previous signal. Thus the experimental results show that performance of belief propagation polar decoder can be improved using this proposed technique. Simulation results in binary-input additive white Gaussian noise channel (BI-AWGNC) show that the proposed belief propagation polar decoder can provide significant gain of 2 dB over the original belief propagation polar decoder with code rate 0.5 and code length 128 at the bit error rate (BER) of $10^{-4}$.

Keywords

References

  1. Arikan, E. "Channel Polarization: A method for constructing capacity achieving codes for symmetric binary-inout memoryless channels," IEEE Trnas. Inf. Theory, Vol. 55, No. 7, 2009, pp. 3051-3073. https://doi.org/10.1109/TIT.2009.2021379
  2. Tal, I. and Vardy, A., "List Decoding of Polar Codes," Proceedings of the IEEE International Symposium on Information Theory (ISIT '11), St Petersburg, Russia, 2011, pp. 1-5.
  3. Niu, K. and Chen, K., "CRC-Aided Decoding of Polar Codes," IEEE Communications Letters, Vol. 16, No. 10, 2012, pp. 1668-1671. https://doi.org/10.1109/LCOMM.2012.090312.121501
  4. Niu, K. and Chen, K., "Stack decoding of polar codes," IET Electronics Letters, Vol. 48, No. 12, 2012, pp. 695-697. https://doi.org/10.1049/el.2012.1459
  5. Chen, K., Niu, K. and Lin, J., "Improved Successive Cancellation Decoding of Polar Codes," IEEE Transactions on Communications, Vol. 61, No. 8, 2013, pp. 3100-3107. https://doi.org/10.1109/TCOMM.2013.070213.120789
  6. Arikan, E., "A Performance Comparison of Polar Codes and Reed-Muller Codes," IEEE Communications Letters, Vol. 12, No. 6, 2008, pp. 447-449. https://doi.org/10.1109/LCOMM.2008.080017
  7. Eslami, A. and Pishro-Nik, H., "On Bit Error Rate Performance of Polar Codes in Finite Regime," Proceedings of the 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton (AACCCC '10), Allerton, Ill, USA, 2010, pp. 188-194.
  8. Hussami, N, Korada S. B. and Urbanke, R., "Performance of Polar Codes for Channel and Source Coding," IEEE International Symposium on Information Theory (ISIT'09), Seoul, Korea, 2009, pp. 1488-1492.
  9. Arikan, E. and Telatar, E., "On the rate of channel polarization," IEEE Int. Symp. Inform. Theory, Seoul, Korea, 2009, pp. 1493-1495.
  10. Korada, S. B., Sasoglu, E. and Urbanke, R., "Polar Codes: Characterization of Exponent, Bounds, and Constructions," IEEE Transactions on Information Theory, Vol. 56, No. 12, 2010, pp. 6253-6264. https://doi.org/10.1109/TIT.2010.2080990
  11. Zhang, Y., Liu, A., Pan, X, He, S. and Gong, C., "A Generalization Belief Propagation Decoding Algorithm for Polar Codes Based on Particle Swarm Optimization," Mathematical Problems in Engineering, Vol. 2014, Article ID 606913,10 pages, http://dx.doi.org/10.1155/2014/606913.