New Search for Optimized PAC Codes Under SCL Decoding
Murad Abdullah, Wai Ho Mow · 2023
In this paper, we propose some new constraints on the rate profile based on the reliability of the bit-channels to optimize the polarization-adjusted convolutional (PAC) codes under successive cancellation list (SCL) decoding. We apply simulated annealing to jointly optimize the rate profile and the convolution impulse response of the PAC codes to minimize the asymptotic frame error rate (AFER) in such a constrained search space. Simulation results show that our [64, 32], [128, 32], and [256, 128] optimized PAC codes outperform their corresponding Q-Iearning-based optimized PAC codes. Specifically, our [64, 32] optimized PAC code under SCL decoding with a list size of 8 outperforms the cyclic redundancy check (CRC) aided 5G polar code under SCL decoding with a list size of 32 by about 0.5 dB at the FER of 10−4• Our [256, 128] optimized PAC code outperforms the Q-Iearning-based optimized PAC by about 0.2 dB at the FER of 10−3under SCL decoding with a list size of 32.