Efficient decoding of polar codes with some 16$\times$16 kernels
Information Theory
2020-01-14 v1 math.IT
Abstract
A decoding algorithm for polar codes with binary 1616 kernels with polarization rate 0.51828 and scaling exponents 3.346 and 3.450 is presented. The proposed approach exploits the relationship of the considered kernels and the Arikan matrix to significantly reduce the decoding complexity without any performance loss. Simulation results show that polar (sub)codes with 1616 kernels can outperform polar codes with Arikan kernel, while having lower decoding complexity.
Keywords
Cite
@article{arxiv.2001.03921,
title = {Efficient decoding of polar codes with some 16$\times$16 kernels},
author = {Grigorii Trofimiuk and Peter Trifonov},
journal= {arXiv preprint arXiv:2001.03921},
year = {2020}
}
Comments
This is the extended version of the conference paper. Minor typos are fixed, arithmetical complexity computations are refined