arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.02740eess.SPcs.ITmath.IT
收藏

具有计算复杂性约束的低延迟通信

Low-Latency Communication with Computational Complexity Constraints

Hasan Basri Celebi, Antonios Pitarokoilis, Mikael Skoglund

摘要:

低时延通信是下一代无线网络中最重要的应用场景之一。通常在通信理论研究中,延迟被定义为在信道上传输数据包所需的时间。然而,对于非常严格的延迟要求和复杂度受限的接收器,解码分组所需的时间不能被忽略,并且必须通过精确建模被包括在总延迟分析中。在本文中,我们首先提出了一种方法来计算解码时间使用\textit{per bit}复杂性度量,并介绍了一个经验模型,准确地描述了解码复杂度与性能的最先进的代码之间的权衡。通过考虑各种通信参数,我们表明,包括解码时间的延迟分析的最佳选择的参数有显着的影响。

英文摘要:

Low-latency communication is one of the most important application scenarios in next-generation wireless networks. Often in communication-theoretic studies latency is defined as the time required for the transmission of a packet over a channel. However, with very stringent latency requirements and complexity constrained receivers, the time required for the decoding of the packet cannot be ignored and must be included in the total latency analysis through accurate modeling. In this paper, we first present a way to calculate decoding time using \textit{per bit} complexity metric and introduce an empirical model that accurately describes the trade-off between the decoding complexity versus the performance of state-of-the-art codes. By considering various communication parameters, we show that including the decoding time in latency analyses has a significant effect on the optimum selection of parameters.

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

↑