arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.06801cs.ITmath.IT
收藏

Reed-Solomon 识别的实现与实验评估

Implementation and Experimental Evaluation of Reed-Solomon Identification

Roberto Ferrara, Luis Torres-Figueroa, Holger Boche, Christian Deppe, Wafa Labidi, Ullrich Mönich, Andrei Vlad-Costin

AI总结:

本文基于 Reed-Solomon 码实现识别码,并在软件定义无线电单载波系统中实验评估编码与解码计算延迟,揭示实际权衡可能削弱识别速率的理论优势。

摘要:

识别是一种通信范式,对于实际上并不需要可靠传输所有消息的应用,它有望带来相对于传输的指数级优势。值得注意的是,识别容量定理证明了与经典传输相比指数级更大的速率。然而,还存在这些定理未涵盖的额外权衡,这些权衡在将识别部署到实际通信环境中时变得重要。特别地,在本文中我们评估了使用识别码时编码器和解码器处的计算所引入的延迟。为此,我们使用基于 Reed-Solomon 码的显式码构造来实现它们,并将其集成到使用软件定义无线电的单载波传输系统中。我们对识别码实际方面的评估表明,如果不加以注意,这些权衡可能会损害由指数级大的识别速率所带来的理论优势。

英文摘要:

Identification is a communication paradigm that promises exponential advantages over transmission for applications that do not actually require all messages to be reliably transmitted. Notably, the identification capacity theorems prove exponentially larger rates compared to classical transmission. However, there exist additional trade-offs that are not captured by these theorems and which become relevant for the deployment of identification in practical communication settings. In particular, in this paper we evaluate the latency introduced by computations at the encoder and decoder when employing identification codes. For this, we implement them using an explicit code construction based on Reed-Solomon codes and integrate it into a single carrier transmission system using software-defined radios. Our evaluation of the practical aspects of identification codes show that unless care is taken, these trade-offs can compromise the theoretical advantage given by the exponentially large identification rates.

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

↑