论文标题
猜测到极化调整后的卷积（PAC）代码的顺序解码的应用
Application of Guessing to Sequential Decoding of Polarization-Adjusted Convolutional (PAC) Codes
论文作者
论文摘要
尽管具有极端的误差校正性能，但偏振化调整后的卷积（PAC）代码的顺序解码的计算量是随机的。在卷积代码的顺序解码中，计算截止速率表示解码平均计算复杂性的速率之间的区域是有限的，而这些速率是无限的。在本文中，通过从极化和猜测技术中受益，我们证明了预先转换的极性代码的顺序解码中的计算截止速率极化。计算截止速率的极化会影响预先转化的极性代码的速率构建标准。我们提出了一种用于驯服Reed-Muller（RM）速率构建的技术，并且性能结果表明，PAC代码的误差校正性能可以使用TAMED-RM速率构建构建实现理论界限，并且需要比RM速率构建的计算复杂性明显更低。
Despite the extreme error-correction performance, the amount of computation of sequential decoding of the polarization-adjusted convolutional (PAC) codes is random. In sequential decoding of convolutional codes, the computational cutoff rate denotes the region between rates whose average computational complexity of decoding is finite and those which is infinite. In this paper, by benefiting from the polarization and guessing techniques, we prove that the computational cutoff rate in sequential decoding of pre-transformed polar codes polarizes. The polarization of the computational cutoff rate affects the criteria for the rate-profile construction of the pre-transformed polar codes. We propose a technique for taming the Reed-Muller (RM) rate-profile construction, and the performance results demonstrate that the error-correction performance of the PAC codes can achieve the theoretical bounds using the tamed-RM rate-profile construction and requires a significantly lower computational complexity than the RM rate-profile construction.
