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内核的代码提供更好的性能。