Optimal Placement of Position Reconfigurable Antennas
Date:
介绍位置可重构天线的最优部署问题，涵盖连续与离散两类方案：连续情形将天线密度设计建模为泛函优化问题，刻画口径资源在阵列上的最优分配；离散情形将天线位置类比为静电平衡中的电荷位置，最优部署对应 Heine–Stieltjes 方程多项式解的零点，在近场 LoS 场景下退化为 Heun 方程，在远场进一步退化为 Jacobi 方程，从而给出低复杂度的解析天线部署方案。
This talk presents the optimal placement of position reconfigurable antennas, covering both continuous and discrete designs. In the continuous case, antenna density design is formulated as a functional optimization problem that characterizes the optimal allocation of aperture resources over the array. In the discrete case, antenna positions are treated by analogy with charges in electrostatic equilibrium: the optimal placement coincides with the zeros of the polynomial solution to a Heine–Stieltjes equation, which degenerates to a Heun equation in near-field LoS scenarios and further to a Jacobi equation in the far field, yielding analytical, low-complexity antenna placement designs.