论文标题
二元极化内核的窗户处理
Window Processing of Binary Polarization Kernels
论文作者
论文摘要
提出了一种具有二进制$ 2^t \ times 2^t $极化内核的极（子）代码的解码算法。它基于窗口处理（WP）方法，该方法利用了极化内核和Arikan矩阵的线性关系。这种关系使一个人能够通过计算Arikan连续取消（SC）解码器中多个路径的概率来计算内核输入符号。 在本文中，我们提出了一个改进的WP版本，该版本的算术复杂性显着降低，并以对数似然比（LLRS）结构域运行。该算法识别和重复使用Arikan SC路径分数计算时产生的常见子表达。 所提出的算法应用于具有改善极化特性的16和32的核。与Arikan内核相比，它可以使具有所考虑核的极性（子）代码同时提供更好的性能和更低的解码复杂性。
A decoding algorithm for polar (sub)codes with binary $2^t\times 2^t$ polarization kernels is presented. It is based on the window processing (WP) method, which exploits the linear relationship of the polarization kernels and the Arikan matrix. This relationship enables one to compute the kernel input symbols probabilities by computing the probabilities of several paths in Arikan successive cancellation (SC) decoder. In this paper we propose an improved version of WP, which has significantly lower arithmetic complexity and operates in log-likelihood ratios (LLRs) domain. The algorithm identifies and reuses common subexpressions arising in computation of Arikan SC path scores. The proposed algorithm is applied to kernels of size 16 and 32 with improved polarization properties. It enables polar (sub)codes with the considered kernels to simultaneously provide better performance and lower decoding complexity compared with polar (sub)codes with Arikan kernel.
