AI 中文总结
研究用于AirComp的PASS离散激活问题,通过推导最优聚合向量、MSE表达式及一阶递归,开发贪心搜索、波束搜索和相干聚合搜索快速树搜索方法,显著提高了PASS相对于传统天线阵列的AirComp精度。
AI 中文摘要
考虑用于空中计算(AirComp)的收缩天线系统(PASS)。基站部署多个介质波导,每个波导上激活一个收缩天线(PA)。实际应用中,每个PA限于一组预配置的有限位置。由此产生的离散激活问题被公式化以最小化AirComp均方误差(MSE)。得出最优聚合向量后,通过逆Gram矩阵表示最小MSE。推导一阶递归以评估每个候选产生的精确MSE降低。然后开发贪心搜索和波束搜索进行快速树搜索。为进一步降低复杂度,从一阶MSE近似提出相干聚合搜索。它允许可分离的闭式选择规则,在低信噪比(SNR) regime中渐近最优。数值结果表明,所提方法显著提高了PASS相对于传统天线阵列的AirComp精度。
英文摘要
A pinching-antenna system (PASS) is considered for over-the-air computation (AirComp). 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 set of preconfigured locations. The resulting discrete activation problem is formulated to minimize the AirComp mean-squared error (MSE). After the optimal aggregation vector is derived, the minimum MSE is expressed through an inverse Gram matrix. A rank-one recursion is derived to evaluate the exact MSE reduction produced by each candidate. Greedy search and beam search are then developed for fast tree search. To further reduce complexity, coherent aggregation search is proposed from a first-order MSE approximation. It admits a separable closed-form selection rule and is asymptotically optimal in the low signal-to-noise ratio (SNR) regime. Numerical results show that the proposed methods substantially improve the AirComp accuracy of PASS over conventional antenna arrays.
Comments5 pages