Pattern Synthesis of Narrowband Conformal Arrays Using Iterative Second-Order Cone Programming

Pattern Synthesis of Narrowband Conformal Arrays Using Iterative Second-Order Cone Programming
复制标题

DOI:
10.1109/tap.2010.2046865
复制
发表时间:
2010-03
影响因子:
5.7
通讯作者:
K. Tsui;Chan;K. Tsui;S. C. Chan
K. Tsui;Chan;K. Tsui;S. C. Chan
中科院分区:
计算机科学2区
文献类型:
--
作者:
K. Tsui;Chan;K. Tsui;S. C. Chan

文献摘要

被引文献

相似文献

针对窄带共形阵列的功率波束或赋形波束方向图综合问题,提出了一种新的设计方法。该方法对非凸功率型函数进行迭代线性化,得到设计变量中的凸子问题,该问题可用二阶锥规划(SOCP)进行优化求解。此外,还可以合并各种各样的幅值约束,例如非凸下界幅值约束。为了进一步提高该方法的可靠性,还提出了一种确定问题合理的初始猜想的有效技术。计算机模拟表明,这样得到的初始猜测在满足各种规定的震级约束的同时收敛到满意的解。设计结果表明,该方法的性能与已有的各向同性单元均匀线阵的最优解相当。算例表明,该方法同样适用于任意阵列结构、任意极化特性和互耦合效应的一般非凸功率方向图综合问题。
A new design method is proposed for the power or shaped beam pattern synthesis problem of narrowband conformal arrays, where only the magnitude response is specified. The proposed method iteratively linearizes the non-convex power pattern function to obtain a convex subproblem in the design variables, which can be solved optimally using second-order cone programming (SOCP). In addition, a wide variety of magnitude constraints such as non-convex lower bound magnitude constraints can be incorporated. An efficient technique for determining a reasonably good initial guess to the problem is also proposed to further improve the reliability of the method. Computer simulations show that the initial guesses so obtained converge to satisfactory solutions while satisfying various prescribed magnitude constraints. Design results show that the performance of the proposed method is comparable to the optimal solution previously obtained for uniform linear arrays with isotropic elements. Moreover, we show by means of examples that the proposed method is also applicable to general non-convex power pattern synthesis problems involving arbitrary array geometries, arbitrary polarization characteristics and mutual coupling effect.