A reduced complexity algorithm is presented for computing the log-likelihood ratios arising in the successive cancellation decoder for polar codes with large kernels of arbitrary dimension. The proposed algorithm exploits recursive trellis representation of the codes generated by submatrices of the polarization kernel, and enables codes based on large kernels to provide better performance compared to the codes based on Arikan kernel with the same decoding complexity.

中文翻译：

---

大极化核的递归网格处理

提出了一种降低复杂度的算法，用于计算具有任意维大内核数的极性码的连续消除解码器中出现的对数似然比。该算法利用了极化内核子矩阵生成的代码的递归网格表示形式，与基于Arikan内核的代码具有相同的解码复杂度相比，基于大内核的代码能够提供更好的性能。