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

Pattern Synthesis Method for Arbitrary Arrays

作　　者：张霞[1] 陶海红[1] 廖桂生[1] 

机构地区：[1]西安电子科技大学雷达信号处理国家重点实验室,西安710071

出　　处：《电子与信息学报》2008年第3期738-741,共4页Journal of Electronics & Information Technology

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

摘　　要：该文提出一种新的基于优化理论的方向图综合算法。该方法先利用与相位无关的约束得到期望主瓣,再利用优化方法求解残余权矢量获得期望旁瓣,使残余权矢量对主瓣的影响控制在一定范围内,优化问题可看作是二次锥规划(SOCP)。与传统的对模值和相位均进行约束的综合方法相比,该方法要求综合期望方向图的模值,不仅能够有效地获取期望方向图,而且主瓣控制机制与参考点的选取无关。对多种任意阵的仿真结果证明该方法的有效性和正确性。A novel pattern synthesis algorithm based on optimization theory is presented in the paper. The algorithm initializes withthe 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.

关 键 词：方向图综合 任意阵 二次锥规划 

分 类 号：TN821[电子电信—信息与通信工程]