Bit-flipping for stack decoding of polarization-adjusted convolutional (PAC) codes
International Workshop on Signal Design and Its Applications in Communications (IWSDA)
Institute of Electrical and Electronics Engineers
1 - 5
Item Usage Stats
While sequential decoding of polarization-adjusted convolutional (PAC) codes constructed using polar rate profile has low computational complexity, their error-correction per-formance falls far short of the theoretical bounds for finite blocklength codes. In this paper, we use the bit-flipping technique in the stack decoding algorithm of PAC codes in order to improve their error-correction performance. This technique maintains the low memory requirements of stack decoding and polar demapper. Additionally, at high SNR values, the number of visits at each level of the decoding tree is almost one. Numerical findings indicate that this approach is capable of outperforming the stack decoding algorithm.
KeywordsPolarization-adjusted convolutional codes