论文标题
与计算复杂性约束的延迟和可靠性权衡：OS解码器和概括
Latency and Reliability Trade-off with Computational Complexity Constraints: OS Decoders and Generalizations
论文作者
论文摘要
在本文中，我们研究了在存在解码的复杂性约束的情况下，超可靠的低延迟通信（URLLC）的潜伏期和可靠性权衡问题。我们考虑在二进制输入AWGN通道上传输的线性块编码的代码字，并用订单统计（OS）解码器解码。我们首先研究OS解码器的性能是解码复杂性的函数，并提出了一个经验模型，该模型可以准确量化相应的权衡。接下来，提出了计算复杂性限制接收器的汇总延迟的一致方法，其中还包括解码引起的延迟。结果表明，有了严格的延迟要求，解码潜伏期不能以复杂性约束的接收器忽略。接下来，基于提出的模型，引入和解决了与URLLC系统设计相关的几个优化问题。结果表明，当考虑对解码复杂性的约束时，解码时间对URLLC系统的设计具有巨大影响。最后，还可以说明，提出的模型可以仔细描述其他针对URLLC的候选编码解决方案的性能与复杂性权衡，例如尾巴卷积代码，极性代码和低密度奇偶校验检查代码。
In this paper, we study the problem of latency and reliability trade-off in ultra-reliable low-latency communication (URLLC) in the presence of decoding complexity constraints. We consider linear block encoded codewords transmitted over a binary-input AWGN channel and decoded with order-statistic (OS) decoder. We first investigate the performance of OS decoders as a function of decoding complexity and propose an empirical model that accurately quantifies the corresponding trade-off. Next, a consistent way to compute the aggregate latency for complexity constrained receivers is presented, where the latency due to decoding is also included. It is shown that, with strict latency requirements, decoding latency cannot be neglected in complexity constrained receivers. Next, based on the proposed model, several optimization problems, relevant to the design of URLLC systems, are introduced and solved. It is shown that the decoding time has a drastic effect on the design of URLLC systems when constraints on decoding complexity are considered. Finally, it is also illustrated that the proposed model can closely describe the performance versus complexity trade-off for other candidate coding solutions for URLLC such as tail-biting convolutional codes, polar codes, and low-density parity-check codes.
