Skip to main content
SpringerLink
Log in

A fast parallel SC-Fano decoding algorithm for PAC codes

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

Abstract

In order to effectively reduce the “decoding latency” of successive cancellation decoding aided Fano (SC-Fano) decoder employed in polarization-adjusted convolutional (PAC) codes, a fast parallel SC-Fano decoding algorithm is designed, which leverages multiple individual decoding components. Critical challenges arise from how to appropriately initialize the thresholds of different SC-Fano decoding components and how will these decoding components cooperate with each other. After appropriately overcoming these challenges, our design is capable of halving the “decoding latency” without incurring any noticeable frame error rate (FER) performance degradation, meanwhile, the overall computational complexity is normally constrained below one and a half times of that required by conventional SC-Fano decoders in simulated typical configurations.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

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  MATH  Google Scholar 

  2. Tal I, Vardy A. List decoding of polar codes. In: Proceedings of 2011 IEEE International Symposium on Information Theory Proceedings, St. Petersburg, 2011. 1–5

  3. Niu K, Chen K. CRC-aided decoding of polar codes. IEEE Commun Lett, 2012, 16: 1668–1671

    Article  Google Scholar 

  4. Wang T, Qu D, Jiang T. Parity-check-concatenated polar codes. IEEE Commun Lett, 2016, 20: 2342–2345

    Article  Google Scholar 

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

  6. Li B, Shen H, Tse D. A RM-polar codes. 2014. ArXiv:1407.5483

  7. Li B, Zhang H, Gu J. On pre-transformed polar codes. 2019. ArXiv:1912.06359

  8. Arikan E. From sequential decoding to channel polarization and back again. 2019. ArXiv:1908.09594

  9. Jeong M O, Hong S N. SC-Fano decoding of polar codes. IEEE Access, 2019, 7: 81682–81690

    Article  Google Scholar 

  10. Polyanskiy Y, Poor H V, Verdu S. Channel coding rate in the finite blocklength regime. IEEE Trans Inform Theor, 2010, 56: 2307–2359

    Article  MathSciNet  MATH  Google Scholar 

  11. Fossorier MPC, Mihaljevic M, Imai H. Reduced complexity iterative decoding of low-density parity check codes based on belief propagation. IEEE Trans Commun, 1999, 47: 673–680

    Article  Google Scholar 

  12. Moradi M. On sequential decoding metric function of polarization-adjusted convolutional (PAC) codes. IEEE Trans Commun, 2021, 69: 7913–7922

    Article  Google Scholar 

  13. Rowshan M, Burg A, Viterbo E. Polarization-adjusted convolutional (PAC) codes: sequential decoding vs list decoding. IEEE Trans Veh Technol, 2021, 70: 1434–1447

    Article  Google Scholar 

  14. Yao H, Fazeli A, Vardy A. List decoding of Arikan’s PAC codes. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Los Angeles, 2020. 443–448

  15. Rowshan M, Viterbo E. List Viterbi decoding of PAC codes. IEEE Trans Veh Technol, 2021, 70: 2428–2435

    Article  Google Scholar 

  16. Moradi M, Mozammel A, Qin K, et al. Performance and complexity of sequential decoding of PAC codes. 2020. ArXiv:2012.04990

  17. Fano R. A heuristic discussion of probabilistic decoding. IEEE Trans Inform Theor, 1963, 9: 64–74

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  19. Moradi M, Mozammel A. A Monte-Carlo based construction of polarization-adjusted convolutional (PAC) codes. 2021. ArXiv:2106.08118

Download references

Acknowledgements

This work was supported by National Key R&D Project (Grant No. 2018YFB1801104), National Natural Science Foundation of China (Grant Nos. 62071394, 62020106001), 111 Project (Grant No. 111-2-14), and Sichuan Science and Technology Program (Grant No.2020YFH0011).

Author information

Authors and Affiliations

  1. Information Coding & Transmission Key Lab of Sichuan Province, Communications & Sensor Networks for Modern Transportation International Cooperatation Research Centre of China, Southwest Jiaotong University, Chengdu, 610031, China

    Yunzhi Wu, Li Li & Pingzhi Fan

Authors
  1. Yunzhi Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Li Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pingzhi Fan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Li Li.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wu, Y., Li, L. & Fan, P. A fast parallel SC-Fano decoding algorithm for PAC codes. Sci. China Inf. Sci. 66, 152301 (2023). https://doi.org/10.1007/s11432-022-3498-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11432-022-3498-8

Keywords

Search

Navigation