论文信息 - Performance and Complexity of Sequential Decoding of PAC Codes

Performance and Complexity of Sequential Decoding of PAC Codes

Performance and complexity of sequential decoding of polarization-adjusted convolutional (PAC) codes is studied. In particular, a performance and computational complexity comparison of PAC codes with 5G polar codes and convolutional codes is given. A method for bounding the complexity of sequential decoding of PAC codes is proposed.

[1] D. A. Bell,et al. Information Theory and Reliable Communication , 1969 .

[2] Erdal Arikan,et al. Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

[3] Elwyn R. Berlekamp,et al. A lower bound to the distribution of computation for sequential decoding , 1967, IEEE Trans. Inf. Theory.

[4] Jiaqi Gu,et al. On Pre-transformed Polar Codes , 2019, ArXiv.

[5] F. Jelinek. Fast sequential decoding algorithm using a stack , 1969 .

[6] Arman Fazeli,et al. List Decoding of Arıkan’s PAC Codes † , 2020, 2020 IEEE International Symposium on Information Theory (ISIT).

[7] Erdal Arikan. An inequality on guessing and its application to sequential decoding , 1996, IEEE Trans. Inf. Theory.

[8] Emanuele Viterbo,et al. Polarization-adjusted Convolutional (PAC) Codes: Fano Decoding vs List Decoding , 2020, ArXiv.

[9] H. Vincent Poor,et al. Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.

[10] Erdal Arikan,et al. From sequential decoding to channel polarization and back again , 2019, ArXiv.

[11] Robert Mario Fano,et al. A heuristic discussion of probabilistic decoding , 1963, IEEE Trans. Inf. Theory.