论文标题
CRC辅助列表解码5G中短消息的卷积和极地代码
CRC-Aided List Decoding of Convolutional and Polar Codes for Short Messages in 5G
论文作者
论文摘要
本文探讨了卷积和极性代码的列表，以解码短消息，例如5G物理广播频道中的列表。循环冗余检查（CRC）用于从可能的代码字列表中选择一个代码字。 5G标准中的一个示例用24位CRC和512位极地代码编码32位消息，并通过重复添加额外的位，以达到32/864的非常低的速度。本文表明，优化CRC长度可改善此极地代码的$ e_b/n_0 $性能，其中$ e_b/n_0 $是每个数据位与噪声功率频谱密度的能量的比率。此外，通过用远距离光谱（DSO）CRC替换极性卷积代码（TBCC），可以实现更好的$ e_b/n_0 $性能。本文以$ e_b/n_0 $的特定值来确定最佳CRC长度，以最大程度地降低速率1/5 TBCC的帧错误率（FER）。我们还表明，这种优化的TBCC/CRC可以达到相同的出色$ e_b/n_0 $性能，而5G极性代码的32/864速度非常低，在此中，低率是通过重复来实现的。我们表明，根据FER和解码运行时间，所提出的TBCC/CRC串联代码在5G标准中所描述的PBCH Polar Code的表现优于PBCH Polar Code。随着CRC大小的变化，我们还探讨了未检测到的错误率和擦除率之间的权衡。
This paper explores list decoding of convolutional and polar codes for short messages such as those found in the 5G physical broadcast channel. A cyclic redundancy check (CRC) is used to select a codeword from a list of likely codewords. One example in the 5G standard encodes a 32-bit message with a 24-bit CRC and a 512-bit polar code with additional bits added by repetition to achieve a very low rate of 32/864. This paper shows that optimizing the CRC length improves the $E_b/N_0$ performance of this polar code, where $E_b/N_0$ is the ratio of the energy per data bit to the noise power spectral density. Furthermore, even better $E_b/N_0$ performance is achieved by replacing the polar code with a tail-biting convolutional code (TBCC) with a distance-spectrum-optimal (DSO) CRC. This paper identifies the optimal CRC length to minimize the frame error rate (FER) of a rate-1/5 TBCC at a specific value of $E_b/N_0$. We also show that this optimized TBCC/CRC can attain the same excellent $E_b/N_0$ performance with the very low rate of 32/864 of the 5G polar code, where the low rate is achieved through repetition. We show that the proposed TBCC/CRC concatenated code outperforms the PBCH polar code described in the 5G standard both in terms of FER and decoding run time. We also explore the tradeoff between undetected error rate and erasure rate as the CRC size varies.
