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

夹捏天线辅助感知:贝叶斯克拉美-罗界视角

Pinching-Antenna Assisted Sensing: A Bayesian Cramér-Rao Bound Perspective

The University of Hong Kong(香港大学);Khalifa University(哈利法大学);University of Manchester(曼彻斯特大学)

Hao Jiang, Chongjun Ouyang, Zhaolin Wang, Yuanwei Liu, Arumugam Nallanathan, Zhiguo Ding

AI总结:

本文从贝叶斯克拉美-罗界角度研究夹捏天线系统的感知极限,提出两种目标调度协议并优化功率分配,证明其性能优于传统固定阵列。

摘要:

从贝叶斯克拉美-罗界(BCRB)的角度研究了夹捏天线系统(PASS)的基本感知极限。与传统CRB相比,BCRB不依赖于感知参数的具体值,且不受估计器无偏性的限制,因此为评估感知性能提供了一个实用且全面的下界。分析了在时分多址(TDMA)方案下,多个目标向单波导PASS发送上行导频的系统。对于单目标场景,我们的分析揭示了感知质心(即最优PA位置)与分布质心(即目标先验分布的中心)之间的独特失配,强调了动态PA重新定位的必要性。对于多目标场景,提出了两种目标调度协议:1)夹捏切换(PS),对每个时隙执行单独的夹捏波束成形;2)夹捏复用(PM),在所有时隙中应用单一的波束成形配置。基于这些协议,分别制定了在BCRB阈值下的总功率最小化问题和在总功率约束下的最小-最大BCRB问题。通过利用Karush-Kuhn-Tucker(KKT)条件,这些问题被等价地转换为对PA位置的搜索,并使用逐元素算法求解。数值结果表明:i)具有大规模可重构性的PASS相比传统固定位置阵列能显著提升感知性能;ii)PS比PM提供更稳健的性能,但代价是更高的计算复杂度。

英文摘要:

The fundamental sensing limit of pinching-antenna systems (PASS) is studied from a Bayesian Cramér-Rao bound (BCRB) perspective. Compared to conventional CRB, BCRB is independent of the exact values of sensing parameters and is not restricted by the unbiasedness of the estimator, thus offering a practical and comprehensive lower bound for evaluating sensing performance. A system where multiple targets transmit uplink pilots to a single-waveguide PASS under a time-division multiple access (TDMA) scheme is analyzed. For the single-target scenario, our analysis reveals a unique mismatch between the sensing centroid (i.e., the optimal PA position) and the distribution centroid (i.e., the center of the target's prior distribution), underscoring the necessity of dynamic PA repositioning. For the multi-target scenario, two target scheduling protocols are proposed: 1) pinch switching (PS), which performs separate pinching beamforming for each time slot, and 2) pinch multiplexing (PM), which applies a single beamforming configuration across all slots. Based on these protocols, both the total power minimization problem under a BCRB threshold and the min-max BCRB problem under a total power constraint are formulated. By leveraging Karush-Kuhn-Tucker (KKT) conditions, these problems are equivalently converted into a search over PA positions and solved using an element-wise algorithm. Numerical results show that i)~PASS, endowed with large-scale reconfigurability, can significantly enhance the sensing performance compared with conventional fixed-position arrays, and ii)~PS provides more robust performances than PM at the cost of higher computational complexity.

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

↑