A generalization of the fast successive cancellation decoding algorithm to the case of binary polar codes with arbitrary large kernels is presented. Its asymptotic latency is shown to be
O(N1−1/μ), where$\mu $is the scaling exponent of the underlying polarization kernel.
A method for efficiently successive cancellation (SC) decoding of polar codes with high-dimensional linear binary kernels (HDLBK) is presented and analyzed. We devise a
l-expressions method which can obtain simplified recursive formulas of SC decoder in likelihood ratio form for arbitrary linear binary kernels to reduce the complexity of corresponding SC decoder. By considering the bit-channel transition probabilities
WG(⋅)(⋅∣0) and
WG(⋅)(⋅∣1) separately, a
W-expressions method is proposed to further reduce the complexity of HDLBK based SC decoder. For a
m×m binary kernel, the complexity of straightforward SC decoder is
O(2mNlogN). With
W-expressions, we reduce the complexity of straightforward SC decoder to
O(m2NlogN) when
m≤16. Simulation results show that
16×16 kernel polar codes offer significant advantages in terms of error performances compared with
2×2 kernel polar codes under SC and list SC decoders.