论文标题
快速列表的解码器，用于极化调整后的卷积（PAC）代码
Fast List Decoders for Polarization-Adjusted Convolutional (PAC) Codes
论文作者
论文摘要
证明了一个名为极化调整后的卷积（PAC）代码的最新编码方案，可在列表解码下处理代码（128,64）的分散体。但是，为了实现近乎结合的性能，列表解码的列表大小需要过大，这会导致无法忍受的延迟。在本文中，为了提高列表解码的速度，提出了PAC代码的快速列表解码器。我们定义了四种类型的组成节点，并为它们提供了快速列表解码算法。仿真结果显示，使用三种类型的组成节点进行快速列表解码可以产生与列表解码完全相同的错误校正性能，并减少代码的50％以上时间步骤（128,64）。此外，使用四种类型的组成节点对快速列表解码可以进一步减少可忽略的性能降解的解码延迟。
A latest coding scheme named polarization-adjusted convolutional (PAC) codes is shown to approach the dispersion bound for the code (128,64) under list decoding. However, to achieve the near-bound performance, the list size of list decoding needs to be excessively large, which leads to insufferable latency. In this paper, to improve the speed of list decoding, fast list decoders for PAC codes are proposed. We define four types of constituent nodes and provide fast list decoding algorithms for each of them. Simulation results present that fast list decoding with three types of constituent nodes can yield exactly the same error-correction performance as list decoding, and reduce more than 50% time steps for the code (128,64). Moreover, fast list decoding with four types of constituent nodes can further reduce decoding latency with negligible performance degradation.
