A Tree Pruning Technique for Decoding Complexity Reduction of Polar Codes and PAC Codes

by   Mohsen Moradi, et al.
Bilkent University

Sorting operation is one of the main bottlenecks for the successive-cancellation list (SCL) decoding. This paper introduces an improvement to the SCL decoding for polar and pre-transformed polar codes that reduces the number of sorting operations without degrading the code's error-correction performance. In an SCL decoding with an optimum metric function we show that, on average, the correct branch's bit-metric value must be equal to the bit-channel capacity, and on the other hand, the average bit-metric value of a wrong branch can be at most zero. This implies that a wrong path's partial path metric value deviates from the bit-channel capacity's partial summation. For relatively reliable bit-channels, the bit metric for a wrong branch becomes very large negative number, which enables us to detect and prune such paths. We prove that, for a threshold lower than the bit-channel cutoff rate, the probability of pruning the correct path decreases exponentially by the given threshold. Based on these findings, we presented a pruning technique, and the experimental results demonstrate a substantial decrease in the amount of sorting procedures required for SCL decoding. In the stack algorithm, a similar technique is used to significantly reduce the average number of paths in the stack.


On the Metric and Computation of PAC Codes

In this paper, we present an optimal metric function on average, which l...

Shifted Pruning for List Decoding of Polar Codes

In successive cancellation list (SCL) decoding, the tree pruning operati...

List Viterbi Decoding of PAC Codes

Polarization-adjusted convolutional (PAC) codes are special concatenated...

A Complexity Reduction Method for Successive Cancellation List Decoding

This paper introduces a hardware complexity reduction method for success...

Partial Selection for Successive Cancellation List Decoding of Polar Codes

Polar codes have attracted a lot of attention during past few years and ...

Polar Codes Do Not Have Many Affine Automorphisms

Polar coding solutions demonstrate excellent performance under the list ...

Physical layer insecurity

In the classic wiretap model, Alice wishes to reliably communicate to Bo...

Please sign up or login with your details

Forgot password? Click here to reset