Polar codes are a class of coding schemes that can provably achieve the capacity of a binary-input memoryless symmetric channel with low-complexity encoding and decoding algorithms as the code length tends to infinity [1]}.
The successive-cancellation (SC) decoder for a polar code of length \(N\) , with which polar codes can achieve capacity, has complexity \(O(N\log N)\) . The SC list (SCL) decoding with list size \(L>1\)  improves the error rate performance of polar codes at finite block lengths and has complexity \(O(LN\log N)\)  [2]}. SC and SCL decoding algorithms are serial in nature in the sense that the decoders progress by decoding the bits one by one. Consequently, the latency of SC and SCL decoders is high, which adversely affects their practical implementation.
