论文标题
列表viterbi解码PAC代码
List Viterbi Decoding of PAC Codes
论文作者
论文摘要
极化调整后的卷积（PAC）代码是特殊的串联代码，在该代码中，我们采用一对一的卷积变换作为极性变换之前的预编码步骤。在此方案中，极性变换（作为映射器）和连续的取消过程（作为Demapper）将合成矢量通道呈现到卷积转换。数值结果表明，这种串联改善了极地代码的锤距距离特性。在这项工作中，我们实现了平行列表viterbi算法（LVA），并展示误差校正性能如何从Viterbi算法（VA）的较差的性能转移到LVA中的约束长度，列表大小（本地排序和全局排序）中的列表解码的出色性能。此外，我们分析了LVA中路径的局部分类相对于列表解码中的全局排序以及分类延迟与误差校正性能之间的权衡的延迟。
Polarization-adjusted convolutional (PAC) codes are special concatenated codes in which we employ a one-to-one convolutional transform as a pre-coding step before the polar transform. In this scheme, the polar transform (as a mapper) and the successive cancellation process (as a demapper) present a synthetic vector channel to the convolutional transformation. The numerical results show that this concatenation improves the Hamming distance properties of polar codes. In this work, we implement the parallel list Viterbi algorithm (LVA) and show how the error correction performance moves from the poor performance of the Viterbi algorithm (VA) to the superior performance of list decoding by changing the constraint length, list size, and the sorting strategy (local sorting and global sorting) in the LVA. Also, we analyze the latency of the local sorting of the paths in LVA relative to the global sorting in the list decoding and the trade-off between the sorting latency and the error correction performance.
