一种任意阵的方向图综合方法

张霞; 陶海红; 廖桂生

doi:10.3724/SP.J.1146.2006.01910

一种任意阵的方向图综合方法

doi: 10.3724/SP.J.1146.2006.01910

基金项目:

国家自然科学基金(60502045)资助课题

计量
- 文章访问数: 2784
- HTML全文浏览量: 89
- PDF下载量: 1072
- 被引次数: 0
出版历程
- 收稿日期: 2006-12-04
- 修回日期: 2007-07-09
- 刊出日期: 2008-03-19

Pattern Synthesis Method for Arbitrary Arrays

摘要

摘要: 该文提出一种新的基于优化理论的方向图综合算法。该方法先利用与相位无关的约束得到期望主瓣，再利用优化方法求解残余权矢量获得期望旁瓣，使残余权矢量对主瓣的影响控制在一定范围内，优化问题可看作是二次锥规划(SOCP)。与传统的对模值和相位均进行约束的综合方法相比，该方法要求综合期望方向图的模值，不仅能够有效地获取期望方向图，而且主瓣控制机制与参考点的选取无关。对多种任意阵的仿真结果证明该方法的有效性和正确性。
- 方向图综合; 任意阵; 二次锥规划
Abstract: A novel pattern synthesis algorithm based on optimization theory is presented in the paper. The algorithm initializes with the set of weights which is used to maintain the desired mainlobe with phase-independent derivative constraints, then the residual weight vector is optimized to acquire the desired sidelobe, the influence of the residual weight on the mainlobe will be confined to a certain bound. Object function can be considered as the Second-Order Cone Programming(SOCP). Compared with the existing pattern synthesis algorithms which synthesize the array patterns with both desired magnitude and phase response, the proposed algorithm which synthesizes the array patterns with only desired magnitude response, can efficiently work and is unrelated to the reference point. Computer simulations on some arbitrary arrays demonstrate the effectiveness and validity of the proposed algorithm.

HTML全文

参考文献(1)

Dolph C L. A current distribution for broadside arrays which optimizes the relationship between beam width and sidelobe level[J].Proc. IRE.1946, 34(6):335-348[2]Taylor T T. Design of line source antennas for narrow beamwidth and low sidelobes[J].IEEE Trans. on Antennas and and Propagation.1960, 8(6):17-22[3]Hyneman R T. A technique for the synthesis of line-source antenna patterns having specified sidelobe behavior[J].IEEE Trans. on Antennas and and Propagation.1968, 16(7):430-435[4]Elliott R S. Design of line source antennas for narrow beamwidth and asymmetric low sidelobes[J].IEEE Trans. on Antennas and and Propagation.1975, 23(5):100-107[5]Perini J. Note on antenna pattern synthesis using numerical iterative methods[J].IEEE Trans. on Antennas and and Propagation.1971, 19(3):284-286[6]Ng B P, Er M H, and Kot A C. A flexible array synthesis method using quadratic programming[J].IEEE Trans. on Antennas and and Propagation.1993, 41(11):1541-1550[7]Olen C A and Compton R T. A numerical pattern synthesis algorithm for arrays[J].IEEE Trans. on Antennas and and Propagation.1990, 38(10):1666-1676[8]Tseng C Y and Griffiths L J. A simple algorithm to achieve desired patterns or arbitrary arrays[J].IEEE Trans. on Signal Processing.1992, 40(11):2737-2746[9]Zhou Y and Ingram M A. Pattern synthesis for arbitrary arrays using an adaptive array method[J].IEEE Trans. on Antennas and and Propagation.1999, 47(5):862-869[10]Lebret H and Boyd S. Antenna array pattern synthesis via convex optimization[J].IEEE Trans. on Signal Processing.1997, 45(3):526-532[11]Wang F, Balakrishnan V, and Zhou Y. Optimal array pattern synthesis using semidefinite programming[J].IEEE Trans. on Signal Processing.2003, 51(5):1172-1183[12]Yan S F, Ma Y L, and Yang K D. Optimal array pattern synthesis with desired magnitude response. Sonar Detection Systems I, 2004, 14(11): 510-522.[13]Li J, Stoica P, and Wang Z S. Doubly constrained robust capon beamformer[J].IEEE Trans. on Signal Processing.2004, 52(9):2407-2422[14]Tseng C Y. Minimum variance beamforming with phase-independent derivative constraints[J].IEEE Trans. on Antennas and and Propagation.1992, 40(3):285-294[15]Guo Q H, Liao G S, and Wu Y T. Pattern synthesis method for arbitrary arrays based on LCMV criterion[J].Electronics Letters.2003, 39(23):1628-1630[16]Sturm J F. Using SeDuMi 1.02, A matlab toolbox for optimization over symmetric cones (updated for version 1.05). Optimization Methods and Software, 1999, 11(8): 625-653.

施引文献

资源附件(0)

访问统计