In this paper, we investigate a movable antenna (MA) enabled anti-jamming optimization problem, where a legitimate uplink system is exposed to multiple jammers with unknown jamming channels. To enhance the anti-jamming capability of the considered system, an MA array is deployed at the receiver, and the antenna positions and the minimum-variance distortionless-response (MVDR) receive beamformer are jointly optimized to maximize the output signal-to-interference-plus-noise ratio (SINR). The main challenge arises from the fact that the interference covariance matrix is unknown and nonlinearly dependent on the antenna positions. To overcome these issues, we propose a surrogate objective by replacing the unknown covariance with the sample covariance evaluated at the current antenna position anchor. Under a two-timescale framework, the surrogate objective is updated once per block (contains multiple snapshots) at the current anchor position, while the MVDR beamformer is adapted on a per-snapshot basis. We establish a local bound on the discrepancy between the surrogate and the true objective by leveraging matrix concentration inequalities, and further prove that a natural historical-averaging surrogate suffers from a non-vanishing geometric bias. Building on these insights, we develop a low-complexity projected trust-region (TR) surrogate optimization (PTRSO) algorithm that maintains the locality of each iteration via TR constraints and enforces feasibility through projection, which is guaranteed to converge to a stationary point near the anchor. Numerical results verify the effectiveness and robustness of the proposed PTRSO algorithm, which consistently achieves higher output SINR than existing baselines.
翻译:本文研究了一种基于移动天线(MA)的抗干扰优化问题,其中合法上行链路系统暴露于多个干扰源且其干扰信道未知。为增强所考虑系统的抗干扰能力,接收端部署了MA阵列,通过联合优化天线位置和最小方差无失真响应(MVDR)接收波束成形器,以最大化输出信号与干扰加噪声比(SINR)。主要挑战源于干扰协方差矩阵未知且非线性依赖于天线位置。为克服这些问题,我们提出一种代理目标函数,将未知协方差替换为在当前天线位置锚点处评估的样本协方差。在双时间尺度框架下,代理目标函数在每个数据块(包含多个快照)的当前锚点位置更新一次,而MVDR波束成形器则在每个快照基础上自适应调整。通过利用矩阵集中不等式,我们建立了代理目标与真实目标间差异的局部界,并进一步证明自然历史平均代理方法存在不可忽略的几何偏差。基于这些分析,我们开发了一种低复杂度的投影信赖域(TR)代理优化(PTRSO)算法,该算法通过TR约束保持每次迭代的局部性,并通过投影确保可行性,且保证收敛到锚点附近的稳定点。数值结果验证了所提PTRSO算法的有效性与鲁棒性,其输出SINR始终优于现有基线方法。