AI 中文总结
研究上行多用户收缩天线系统，将和速率最大化问题转化为分层树搜索，开发了贪心搜索、波束搜索和最优分支定界搜索算法，数值结果表明算法性能优于传统固定阵列。
AI 中文摘要
考虑一个上行多用户收缩天线系统（PASS），基站部署多个介质波导，每个波导激活一个收缩天线（PA）。实际中PA限于有限预配置位置。上行和速率最大化问题表示为分层树搜索。开发了三种算法：贪心搜索（GS）、波束搜索（BeS）和最优分支定界（BnB）搜索。数值结果表明相比传统固定阵列有显著增益。
英文摘要
An uplink multiuser pinching-antenna system (PASS) is considered, where multiple dielectric waveguides are deployed at the base station and one pinching antenna (PA) is activated on each waveguide. For practical implementation, each PA is restricted to a finite number of preconfigured locations. The resulting uplink sum-rate maximization problem is represented as a layered tree search. Three algorithms are then developed: a greedy search (GS), a beam search (BeS), and an optimal branch-and-bound (BnB) search. In GS, the locally best branch is selected through efficient matrix-inverse updates. In BeS, several promising partial paths are retained to provide a tunable performance-complexity tradeoff. In BnB, noncompetitive subtrees are pruned through a monotonic transformed objective without loss of optimality. Substantial gains over a conventional fixed array are demonstrated by numerical results. Near-optimal performance is also achieved by GS and moderate-width BeS at a lower computational co t than BnB.
CommentsThis paper has some technical errors
