多播pinching天线系统中的Pinching天线系统
Multicasting Pinching Antenna Systems With LoS Blockage
AI总结：
本文研究了在非视距环境中，通过MM原理优化PAs位置分配以实现多播，证明了BSM在用户和PAs数量增加时具有更优的计算复杂度。
摘要：
Pinching-antenna系统（PASS）代表了在高频段中一种有前途的可定制无线接入机制，通过介电波导和可移动介电粒子（称为pinching天线，PAs）实现。本文研究了在下行链路中多播时，当用户与PAs之间不一定存在视距（LoS）链路时，PAs在PASS中的最佳位置分配。多播问题通过利用最小化最大化（MM）原理来获得可证明收敛的算法。在每次MM基于过程的运行中，我们使用两种方法解决凸的替代问题：候选搜索方法（CSM）和二分搜索方法（BSM）。通过BSM和CSM，我们不仅报告了在非LoS环境中，PASS多播性能优于传统天线系统（CAS），还确定了当用户和PAs数量增加时，BSM在整体计算复杂度上表现更优。例如，当有8个PAs和25个用户时，CSM的执行时间大约是BSM的2.5倍。
英文摘要：
Pinching-antenna systems (PASS) represent a promising customizable wireless access mechanism in high-frequency bands, enabled by dielectric waveguides and movable dielectric particles, called pinching antennas (PAs). In this work, we study optimal position allocation of PAs in PASS for multicasting in the downlink when a line-of-sight (LoS) link does not necessarily exist between all users and the PAs. The multicasting problem is solved by leveraging minorization-maximization (MM) principle to yield a provably convergent algorithm. In each run of the MM based procedure, we solve a convex surrogate problem using two methods called the candidate search method (CSM) and the bisection search method (BSM). With both BSM and CSM, we not only report superior performance of the multicasting PASS in non-LoS environments compared to conventional antenna systems (CAS), but also determine that BSM yields better overall computational complexity when the number of users and PAs increases. For example, we report that when we have 8 PAs and 25 users, the execution time with the CSM is approximately 2.5 times that with the BSM.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
