Large Kernel Polar Codes with efficient Window Decoding

TL;DR

This paper introduces a modification to large kernel polar codes using column permutation to significantly reduce window decoding complexity while maintaining performance, applicable to kernels of sizes 16 and 32.

Contribution

The paper proposes a novel column permutation method for large kernel polar codes that decreases decoding complexity without performance loss.

Findings

Complexity of window decoding is significantly reduced.

Method is effective for kernels of sizes 16 and 32.

Performance remains unaffected by the proposed modification.

Abstract

In this paper, we modify polar codes constructed with some 2^t x 2^t polarization kernels to reduce the time complexity of the window decoding. This modification is based on the permutation of the columns of the kernels. This method is applied to some of the kernels constructed in the literature of size 16 and 32, with different error exponents and scaling exponents such as eNBCH kernel. It is shown that this method reduces the complexity of the window decoding significantly without affecting the performance.