arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2405.12937eess.SPcs.ITmath.IT
收藏

SIC下和速率的渐近分析

Asymptotic analysis of sum-rate under SIC

Andrea Baiocchi, Asmad Razzaque

AI总结:

本文在理论框架下分析了SIC接收机在支持海量物联网免授权接入中的大规模性能,证明了当发射机数量趋于无穷大时,正确解码数据包数量的概率分布渐近趋向确定性分布。

摘要:

为了限制大量节点之间的协调和竞争成本,需要采用免授权方法,利用物理层技术来解决碰撞问题。连续干扰消除(SIC)正成为多址接入信道接收机的关键构建模块,以支持海量物联网。本文在理论框架中探讨了SIC的大规模性能。针对具有$n$个发射机的共享信道,提出了SIC接收机的通用模型。当$n \rightarrow \infty$时,对于适当缩放的目标信号噪声干扰比(SNIR),刻画了渐近和速率性能。结果表明,当$n$较大时,正确解码数据包数量的概率分布渐近趋向于确定性分布。在假设所有节点的平均接收功率水平相同(通过功率控制)的情况下,针对无线信道增益的任意概率分布进行了渐近分析。

英文摘要:

Limitation of the cost of coordination and contention among a large number of nodes calls for grant-free approaches, exploiting physical layer techniques to solve collisions. Successive Interference Cancellation (SIC) is becoming a key building block of multiple access channel receiver, in an effort to support massive Internet of Things (IoT). In this paper, we explore the large-scale performance of SIC in a theoretical framework. A general model of a SIC receiver is stated for a shared channel with $n$ transmitters. The asymptotic sum-rate performance is characterized as $n \rightarrow \infty$, for a suitably scaled target Signal to Noise Interference Ratio (SNIR). The probability distribution of the number of correctly decoded packets is shown to tend to a deterministic distribution asymptotically for large values of $n$. The asymptotic analysis is carried out for any probability distribution of the wireless channel gain, assuming that the average received power level is same for all nodes, through power control.

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

↑