arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2011.03565cs.ITmath.IT
收藏

保留突发错误,摒弃交织器

Keep the bursts and ditch the interleavers

Wei An, Muriel Médard, Ken R. Duffy

AI总结:

本文提出GRAND-MO译码算法,通过放弃交织并利用突发噪声特性,实现低时延、短码、高速率通信,并证明随机线性码比结构化码更适合突发信道。

摘要:

为了促进物联网、5G及未来通信中的应用,工程上需要实现高速率、低时延的通信。物理信道中的错误通常成簇出现,但大多数译码器在设计时假设信道是无记忆的。因此,通信网络依赖对成千上万个比特进行交织,以使信道条件符合译码器的假设。即使对于短的高速率码,在发送端等待足够的数据进行交织以及在接收端进行解交织,也是造成不必要时延的重要来源。在非交织信道上使用现有译码器会导致误块率性能下降,原因在于译码器的信道模型与真实信道行为之间不匹配。通过对最近提出的猜测随机加性噪声译码(GRAND)算法的进一步发展,我们提出了称为GRAND-MO(即GRAND Markov Order,GRAND马尔可夫阶)的算法,在此证明:通过放弃交织并接纳突发噪声,可以实现低时延、短码、高速率通信,其误块率性能以显著优势优于交织对应方案。此外,虽然大多数译码器与特定的码本结构绑定,但GRAND-MO可以译码任意码。利用这一特性,我们证明某些众所周知的具有特定结构的码不适合用于突发信道,而随机线性码(RLCs)对相关噪声具有鲁棒性。这项工作表明,将RLCs与GRAND-MO结合使用,是要求高吞吐量和低时延应用的一个良好候选方案。

英文摘要:

To facilitate applications in IoT, 5G, and beyond, there is an engineering need to enable high-rate, low-latency communications. Errors in physical channels typically arrive in clumps, but most decoders are designed assuming that channels are memoryless. As a result, communication networks rely on interleaving over tens of thousands of bits so that channel conditions match decoder assumptions. Even for short high rate codes, awaiting sufficient data to interleave at the sender and de-interleave at the receiver is a significant source of unwanted latency. Using existing decoders with non-interleaved channels causes a degradation in block error rate performance owing to mismatch between the decoder's channel model and true channel behaviour. Through further development of the recently proposed Guessing Random Additive Noise Decoding (GRAND) algorithm, which we call GRAND-MO for GRAND Markov Order, here we establish that by abandoning interleaving and embracing bursty noise, low-latency, short-code, high-rate communication is possible with block error rates that outperform their interleaved counterparts by a substantial margin. Moreover, while most decoders are twinned to a specific code-book structure, GRAND-MO can decode any code. Using this property, we establish that certain well-known structured codes are ill-suited for use in bursty channels, but Random Linear Codes (RLCs) are robust to correlated noise. This work suggests that the use of RLCs with GRAND-MO is a good candidate for applications requiring high throughput with low latency.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑