A reduced latency list decoding algorithm for polar codes
A reduced latency list decoding algorithm for polar codes
复制标题
DOI：
10.1109/sips.2014.6986062
复制
发表时间：
2014-05
期刊：
影响因子：
--
通讯作者：
Jun Lin;Chenrong Xiong;Zhiyuan Yan
中科院分区：
文献类型：
--
作者：
Jun Lin;Chenrong Xiong;Zhiyuan Yan
循环冗余检查（CRC）辅助连续的取消列表（SCL）解码算法的错误性能比连续的取消（SC）解码算法对于短或中等极性代码。但是，CRC辅助SCL（CA-SCL）解码算法仍然患有较长的解码延迟。在本文中，提出了针对极地代码的减少延迟列表解码（RLLD）算法。对于提出的RLLD算法，所有速率-0节点和速率1节点的一部分是立即解码的，而无需穿越相应的子树。提出了列表的最大样本解码（LMLD）算法来解码最大似然（ML）节点和剩余的速率1节点。此外，还提出了简化的LMLD（SLMLD）算法来降低LMLD算法的计算复杂性。假设使用具有列表大小L = 4的部分并行列表解码器体系结构，对于（8192，4096）极性代码，提出的RLLD算法可以分别减少6.97和6.77次的解码时钟周期和解码延迟的数量。
The cyclic redundancy check (CRC) aided successive cancelation list (SCL) decoding algorithm has better error performance than the successive cancelation (SC) decoding algorithm for short or moderate polar codes. However, the CRC aided SCL (CA-SCL) decoding algorithm still suffer from long decoding latency. In this paper, a reduced latency list decoding (RLLD) algorithm for polar codes is proposed. For the proposed RLLD algorithm, all rate-0 nodes and part of rate-1 nodes are decoded instantly without traversing the corresponding subtree. A list maximum-likelihood decoding (LMLD) algorithm is proposed to decode the maximum likelihood (ML) nodes and the remaining rate-1 nodes. Moreover, a simplified LMLD (SLMLD) algorithm is also proposed to reduce the computational complexity of the LMLD algorithm. Suppose a partial parallel list decoder architecture with list size L = 4 is used, for an (8192, 4096) polar code, the proposed RLLD algorithm can reduce the number of decoding clock cycles and decoding latency by 6.97 and 6.77 times, respectively.