针对稀疏阵列天线多方向图可重构问题提出了一种基于序列二阶锥的算法。通过引入共轭对称激励,将方向图的上下界约束转化成凸问题;通过辅助变量的迭代加权,将稀疏阵列的阵元位置优化和多方向图的赋形转化为序列二阶锥问题。文中将算法从线阵推广至面阵,在任意主瓣宽度、响应波纹、零陷及副瓣电平的约束下,通过改变阵元的激励,皆可优化阵元位置排布。仿真结果验证了算法的有效性,可以达到降低天线系统成本的目的。

A sequential second-order cone programming(SSOCP) algorithm is proposed for synthesizing a reconfigurable pattern of thinned linear and planar arrays. By introducing conjugate symmetric weights, the upper and non-convex lower bounds of the pattern are converted to convex problems. The iterative weighting of the auxiliary variables is used to transform the optimization of the element position and reconfigurable multi-pattern into a SSOCP problem. This paper extends the algorithm from linear to planar arrays under the constraints of arbitrary main lobe width, response ripple, null region and side lobe level, array configuration can be optimized through array excitation. The simulation results verify that the algorithm can effectively lower the cost of the antenna system.

TN82

国家自然科学基金资助项目(61671239);南京航空航天大学研究生创新基地(实验室)开放基金资助项目(kfjj20180406)