期刊
2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)
卷 -, 期 -, 页码 1412-1416出版社
IEEE
DOI: 10.1109/isit.2019.8849445
关键词
-
We propose a reduced complexity algorithm for computing log-likelihood ratios (LLRs) needed for successive cancellation (SC) decoding of polar codes with 2(t) x 2(t) polarization kernels. This algorithm is applied to some polarization kernels of length 16 and 32 with high polarization rate. The complexity reduction is achieved by exploiting linear relationship of the considered kernels and Arikan matrix. Further complexity reduction is achieved by identification of common subexpressions. The proposed approach enables SC list decoding of polar codes with some large kernels with lower complexity compared to the codes based on the Arikan kernel with the same performance.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据