论文标题
具有高效窗口解码的大内核极性代码
Large Kernel Polar Codes with efficient Window Decoding
论文作者
论文摘要
在本文中，我们修改了用约2^t x 2^t极化内核构建的极性代码，以降低窗口解码的时间复杂性。此修改基于内核列的排列。该方法应用于尺寸16和32的文献中构建的一些内核，具有不同的误差指数和缩放指数，例如ENBCH内核。结果表明，该方法可显着降低窗口解码的复杂性，而不会影响性能。
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.
