Fast Block Sequential Decoding of Polar Codes
Fast Block Sequential Decoding of Polar Codes
复制标题
DOI：
10.1109/tvt.2020.3006369
复制
发表时间：
2018-08
影响因子：
6.8
通讯作者：
Grigorii Trofimiuk;Nikolai Iakuba;Stanislav Rets;K. Ivanov;P. Trifonov
中科院分区：
文献类型：
--
作者：
Grigorii Trofimiuk;Nikolai Iakuba;Stanislav Rets;K. Ivanov;P. Trifonov
描述了一种用于极化（子）码的降低复杂度的顺序解码算法。所提出的方法依赖于被解码成多个外码的极化（子）码的分解，以及按其概率的降序按需构造这些码的码字。这种码字的构造通过快速解码算法来实现，该快速解码算法可用于在极化码的分解中产生的许多码。通过对中间LLR进行硬判决并避免对某些外码进行解码，可以进一步降低复杂度。描述了用于极化码的顺序解码的数据结构。该算法也可用于CRC极化码和短扩展BCH码的译码。与现有的相应码的译码算法相比，该算法具有较低的平均译码复杂度。
A reduced complexity sequential decoding algorithm for polar (sub) codes is described. The proposed approach relies on a decomposition of the polar (sub) code being decoded into a number of outer codes, and on-demand construction of codewords of these codes in the descending order of their probability. Construction of such codewords is implemented by fast decoding algorithms, which are available for many codes arising in the decomposition of polar codes. Further complexity reduction is achieved by taking hard decisions of the intermediate LLRs, and avoiding decoding of some outer codes. Data structures for sequential decoding of polar codes are described. The proposed algorithm can be also used for decoding of polar codes with CRC and short extended BCH codes. It has lower average decoding complexity compared with the existing decoding algorithms for the corresponding codes.