A flexible array synthesis method using quadratic programming
A flexible array synthesis method using quadratic programming
复制标题
DOI：
10.1109/8.267354
复制
发表时间：
1993-11
影响因子：
5.7
通讯作者：
B. Ng;M. Er;C. Kot
中科院分区：
文献类型：
--
作者：
B. Ng;M. Er;C. Kot
提出了一种灵活的任意阵列综合方法，使其在最小均方误差的意义下最好地逼近所需的阵列方向图。该技术的基本思想是形成一个二次规划，其成本函数由阵列响应和由已知数学函数描述的适当选择的图案之间的均方误差给出。该二次规划可以是约束或无约束优化问题，这取决于期望阵列方向图的要求。在制定二次规划时，没有对各个阵元的增益/相位响应或特性进行假设。因此，只要能够准确地对阵列进行建模，就可以将任意形状的阵列合成为任何适当的图案，其中考虑了阵列元件的特性。以切比雪夫多项式或零函数为设计模板，将该方法应用于不同形状的线阵和平面阵（包括矩形和圆形平面阵）的综合，验证了该方法的可行性。>
A highly flexible synthesis method for an arbitrary array is proposed to best approximate a desired array pattern in a minimum-mean-square-error sense. The basic idea of the technique is to form a quadratic program with its cost function given by the mean-square error between the array response and a properly selected pattern described by a known mathematical function. This quadratic program can be a constrained or unconstrained optimization problem depending on the requirements of the desired array pattern. In formulating the quadratic program, no assumption has been made on the gain/phase response or characteristics of the individual array elements. Therefore, one can synthesize an array of arbitrary shape to any appropriate pattern with the characteristic of the array elements taken into consideration as long as one is able to model the array accurately. The proposed method is used to synthesize arrays of different shapes, linear as well as planar arrays (including rectangular and circular planar arrays), using a Chebyshev polynomial or zero function as a design template, to illustrate the feasibility of the proposed method. >