Efficient decoding of polar codes with some 16×16 kernels

Grigorii Trofimiuk, Peter Trifonov
<span title="">2018</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jyfj6ubbwzcqdb2m3vg7epe6tu" style="color: black;">2018 IEEE Information Theory Workshop (ITW)</a> </i> &nbsp;
A decoding algorithm for polar codes with binary 16×16 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 16×16 kernels can outperform polar codes with Arikan kernel, while having lower decoding complexity.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/itw.2018.8613307">doi:10.1109/itw.2018.8613307</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/itw/TrofimiukT18.html">dblp:conf/itw/TrofimiukT18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zuilf4jyo5hstjmys4awezx33y">fatcat:zuilf4jyo5hstjmys4awezx33y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200321122932/https://arxiv.org/pdf/2001.03921v1.pdf" title="fulltext PDF download [not primary version]" 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] <span style="color: #f43e3e;">&#10033;</span> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/itw.2018.8613307"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>