论文标题
有限的可计算对话，以进行有限宽度的通信
Efficiently Computable Converses for Finite-Blocklength Communication
论文作者
论文摘要
本文提出了一种使用离散无内存通道（DMC）的反馈的固定长度代码速率计算有限块长度匡威的方法。新的匡威是根据随机控制问题表示的，该问题可以使用动态编程和傅立叶方法有效地计算该解决方案。对于诸如二元对称通道（BSC）和二元擦除通道（BEC）之类的通道，所提出的匡威的准确性与现有的特殊用途匡威边界的准确性相似，但是新的相反技术可以应用于任意DMC。我们为二进制不对称通道（BAC）和量化幅度受限的AWGN通道提供了新的匡威技术的示例应用。
This paper presents a method for computing a finite-blocklength converse for the rate of fixed-length codes with feedback used on discrete memoryless channels (DMCs). The new converse is expressed in terms of a stochastic control problem whose solution can be efficiently computed using dynamic programming and Fourier methods. For channels such as the binary symmetric channel (BSC) and binary erasure channel (BEC), the accuracy of the proposed converse is similar to that of existing special-purpose converse bounds, but the new converse technique can be applied to arbitrary DMCs. We provide example applications of the new converse technique to the binary asymmetric channel (BAC) and the quantized amplitude-constrained AWGN channel.
