Large Kernel Polar Codes with efficient Window Decoding [article]

Fariba Abbasi, Emanuele Viterbo
<span title="2020-10-09">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this paper, we modify polar codes constructed with some 2^t x 2^t polarization kernels to reduce the time complexity of the window decoding. This modification is based on the permutation of the columns of the kernels. This method is applied to some of the kernels constructed in the literature of size 16 and 32, with different error exponents and scaling exponents such as eNBCH kernel. It is shown that this method reduces the complexity of the window decoding significantly without affecting the performance.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2005.11102v2">arXiv:2005.11102v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/b26efhtlargxtghxaiewk52fzi">fatcat:b26efhtlargxtghxaiewk52fzi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201019003012/https://arxiv.org/pdf/2005.11102v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2005.11102v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>