基于迭代自适应凸优化的天线阵列方向图综合方法

    Pattern Synthesis Method of Antenna Array Based on Iterative Adaptive Convex Optimization

    • 摘要: 针对天线阵列中给定副瓣电平下的波束宽度优化综合问题,文中提出了一种基于迭代自适应凸优化的天线阵列方向图综合方法,并给出了该算法的流程。在给定副瓣电平的情况下,通过凸优化算法对天线阵列方向图进行优化,并使用了二分的策略对波束宽度进行迭代搜索,实现了对控制副瓣电平下的波束宽度优化综合。首先,文中通过对方向图主瓣添加约束条件保证了最大辐射方向指向目标方向;其次,文中采用了切比雪夫激励分布方向图对应的主瓣零功率波束宽度作为初始波束宽度的参考点;最后,当初始化副瓣电平过低导致方向图主瓣发生畸变时,该算法通过优化得到了天线阵列所能实现的最低副瓣电平下的方向图。仿真结果表明,所提出的算法能够得到合理的给定副瓣电平下的阵列天线最窄笔形波束方向图。在理想点源结果的基础上,引入实际天线阵列进行全波仿真分析,验证了该方法的可行性。

       

      Abstract: Aiming at the problem of beam width optimization synthesis in antenna array at given sidelobe level, a pattern synthesis method of antenna array based on iterative adaptive convex optimization is proposed, and the process of the algorithm is given. Under the condition that the sidelobe level is given, the beam pattern of the antenna array is optimized by the convex optimization algorithm, and the bi-partitioning strategy is used to search the beam width iteratively, the optimization synthesis of the beam width under the control sidelobe level is realized. Firstly, constraints are added to the main lobe of the pattern to ensure that the maximum radiation direction is directed towards the target direction. Secondly, the main lobe zero power beam width corresponding to Chebyshev excitation distribution pattern is used as the reference point of the initial beam width. Finally, when the initial sidelobe level is too low, resulting in the distortion of the main lobe of the pattern, the pattern under the lowest sidelobe level that can be realized by the algorithm is optimized. The simulation results show that the proposed algorithm can obtain the narrowest pencil beam pattern of the array antenna at a reasonable sidelobe level. On the basis of the ideal point source array results, the actual antenna is introduced to obtain the full wave simulation results, and the feasibility of the method is verified.

       

    /

    返回文章
    返回