低副瓣直线阵的最坏情况容差最优化方法研究

本文以激励系数为设计参量,讨论了直线阵的最坏情况容差最优化问题,给出了直线阵的最坏情况问题,固定容差问题和可变容差问题,研究了它们的新求解方法。固定容差问题将采用正多面体方法来求解,可变容差问题由一个双层迭代算法求解。可变容差问题以实际与理想方向图在容差域中的最大偏差为基准,协调阵列方向图的副(?)电平和激励系数的容差,使阵列方向图的副(?)电平满足所希望的指标要求,同时尽可能地放宽激励系数的容差,文中最后给出了6元和16元直线阵的最坏情况容差最优化的模拟计算结果。

Worst-Case Tolerance Optimization of Low Sidelobe Linear Arrays

This paper discusses the worst-case tolerance optimization of linear arrays,using excitation coefficients as design parameters.The problem considered is defined mathematically as a worst-case problem,a fixed tolerance problem(FTP)and a variable tolerance problem(VTP) and the new algorithms for solving this problem is presented.For solution of the FTP,we use the regular polyhedron method.The VTP is solved by a double iterative algorithm in which the inner iteration is performed by the FTP algorithm and the outer iteration is implemented by the comparison method.The VTP,which uses the largest discrepancy between the desired and the actual patterns in the tolerance region as the standard,harmonizes the relation between the array sklelobe level and the tolerance of excitation coefficients,so that the sidelobe level satisfies the desired requirements and the tolerance region is as large as possible.Finally,the numerical results of the 6-element and 16-element linear array tolerance optimization designs are given.