Enhanced Belief Propagation Polar Decoder for Finite Lengths
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
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.
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.
참고문헌 (11)
- Arikan, E, "Channel Polarization: A method for constructing capacity achieving codes for symmetric binary-inout memoryless channels", IEEE Trnas. Inf. Theory, 55(7), pp.3051~3073 (2009)
- Tal, I, "List Decoding of Polar Codes", Proceedings of the IEEE International Symposium on Information Theory (ISIT ’11), pp.1~5 (2011)
- Niu, K, "CRC-Aided Decoding of Polar Codes", IEEE Communications Letters, 16(10), pp.1668~1671 (2012)
- Niu, K, "Stack decoding of polar codes", IET Electronics Letters, 48(12), pp.695~697 (2012)
- Chen, K, "Improved Successive Cancellation Decoding of Polar Codes", IEEE Transactions on Communications, 61(8), pp.3100~3107 (2013)
- Arıkan, E, "A Performance Comparison of Polar Codes and Reed-Muller Codes", IEEE Communications Letters, 12(6), pp.447~449 (2008)
- Eslami, A, "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), pp.188~194 (2010)
- Hussami, N, "Performance of Polar Codes for Channel and Source Coding", IEEE International Symposium on Information Theory (ISIT’09), pp.1488~1492 (2009)
- Arıkan, E, "On the rate of channel polarization", IEEE Int. Symp. Inform. Theory, pp.1493~1495 (2009)
- Korada, S. B, "Polar Codes: Characterization of Exponent, Bounds, and Constructions", IEEE Transactions on Information Theory, 56(12), pp.6253~6264 (2010)
- Zhang, Y, "A Generalization Belief Propagation Decoding Algorithm for Polar Codes Based on Particle Swarm Optimization", Mathematical Problems in Engineering, 2014