Construction of binary polarization kernels for low complexity window processing

Abstract

An algorithm for construction of binary polarization kernels of size 16 and 32 with polarization rate greater than 0.5, which admit low complexity processing is proposed. Kernels are obtained by employing such linear transformations of the Arikan matrix, which minimize the complexity of the window processing algorithm, while preserving required rate of polarization. Simulation results show that polar subcodes with obtained kernels can outperform polar codes with Arikan kernel, while having lower decoding complexity.