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

无源多址接入的每比特最小能耗及基于位置的码本划分

Minimum Energy per Bit of Unsourced Multiple Access with Location-Based Codebook Partitioning

Chalmers University of Technology(查尔姆斯理工大学);Linköping University(林雪平大学)

Deekshith Pathayappilly Krishnan, Kaan Okumus, Khac-Hoang Ngo, Giuseppe Durisi

AI总结:

本文研究了在异质路径损耗条件下,基于位置的码本划分策略对无源多址接入系统每比特最小能耗的影响,通过数值模拟和大系统分析评估其性能优势。

摘要:

我们推导了在存在异质路径损耗条件下的高斯无源多址(UMA)信道中,有限块长下可实现的每比特最小能耗界限。我们考虑了一个路径损耗已知给用户的场景,这使得能够使用基于位置的码本划分[Çakmak et al., 2025]。通过数值模拟和基于副本方法的大系统分析,我们量化了该策略相对于传统UMA方法(所有用户使用共同码本)的性能增益。

英文摘要:

We derive finite-blocklength bounds on the minimum achievable energy per bit over a Gaussian unsourced multiple access (UMA) channel in the presence of heterogeneous path-loss conditions. We consider a setting in which the path loss is known to the users, which enables the use of location-based codebook partitioning [Çakmak et al., 2025]. Through numerical simulations and a large-system analysis based on the replica method, we quantify the performance gain of this strategy relative to the conventional UMA approach in which all users employ a common codebook.

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

↑