基于Gram—Schmidt正交化的线阵方向图综合

将Gram-Schmidt正交化方法应用到线性阵列天线方向图综合中.此方法对阵元结构和类型都没有要求,具哌有很强的通用性.针对实际设计中阵结构不同以及对波束图的要求多种多样,该方法在具体设计过程与计算步骤上有不小的差别.通过对普通Chebyshev加权阵和Dolph-Chebyshev阵为例的详细设计,证明了此方法的有效性和高效性.     

基于幅相线性约束的自适应和差波束形成方法研究

阵列雷达自适应和差波束单脉冲测角面临信号对消、训练样本有限、波束保形及零点约束困难等问题.针对上述问题,本文提出基于幅相线性约束的自适应和差波束形成方法.该方法通过增加对主瓣临近角度的幅相线性约束条件,有效的克服和波束信号对消的现象;通过引入相位约束条件,使得差波束的在主瓣方向逼近静态差波束,具有良好的稳健性.同时通过合理的设计幅相约束条件实现了单脉冲和差波束测角二维解耦合.仿真实验验证了本文方法的有效性.     

一种低旁瓣数字波束形成方法

线性约束最小方差准则(LCMV)在波束形成技术中得到了广泛的应用.但是,很多情况下,它会产生偏高旁瓣.本文基于多线性约束最小方差准则,提出了一种降低旁瓣的波束形成算法.该算法通过搜索技术寻找到已形成波束图的最高旁瓣点,建立对应方向矢量上的增益方程,将其添加到原来的LCMV准则约束条件中,然后利用多线性约束最小方差准则进行权值更新,实现旁瓣的降低.该算法不仅适用于均匀阵列,还适用于非均匀阵列,仿真结果表明了该算法的正确性和有效性.     

MIMO雷达双边约束自适应波束形成

提出基于虚拟阵列的MIMO雷达双边约束自适应波束形成算法.该算法将联合线性约束条件分解成两个线性约束条件的Kronecker积,分别计算接收和发射阵列的两组低维权值,并且从收、发阵列方向导向矢量间的映射关系出发,导出发射阵列权值的计算公式.与仅利用接收阵列的自适应波束形成算法相比,该算法在强干扰处的零值深度更深、角度分辨率更高;与联合约束自适应波束形成算法相比,计算的复杂度大大降低.仿真试验验证了算法的有效性.     

基于模式转换自适应零点形成的研究

利用模式空间变换算法将均匀圆阵转换为均匀线阵,在虚拟线阵的阵列流形中,比较了Gram-Schmidt正交化算法、自适应旁瓣对消和SMI算法这三种算法形成的方向图。G-S正交化算法可以在干扰方向准确地形成零点,但是没有很深的零陷深度;SMI算法的计算量比较大,因此在零点方向上有稍微的误差,但经过旁瓣对消的虚拟线阵的方向图有很深的零点深度。仿真结果表明,经过旁瓣对消的方向图主瓣增益损失较少,副瓣高度降低,主瓣比副瓣高大约10 dB~12 dB。     

给定方向图的圆形阵列综合方法

本文对基于给定方向图的圆形阵列方向图综合方法进行了系统的分析和研究.以给定方向图与被综合方向图之间的均方距离最小化为优化准则,在无约束、零点约束以及波束扫描约束的情况下,分别给出了相应最优激励向量的求解方法.各种仿真结果表明,这种方法对改善圆形阵列方向图的特性既简洁又有效.     

一种基于DFP-BFGS算法的阵列天线波束赋形方法

为优化得到给定形状的目标方向图,引入了一种基于DFP-BFGS无约束最优化算法的数值方法.优化过程是先对阵列各单元的激励幅度和相位同时优化,然后对得到的阵列激励幅度数据进行部分调整,使其更加均匀以便于馈电网络的设计.最后固定激励幅度分布,仅对相位数据进行优化.在实现对方向图主瓣波束赋形的同时,得到了较为均匀的激励幅度分布.该优化方法具有应用灵活和结果可调控的优点,是一种实现阵列天线波束赋形的实用方法.     

一种新的快速零陷形成技术

分解大型阵列为关于阵列中心对称的两个子阵,对内子阵进行阵元位置微扰形成指定零陷。借助对微扰后方向图的泰勒展开进行线性化,以微扰后方向图形变最小化为目标,将指定方向控零的约束条件分实部、虚部分别约束微扰值,运用方向导数法快速求解出微扰值,实现了在指定方位快速控零,并提出引入小值控制零陷深度。方法不改变阵列孔径,在指定方向控零后能维持原主波束形状、副瓣水平不变,仿真表明本方法的有效性和优越性。     

发射波束部分阵元置零综合分析

针对选择阵列部分单元控制的情况,分析了发射波束零点形成的两种方式,即部分阵元的幅相加权综合和部分阵元的唯相位综合加权方式。通过对这两种置零综合的算法研究和仿真分析,并从形成零陷的深度及对副瓣扰动等方面,比较了这两种发射波束置零综合方法的性能。     

天线阵辐射图零点控制理论导论

天线阵辐射图型强制零点控制,由于对定向干扰抑制的有效性,已成为天线阵辐射图型综合理论中心课题之一。本文围绕着这个课题,对三维天线阵辐射圈的零点控制进行了研究,它包括:用矢量空间方法,分析了多重零点控制的基本关系;根据零点本身的扩展性,引入了零域的概念,提出了多重强制零域的生成方法;导出了多重零点控制辐射图型的分解公式;揭示了由主波束和多个零点强制波束合成多重强制零点辐射图型的基本规律;给出了数值结果并进行了讨论;把这一分解原理与自适应成零天线阵辐射图型进行了类比。     

Spatial blocking filter derivative constraints for the generalizedsidelobe canceller and MUSIC

The paper presents a new approach to spatial derivative constraints for the generalized sidelobe canceller (GSC). Spatial derivative constraints have been applied to linearly constrained minimum variance beamformers to reduce the sensitivity to steering error. Earlier approaches to this problem constrained derivatives of the beamformer power and phase response, leading to beamformer performance that depended on the coordinate reference location of the array. Current approaches constrain only the beamformer power response, eliminating the problem with phase dependence. However, nonlinear minimization is required in order to solve for the linear constraint equations. An alternative approach for the GSC, which is presented in the paper, is to use derivative constraints to flatten the null of the spatial blocking filter power response. Thus, for a small steering error, the desired signal is still blocked from the noise cancelling filter, and the GSC output is unaffected by the steering error. These derivative constraints can be used with wideband array calibration, leading to effective performance in the presence of array errors. This same approach to derivative constraints can be used in other applications involving spatial blocking filters, such as the constrained MUSIC direction finding algorithm to give robustness against direction error of the known signal subspace     

Synthesis of antenna patterns with prescribed nulls

The least mean square pattern synthesis method is extended to include constraints such as pattern nulls or pattern-derivative nulls at a given set of angles. The problem is formulated as a constrained approximation problem which is solved exactly, and a clear geometrical interpretation of the solution in a multidimensional vector space is given. The relation of the present method to those of constrained gain maximization and signal-to-noise ratio (SNR) maximization is discussed and conditions for their equivalence stated. For a linear uniformN-element array it is shown that, whenMsingle nulls are imposed on a given "quiescent" pattern, the optimum solution for the constrained pattern is the initial pattern and a set ofM-weighted(sin Nx)/sin x-beams. Each beam is centered exactly at the corresponding pattern null, irrespective of its relative location. For the case of higher order nulls, thenth pattern derivative is similarly canceled by thenth derivative of a(sin Nx)/sin x-beam. In addition, simple quantitative expressions are derived for the pattern change and gain cost associated with the forced pattern nulls. Several illustrative examples are included.     

一种基于遗传算法的唯相位宽零陷波束赋形方法

传统阵列方向图宽零陷形成技术需要对阵元施加复加权或者阵元位置扰动等复杂操作,实际实现比较困难。提出了一种基于遗传算法的唯相位波束赋形方法,针对宽零陷特点,结合均匀线阵方向图数学模型,设计一种适应度函数,优化阵元相位扰动值,最终获得符合要求的宽零陷阵列方向图。仿真结果表明,该方法可以在唯相位条件下形成较深的宽零陷,且零陷较平坦,收敛速度较快,稳健性较好。     

On the quantized excitation and the geometry synthesis of a lineararray by the orthogonal method

A method for the geometry synthesis of a linear array is presented. We start from an initial array with quantized amplitudes. After this, we perturb the element positions by combining an iterative technique with the orthogonal method. The final position of the elements is found from the last iteration where the desired approximation of the pattern is obtained. Arrays with more constraints on the pattern need more quantized amplitudes. Several examples for different cases show the applicability of our method     

Minimum p-error design of nonuniformly spaced linear array

A design method which minimizes the p-error of a weighted array pattern for nonuniform linear array is studied. The Fletcher-Powell method is used to find the minimum set of sensor locations. With uniform weight and large p, the result has sidelobes of almost equal level. In addition, an array pattern with null(s) at some specified value can be designed with proper choices of weights.     

On the constrained synthesis of array patterns with applications to circular and arc arrays

Synthesis of array patterns involving optimization with linear and nonlinear constraints is considered. The general solution for the composite weight vector can be decomposed into a part which satisfies the linear constraints and another lying orthogonal to it. This decomposition is shown to yield simple solutions to several beam optimization problems including some with nonlinear constraints. A geometrical derivation of this result is presented which also provides new insights into the mechanism of null-steering via linear constraints. Application of this approach in conjunction with some search algorithms to the synthesis of optimum array patterns with prescribed narrow or broad nulls is shown to yield interesting and useful solutions. The results are illustrated by considering the design of "circular" and "arc" arrays.     

Orthogonal Advanced Methods for Antennas: the ORAMA computer tool

A computer tool (ORAMA) for the synthesis of linear antenna arrays is presented. The orthogonal method (OM) and the orthogonal perturbation (OP) method are used. The orthogonal method derives the excitation of the elements of the array, while the orthogonal perturbation method quantizes the excitation and determines the position of the elements. The user has the options to select the array geometry, the case study for a specific desired pattern, the method to be used, and the element type. Several design cases with various constraints are presented. ORAMA (a demo of the software is available at http://rcl.physics.auth.gr) has been designed as a Windows MDI application for the academic classroom, as well as for professional antenna engineers. A set of examples for different array patterns shows the usefulness of the tool.     

一种超方向性阵列天线综合方法

以往的阵列综合方法不能在获得高的方向性系数的同时保证外部噪声占优,不能用于超方向性阵列综合 .本文提出了一种新的阵列综合方法,该方法适用于任意阵列形式,以最大化阵列方向性系数为目标,通过对阵列效率的约束保证了外部噪声占优的条件,并通过迭代控制了方向图的旁瓣,实现了阵列效率和旁瓣约束下的方向性系数最优化,很好地满足了超方向性阵列综合的要求 .对多种阵列的综合结果表明了这种方法的有效性和灵活性 .     

凸规化法实现多维稀疏阵的方向图综合

本文研究了利用凸规划方法综合稀疏随机阵方向图的问题,采用最大信号干扰加噪声比准则,利用附加的线性约束对旁瓣作进一步控制,将方向图设计问题分别转化为二次规划和二次锥规划形式,再用内点法求解。该方法应用于不同形式的稀疏阵列方向图综合,获得了良好的结果。     

The orthogonal method for the geometry synthesis of a linearantenna array

The orthogonal method for geometry synthesis of a linear antenna array is presented. We start from an initial array, and we perturb the element positions by using an iterative procedure and applying the orthogonal method. Applications for arrays with uniform excitation give patterns with the desired sidelobe level