LLR-Based Successive Cancellation List Decoding of Polar Codes
LLR-Based Successive Cancellation List Decoding of Polar Codes
复制标题
DOI：
10.1109/tsp.2015.2439211
复制
发表时间：
2015-10-01
影响因子：
5.4
通讯作者：
Burg, Andreas
中科院分区：
文献类型：
--
作者：
Balatsoukas-Stimming, Alexios;Parizi, Mani Bastani;Burg, Andreas
我们表明，连续的取消列表可以使用对数可能性比率专门制定。除了数值稳定性外，基于对数的样品比率的公式具有有用的属性，可以简化连续取消列表解码中涉及的分类步骤。我们提出了连续的取消列表解码器的硬件体系结构，该列表域中的分解域与日志类似域的实现相比，它需要较少的不规则和较小的记忆。这种简化以及公制分类器中的增益，导致每个单位区域的吞吐量高于其他最新提议的体系结构。然后，我们使用不同的CRC评估了CRC辅助连续取消列表在不同列表大小处的经验表现，并得出结论，将CRC长度适应列表尺寸很重要代码。最后，我们在较大的块长度上合成了常规连续的取消解码器，其块概率与我们提议的CRC辅助连续取消列表解码器相同，以证明我们的解码器的吞吐量略低，较大的区域，但它们的区域较小，但它们的解码器的较小较小，但它们的解码器较小。解码延迟。
We show that successive cancellation list decoding can be formulated exclusively using log-likelihood ratios. In addition to numerical stability, the log-likelihood ratio based formulation has useful properties that simplify the sorting step involved in successive cancellation list decoding. We propose a hardware architecture of the successive cancellation list decoder in the log-likelihood ratio domain which, compared with a log-likelihood domain implementation, requires less irregular and smaller memories. This simplification, together with the gains in the metric sorter, lead to to higher throughput per unit area than other recently proposed architectures. We then evaluate the empirical performance of the CRC-aided successive cancellation list decoder at different list sizes using different CRCs and conclude that it is important to adapt the CRC length to the list size in order to achieve the best error-rate performance of concatenated polar codes. Finally, we synthesize conventional successive cancellation decoders at large block-lengths with the same block-error probability as our proposed CRC-aided successive cancellation list decoders to demonstrate that, while our decoders have slightly lower throughput and larger area, they have a significantly smaller decoding latency.