论文标题
块正交稀疏叠加代码,用于超级可靠的低延迟通信
Block Orthogonal Sparse Superposition Codes for Ultra-Reliable Low-Latency Communications
论文作者
论文摘要
低率和短包传输对于超级可靠的低延迟通信(URLLC)很重要。在本文中,我们为URLLC提出了一个新的稀疏叠加代码,称为块正交稀疏叠加(Boss)代码。我们首先提出了一种代码构建方法,用于有效编码BOSS代码。关键思想是通过使用顺序映射策略的词典矩阵的正交列的叠加来构造编码字。我们还提出了一个大约最大的后验概率(MAP)解码器,具有两个阶段。近似地图解码器通过平行解码结构显着降低了解码延迟,同时保持了与近极代码的连续取消列表(SCL)解码器的可比解码复杂性。此外,为了衡量有限块长度制度中的代码性能,我们根据相关代码参数得出了单层Boss代码的块 - 误差率(BLERS)的精确分析表达式。最后,我们提出了一个循环冗余检查辅助辅助(CA-BOSS)代码,其中简单列表解码以提高代码性能。我们的实验验证了简单列表解码器的CA-BOSS优于SCL在低率和有限块长度方面的SCL解码,同时实现了信噪比的一个dB中的有限宽长容量上限。
Low-rate and short-packet transmissions are important for ultra-reliable low-latency communications (URLLC). In this paper, we put forth a new family of sparse superposition codes for URLLC, called block orthogonal sparse superposition (BOSS) codes. We first present a code construction method for the efficient encoding of BOSS codes. The key idea is to construct codewords by the superposition of the orthogonal columns of a dictionary matrix with a sequential bit mapping strategy. We also propose an approximate maximum a posteriori probability (MAP) decoder with two stages. The approximate MAP decoder reduces the decoding latency significantly via a parallel decoding structure while maintaining a comparable decoding complexity to the successive cancellation list (SCL) decoder of polar codes. Furthermore, to gauge the code performance in the finite-blocklength regime, we derive an exact analytical expression for block-error rates (BLERs) for single-layered BOSS codes in terms of relevant code parameters. Lastly, we present a cyclic redundancy check aided-BOSS (CA-BOSS) code with simple list decoding to boost the code performance. Our experiments verify that CA-BOSS with the simple list decoder outperforms CA-polar codes with SCL decoding in the low-rate and finite-blocklength regimes while achieving the finite-blocklength capacity upper bound within one dB of signal-to-noise ratio.