Abstract
Message-passing decoding algorithm based on belief propagation is a widely used decoding algorithm for error correction codes. For moderate length polar codes, it achieves the error correction performance similar to the successive cancellation algorithm at the cost of high storage and computation requirements. In this paper, a novel modification is introduced for the belief propagation decoder of polar codes, wherein adjacent two processing stages are efficiently combined together to speed up the decoding. Corresponding path based belief estimation method is presented in detail. The proposed decoder halves the number of stages of the conventional decoder and thus can significantly reduce the message memory requirement. The architecture of the proposed decoder is presented. In general, the proposed decoder achieves 50 % memory reduction, more than 77 % throughput gain and significant area reduction without decoding performance degradation.
Similar content being viewed by others
References
Arıkan, E. (2009). Channel polarization: a method for constructing capacity- achieving codes for symmetric binary-input memoryless channels. IEEE Transactions on Information Theory, 55(7), 3051–3073.
Tal, I., & Vardy, A. (2011). List decoding of polar codes. In Proc. IEEE Int. Symp. Inform. Theory, pp. 1–5.
Xiong, C., Lin, J., & Yan, Z. (2014). Symbol-based successive cancelation list decoder for polar codes. In Proc. IEEE Workshop on Signal Processing Systems (SiPS), Belfast, UK, October 2014, pp. 1–6.
Xiong, C., Lin, J., & Yan, Z. (2015). Symbol-decision successive cancellation list decoder for polar codes. IEEE Transactions on Signal Processing, 64(3), 675–687.
Lin, J., Xiong, C., & Yan, Z. (2016). A high throughput list decoder architecture for polar codes. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 24(6), 2378–2391.
Xiong, C., Lin, J., & Yan, Z. (2015). Efficient design of ML decoding units for polar list decoders. In Proc. IEEE Workshop on Signal Process. Syst., Hangzhou, CN, Oct. 2015.
Niu, K., & Chen, K. (2012). Stack decoding of polar codes. Electronics Letters, 48(12), 695–697.
Sarkis, G., Giard, P., Vardy, A., Thibeault, C., & Gross, W. J. (2014). Fast polar decoders: algorithm and implementation. IEEE Journal on Selected Areas in Communications, 32(5), 946–957.
Leroux, C., Raymond, A. J., Sarkis, G., & Gross, W. J. (2013). A semi-parallel successive-cancellation decoder for polar codes. IEEE Transactions on Signal Processing, 61(2), 289–299.
Yuan, B., & Parhi, K. K. (2014). Low-latency successive-cancellation polar decoder architectures using 2-bit decoding. IEEE Transactions on Circuits and Systems-I, 61(4), 1241–1254.
Raymond, A. J., & Gross, W. (2014). A scalable successive-cancellation decoder for polar codes. IEEE Transactions on Signal Processing, 62(20), 5339–5347.
Mishra, A., Raymond, A., Amaru, L., Sarkis, G., Leroux, C., Meinerzhagen, P., Burg, A., & Gross, W. (2012). A successive cancellation decoder ASIC for a 1024-bit polar code in 180nm CMOS, Solid State Circuits Conference (A-SSCC), 2012 I.E. Asian, pp. 205–208.
Arıkan, E. (2008). A performance comparison of polar codes and reed-muller codes. IEEE Communications Letters, 12(6), 447–449.
Park, Y., Tao, Y., Sun, S., & Zhang, Z. (2014). A 4.68 Gb/s belief propagation Polar decoder with bit-splitting register file. In IEEE Symposium on VLSI Circuits, 2014.
Yuan, B., & Parhi, K. K. (2014). Early stopping criteria for energy-efficient low-latency belief-propagation polar code decoders. IEEE Transactions on Signal Processing, 62(24), 6496–6506.
Fayyaz, U. U., & Barry, J. R. (2014). Low-complexity soft-output decoding of polar codes. IEEE Journal on Selected Areas in Communications, 32(5), 958–966.
Kschischang, F. R., Frey, B. J., & Loeliger, H. (2001). Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory, 47(2), 498–519.
Forney, G. D., Jr. (2001). Codes on graphs: normal realizations. IEEE Transactions on Information Theory, 47(2), 520–548.
Kschischang, F. R., & Frey, B. J. (1998). Iterative decoding of compound codes by probability propagation in graphical models. IEEE Journal on Selected Areas in Communications, 16, 219–230.
Fossorier, M. P. C., Mihaljevic, M., & Imai, H. (1999). Reduced complexity iterative decoding of low-density parity check codes based on belief propagation. IEEE Transactions on Communications, 47(5), 673–680.
Acknowledgments
This work is jointly supported by the National Natural Science Foundation of China under Grant No. 61370040, 61006018, 61376075 and 61176024, the project on the Integration of Industry, Education and Research of Jiangsu Province BY2015069-05, BY2015069-08, and A Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sha, J., Liu, J., Lin, J. et al. A Stage-Combined Belief Propagation Decoder for Polar Codes. J Sign Process Syst 90, 687–694 (2018). https://doi.org/10.1007/s11265-016-1181-y
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11265-016-1181-y