Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Novel SCL Bit-Flipping Decoding Of Polarization-Adjusted Convolutional (PAC) Codes

Published 12 Jul 2023 in cs.IT and math.IT | (2307.05871v1)

Abstract: Polar codes have attracted the attention of numerous researchers in the past decade due to their excellent performance. However, their performance at short block lengths under standard successive cancellation decoding is far from desirable. An effective method to improve the performance at short lengths is CRC precoding followed by successive-cancellation list decoding. Later, Arikan presented polarization-adjusted convolutional (PAC) codes, which further improve the performance of polar codes. In fact, bit-flipping is another post-processing method that can improve decoding performance. In this paper, we propose a novel SCL Bit-Flipping of PAC Codes. We show that better performance can be achieved using list decoding when the list size is the same for PAC codes (N=128, K=64). The decoding performance of our newly proposed PAC-SCLF with a list size of 32 is 0.3 dB better than that of the traditional PAC-SCL with a list size of 32. We set the maximum number of bit flips to 5. The performance of the list size (L=32) for PAC-SCLF is almost the same as the performance of the list size (L=128) for PAC-SCL.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (23)
  1. E. Arikan, “Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channel”, IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 3051-3073, Jul. 2009.
  2. I. Tal and A. Vardy, “List Decoding of Polar Codes”, IEEE Trans. Inf. Theory, vol. 61, no. 5, pp. 2213–2226, May 2015.
  3. K. Niu and K. Chen, “CRC-Aided Decoding of Polar Codes”, IEEE Commun. Lett., vol. 16, no. 10, pp. 1668–1671, 2012.
  4. B. Li, H. Shen, and D. Tse, “An adaptive successive cancellation list decoder for polar codes with cyclic redundancy check, ” IEEE Communications Letters, vol. 16, no. 12, pp. 2044–2047, December 2012.
  5. J. Guo, Z. Shi, Z. Liu et al, “Multi-CRC Polar Codes and Their Applications, ”IEEE Communications Letters, vol.20, no.2, pp.212- 215
  6. Y.-Z. Fan, J. Chen, C. -Y. Xia, C. -Y. Tsui, J. Jin, H. Shen, and B. Li, “Low-latency list decoding of polar codes with double thresholding, ”IEEE Int. Conf. Acoust, Speech, Signal Process. (ICASSP), Apr. 2015
  7. O. Afisiadis, A. Balatsoukas-Stimming, and A. Burg, “A Low Complexity Improved Successive Cancellation Decoder for Polar Codes ”, in 2014 48th Asilomar Conference on Signals, Systems and Computers, pp. 2116–2120, 2014.
  8. S. Li, Y. Deng, X. Gao, H. Li, L. Guo, and Z. Dong, “Generalized Segmented Bit-Flipping Scheme for Successive Cancellation Decoding of Polar Codes With Cyclic Redundancy Check, ”IEEE Access, vol. 7, pp. 83424–83436, 2019.
  9. R. Guo, K. Chen, and H. Liu, “Multi-CRC Polar Codes and Muti-SCFlip Based Decoding, ”IEEE Access, vol. 7, pp. 98366–98373, 2019.
  10. Yu Y, Pan Z, Nan L “Successive Cancellation List Bit-flip Decoder for Polar Codes ”, 2018 10th International Conference on Wireless Communications and Signal Processing (WCSP), 2018.
  11. Cheng F, Liu A, Zhang Y “Bit-Flip Algorithm for Successive Cancellation List Decoder of Polar Codes ”, IEEE Access, 2019, PP(99):1-1.
  12. E. Arıkan, “From sequential decoding to channel polarization and back again, ”2019, arXiv:1908.09594.
  13. Hanwen Yao and Arman Fazeli and Alexander Vardy, “List Decoding of Arıkan’s PAC Codes ”2020 IEEE International Symposium on Information Theory (ISIT), DOI: 10.3390/e23070841
  14. R. Y. Shao, S. Lin, and M. P. C. Fossorier, “Two decoding algorithms for tailbiting codes,”IEEE Trans. Commun., vol. 51, no. 10, pp. 1658–1665, Oct. 2003.
  15. M. P. C. Fossorier and S. Lin, “Soft-decision decoding of linear block codes based on ordered statistics, ” IEEE Trans. Inf. Theory, vol. 41, no. 5, pp. 1379–1396, Sep. 1995
  16. T. Tonnellier and W. J. Gross, “On systematic polarization-adjusted convolutional (PAC) codes, ”IEEE Commun. Lett., vol. 25, no. 7, pp. 2128–2132, 2021.
  17. L. Chandesris, V. Savin, and D. Declercq, “Dynamic-SCFlip decoding of polar codes, ”IEEE Trans. Commun. vol. 66, no. 6, pp. 2333–2345, Jun. 2018.
  18. Wang C H, Pan Y H, Lin Y H, “Post-Processing for CRC-Aided Successive Cancellation List Decoding of Polar Codes, ”IEEE Commun.Lett. 2020, PP(99):1-1.
  19. B. Li, H. Shen, and D. Tse, “A RM-polar codes, ”2014, arXiv:1407.5483.
  20. Rowshan, Mohammad and Burg, Andreas and Viterbo, Emanuele “Polarization-Adjusted Convolutional (PAC) Codes: Sequential Decoding vs List Decoding, ”IEEE Transactions on Vehicular Technology. 10.1109/TVT.2021.3052550
  21. M. Rowshan and E. Viterbo, “Stepped list decoding for polar codes, ”in Proc. IEEE 10th Int. Symp. Turbo Codes Iterative Inf. Process., Hong Kong, Hong Kong, 2018, pp. 1–5.
  22. M. Rowshan and E. Viterbo, “Improved list decoding of polar codes by shifted-pruning, ”in Proc. IEEE Inf. Theory Workshop, Visby, Sweden, Aug. 2019, pp. 1–5.
  23. Mohammad Rowshan and Emanuele Viterbo “Shifted Pruning for List Decoding of Polar Codes ”https://doi.org/10.48550/arXiv.2001.10732

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.