Skip to main content
Log in

Belief propagation list bit-flip decoder for polar codes

  • Research Paper
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

Belief propagation (BP) decoder is a low decoding latency algorithm for polar codes. However, the block error rate (BLER) performance of the BP decoder is inferior to the cyclic redundancy check (CRC) aided successive cancellation list (CA-SCL) decoder with medium list size for polar codes. Thus, in this paper, we introduce a bit-flip method into the belief propagation list (BPL) decoder and propose a BPL bit-flip (BPLF) decoder to improve the BLER performance of BP-based decoder for polar codes. The proposed decoder is based on a CRC-aided belief propagation list (CA-BPL) decoder, and the error-prone bits are obtained from the decoded result to construct flip bits set (FBS). The bits in FBS are flipped to obtain the correct decoding result. Moreover, the simulation results show that the BLER of the proposed BPLF decoder is significantly superior to that of the CA-BPL despite having the same list size, e.g., there is 0.75 dB gain at BLER = 10−4 with list size 64. Furthermore, the decoding complexity and latency of the proposed BPLF decoder are only slightly higher than those of CA-BPL decoder with the same list size in medium to high signal-to-noise ratio (SNR) region.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Arikan E. Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Trans Inform Theor, 2009, 55: 3051–3073

    Article  MathSciNet  Google Scholar 

  2. Niu K, Chen K, Lin J R, et al. Polar codes: primary concepts and practical decoding algorithms. IEEE Commun Mag, 2014, 52: 192–203

    Article  Google Scholar 

  3. Alamdar-Yazdi A, Kschischang F R. A simplified successive-cancellation decoder for polar codes. IEEE Commun Lett, 2011, 15: 1378–1380

    Article  Google Scholar 

  4. Tal I, Vardy A. List decoding of polar codes. IEEE Trans Inform Theor, 2015, 61: 2213–2226

    Article  MathSciNet  Google Scholar 

  5. Asiadis O, Balatsoukas-Stimming A, Burg A. A low-complexity improved successive cancellation decoder for polar codes. In: Proceedings of the 48th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, 2014. 2116–2120

  6. Zhang Z, Qin K, Zhang L, et al. Progressive bit-fipping decoding of polar codes over layered critical sets. In: Proceedings of IEEE Global Communications Conference, Singapore, 2017. 1–6

  7. Yu Y R, Pan Z W, Liu N, et al. Successive cancellation list bit-flip decoder for polar codes. In: Proceedings of the 10th International Conference on Wireless Communications and Signal Processing, Hangzhou, 2018. 1–6

  8. Arkan E. A performance comparison of polar codes and reed-muller codes. IEEE Commun Lett, 2008, 12: 447–449

    Article  Google Scholar 

  9. Arikan E. Polar codes: a pipelined implementation. In: Proceedings of the 4th International Symposium Broadband Communication, Melaka, 2010. 11–14

  10. Yuan B, Parhi K K. Early stopping criteria for energy-efficient low-latency belief-propagation polar code decoders. IEEE Trans Signal Process, 2014, 62: 6496–6506

    Article  MathSciNet  Google Scholar 

  11. Simsek C, Turk K. Simplified early stopping criterion for belief-propagation polar code decoders. IEEE Commun Lett, 2016, 20: 1515–1518

    Article  Google Scholar 

  12. Zhang Q, Liu A J, Tong X H. Early stopping criterion for belief propagation polar decoder based on frozen bits. Electron Lett, 2017, 53: 1576–1578

    Article  Google Scholar 

  13. Yuan B, Parhi K K. Algorithm and architecture for hybrid decoding of polar codes. In: Proceedings of the 48th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, 2014. 2050–2053

  14. Sun S H, Cho S G, Zhang Z Y. Post-processing methods for improving coding gain in belief propagation decoding of polar codes. In: Proceedings of IEEE Global Communications Conference, Singapore, 2017. 1–6

  15. Elkelesh A, Ebada M, Cammerer S, et al. Belief propagation decoding of polar codes on permuted factor graphs. In: Proceedings of IEEE Wireless Communications and Networking Conference, Barcelona, 2018. 1–6

  16. Doan N, Hashemi S A, Mondelli M, et al. On the decoding of polar codes on permuted factor graphs. In: Proceedings of IEEE IEEE Global Communications Conference, Abu Dhabi, 2018. 1–6

  17. Elkelesh A, Ebada M, Cammerer S, et al. Belief propagation list decoding of polar codes. IEEE Commun Lett, 2018, 22: 1536–1539

    Article  Google Scholar 

  18. Trifonov P. Efficient design and decoding of polar codes. IEEE Trans Commun, 2012, 60: 3221–3227

    Article  Google Scholar 

  19. Zhang H Z, Li R, Wang J, et al. Parity-check polar coding for 5G and beyond. In: Proceedings of International Conference on Communications, Kansas City, 2018, 1–6

  20. Yu Y R, Pan Z W, Liu N, et al. Belief propagation bit-flip decoder for polar codes. IEEE Access, 2019, 7: 10937–10946

    Article  Google Scholar 

Download references

Acknowledgements

This work was partially supported by National Key Research and Development Project (Grant No. 2018-YFB1802402) and Huawei Tech. Co., Ltd.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhiwen Pan.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yang, Y., Hu, Y., Pan, Z. et al. Belief propagation list bit-flip decoder for polar codes. Sci. China Inf. Sci. 64, 192306 (2021). https://doi.org/10.1007/s11432-019-2801-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11432-019-2801-6

Keywords

Navigation