基于差集与遗传算法的同心圆阵稀疏优化方法

同心圆阵天线具有结构简单、波束旋转对称、旁瓣电平低等特点,但是阵列阵元数较多,系统实现的代价大.文中提出了一种非均匀稀疏同心圆阵的设计方法.基于差集的阵列稀疏优化方法具有解析性,运算量小,旁瓣电平低等优点.首先利用循环差集方法获得阵列初始的稀疏优化结构,并进一步将差集产生的解集作为遗传算法的初始值,通过差集与遗传算法相结合进一步优化阵列结构.仿真结果表明:该方法在保持较大稀疏率的同时获得了较理想的旁瓣电平.     

基于迭代FFT算法的平面阵列交错稀疏布阵方法

交错稀疏阵列天线的设计需要实现“稀疏布阵”和“子阵交错机制”两个关键技术的有机“协同”.提出一种基于改进迭代快速傅里叶变换(Fast Fourier Transformation, FFT)算法的均匀面阵交错稀疏布阵机制.鉴于均匀矩形平面阵列天线激励与方向图存在二维傅里叶变换的关系, 该方法通过对均匀面阵方向图采样的频谱能量分析, 采用交错选取子阵激励的方法, 实现了面阵天线方向图频谱能量的均匀分配, 获得了近似相同方向图的交错子阵设计.在此基础上, 采用迭代FFT算法对交错子阵激励进行迭代循环, 有效降低了交错子阵的峰值旁瓣电平.理论分析与实验仿真证明, 相对于基于循环差集和互补差集的稀疏交错优化方法, 该算法实现的交错稀疏阵列设计具有方向图近似程度更高, 且峰值旁瓣电平更低的优点.     

共享孔径交错阵列综合优化方法

共享孔径稀疏交错布阵作为多功能综合传感器系统的关键技术基础,可以减少天线的数量,节省空间,降低载荷和制造成本。利用差集构造的共享孔径交错阵列,由于阵元的非均匀稀疏分布而导致存在较高的旁瓣电平,提出一种将差集理论和遗传算法相结合对阵列进行优化的方法。首先由差集确定交错阵列的阵元位置,再以激励幅度分布为决策变量,利用遗传算法同步降低各子阵的旁瓣电平,使得共享孔径交错阵列的整体性能得到提升。仿真结果表明,该方法有效抑制了阵列的旁瓣电平,是一种有效的交错阵列优化方法。     

基于迭代FFT算法的平面稀疏阵列优化方法

提出了一种基于迭代FFT算法的优化方法来实现平面稀疏阵列的峰值旁瓣电平优化,并给出了详细的优化步骤.在给定的旁瓣约束条件下,利用阵列因子与阵元激励之间存在的傅里叶变换关系,对不同的初始随机阵元激励分别进行迭代循环,就可以降低稀疏阵列的旁瓣电平.在迭代过程中,根据稀疏率将阵元激励按幅度大小置1置0来完成阵列稀疏.仿真实验...     

一种基于迭代FFT算法的直线稀疏阵列优化方法

介绍了一种基于迭代快速傅里叶变换(FFT)算法的优化方法来实现直线稀疏阵列的峰值旁瓣电平最优化,分析并给出了该方法的详细优化步骤.利用阵列因子与阵元激励之间存在的傅里叶变换关系,对不同的初始随机阵元激励分别作迭代循环,便可以得到最优的阵元分布.在迭代过程中,根据稀疏率将阵元激励按幅度大小置1置0来完成阵列稀疏.通过对仿真结果进行分析,证明了该方法的快速性、有效性和稳健性.     

相控参量阵波束合成设计

针对矩形和圆环形换能器阵列,完成了宽带参量阵信号的波束合成仿真与结果比较分析.仿真结果表明,同等阵元个数N=9、相似阵列边界半径rm=49 mm条件下,矩形阵列差频波波束主瓣-3 dB指向角约为6.3°(圆环阵列约为7.4°),旁瓣几乎被完全抑制(圆环阵列约为主瓣峰值的10％),矩形阵列更利于提高主瓣指向性和抑制旁瓣幅度.针对矩形阵列,该文仿真分析了采用阵元信号延时方法实现参量阵信号波束偏转时的各波束特征,仿真结果显示,偏转后波束存在主瓣峰值点幅值削弱、主瓣峰值点未对准预定方向、主瓣宽度增大等问题.分析表明,以上问题可通过增加阵元数目及增大阵列尺寸进行修正.     

大型阵列天线子阵划分及栅瓣抑制方法

利用遗传算法(genetic algorithm, GA)将大型阵列划分为非均匀邻接子阵,以主旁瓣比作为适应度函数,并对遗传操作增加约束条件,得到具有栅瓣抑制能力的子阵结构。提出了基于子阵级的波束扫描方法,在每个扫描分区内无需改变阵元权值,仅通过子阵级数字波束形成即可完成阵列的波束扫描,并分析了不同扫描角对阵列方向图的影响。为了抑制大扫描角带来的高旁瓣,运用自适应原理使子阵级方向图在高旁瓣位置形成凹陷。分析与仿真结果表明,该方法能够进一步提高阵列方向图的主旁瓣比,增加扫描分区的范围。      

平面稀疏阵列天线的约束优化设计

针对有阵元数和阵列口径约束的矩形平面稀疏阵天线的综合问题,提出了一种基于整数编码的差分进化算法。该方法以每个阵元的栅格位置编号作为设计变量,使阵列的稀疏率满足约束条件,避免了优化过程中的不可行解,还减少了优化变量的个数。为了加速优化过程,采用快速傅里叶变化计算阵列的方向图。以改善阵列峰值副瓣电平为目的进行仿真试验,结果表明：优化后的稀疏天线阵峰值旁瓣电平比现有方法相比改善了1.2~1.7 dB,且具有收敛性和稳定性好的优点。     

平面阵子阵级自适应波束形成方法研究

利用遗传算法(GA)将大型阵列划分为非均匀邻接子阵,以主旁瓣比作为适应度函数,并对遗传操作增加约束条件,得到具有栅瓣抑制能力的子阵结构。为进一步抑制平面阵俯仰和方位上的高旁瓣,对平面阵进行两级子阵划分,使平面阵方向图在俯仰和方位上均具有良好的主旁瓣电平比;为消除非均匀子阵结构各子阵通道噪声功率不同对子阵级自适应波束形成算法的影响,通过对阵列协方差矩阵进行奇异值分解、重构特征子空间,提出了基于特征空间重构的子阵级自适应波束形成方法。仿真结果表明了该方法的可行性与有效性。     

利用GA实现非对称稀疏线阵旁瓣电平的优化

该文讨论运用遗传算法综合非对称的稀疏直线阵列(阵元从规则栅格中稀疏)。阵元在中心两侧非对称分布的布阵方式提供了可利用的优化自由度,将更有利于提高稀疏阵列的性能。构造了阵元关于阵中心非对称时优化旁瓣电平的适应度函数,仿真结果表明,无对称约束的阵元排列,不仅可以进一步抑制稀疏线阵的相对旁瓣电平(RSLL),而且当阵列由有向阵元组成时,有益于改善阵列波束扫描过程中RSLL的恶化。     

基于改进麻雀搜索算法的稀布线阵综合方法

针对阵列天线中阵列孔径、阵元数目、阵元间距等多约束的稀布线阵综合问题,文中提出了一种基于改 进麻雀搜索算法的稀布阵列综合优化方法。给出了改进麻雀搜索算法的流程,并在确定阵列孔径、阵元数目和最小阵 元间距的约束条件下,采用Tent 混沌映射进行天线阵元位置的初始化,提高算法的搜索性和收敛性,实现了抑制天线 峰值旁瓣电平(PSLL)的稀布线阵综合仿真。仿真结果表明,所提出的方法相比于其它文献中的优化方法,能够得到更 低的峰值旁瓣电平,稳健性好,效率高。在仿真结果的基础上,引入实际天线进行组阵分析,验证了该方法的可行性。     

多分辨率复合数字阵列天线的设计与实验

稀布阵列天线具有简化阵列结构、降低系统成本的优点,基于数字波束形成的稀布阵列天线技术获得了广泛地关注。基于作者所提出的多分辨率复合阵列天线技术(MRCA),该文设计了一个多分辨率复合数字阵列天线,并应用该阵列天线来进行单目标和双目标检测实验。仿真和实验结果均表明:与传统的均匀直线阵列天线相比,在相同的阵列天线单元数目的情况下,多分辨率复合数字阵列天线可以得到更窄的主波瓣和更低的副瓣,增强了阵列天线系统的方向性,提高了角度分辨率。      

基于粒子群算法的非均匀稀布阵列综合

给出了一种基于粒子群算法的非均匀稀布阵列综合方法,设计有最小阵元间距约束的稀布阵,通过加入间距约束向量改进了适应度算法,不仅减小了布阵空间,而且消除了优化过程中的不合格个体。在给定阵列孔径和阵元数的条件下,实现了最小阵元间距约束下抑制栅瓣,降低旁瓣电平的阵列综合。通过仿真实例,验证了此方法的高效可行性。     

基于和声搜索的稀布线阵旁瓣电平优化*

采用和声搜索算法研究了带约束条件的稀布线阵峰值旁瓣优化问题.探讨了稀布阵综合中的天线口径、阵元数目以及峰值旁瓣的关系,并拟合了三者的数学模型.仿真结果表明,与现有优化算法相比,改进的和声搜索算法具有更快的收敛速度;在峰值旁瓣优化中,不同阵元数目可获得最佳的天线口径;而在固定天线口径条件下,少量的阵元可获得更佳的峰值旁瓣.天线口径、阵元数目以及峰值旁瓣的相互关系可为稀布线阵的优化设计提供参考和借鉴.     

Isophoric arrays-massively thinned phased arrays withwell-controlled sidelobes

Traditional filled phased arrays have an element placed in every location of a uniform lattice with half-wavelength spacing between the lattice points. Massively thinned arrays have fewer than half the elements of their filled counterparts. Such drastic thinning is normally accompanied by loss of sidelobe control. This paper describes a class of massively thinned linear and planar arrays that show well-behaved sidelobes in spite of the thinning. The term isophoric is derived from Greek roots to denote uniform weight. In isophoric arrays, element placement based on difference sets forces uniformly weighted spatial coverage. This constraint forces the array power pattern to pass through V uniformly spaced, equal, and constant values that are less than 1/K times the main beam peak, where V is the aperture size in half-wavelengths and K is the number of elements in the array. The net result is reduced peak sidelobes, especially when compared to cut-and-try random-placement approaches. An isophoric array will exhibit this sidelobe control even when the array has been thinned to the extent that K is approximately the square root of V. Where more than one beam must be generated at a time, isophoric array designs may be used to advantage even within a traditional filled array. By “interweaving” two isophoric subarrays within a filled array and by appropriate cyclic shifting of the element assignments over time, two independent antenna power patterns can be generated, each with a sidelobe region that is approximately a constant value of 1/(2K) relative to the main beam, where K is the number of elements in the subarray     

Position-modulated phased array-space factor considerations

The space factor of an element position-modulated array is expressed as an Anger function series for a general amplitude distribution. The behavior of the main lobe and the diffraction sidelobes for uniform excitation are presented in the form of universal curves. It is found that the nulls near the main lobe disappear for the modulation index above a critical value. The peak level of the grating plateaus and their shapes are given in terms of approximate expressions and are exactly determined computationally. The nature of the curves suitable for design of such arrays for a given scan range and permissible peak sidelobe level is given. An example shows that a high resolution beam may be obtained with a comparatively smaller number of elements than required by a uniformly illuminated periodic array. An exact-series summation formula for the directivity of nonuniformly spaced antenna arrays of isotropic elements is given. The directivity of the modulated array computed by this formula shows a smooth variation at the ends of the scan range in contrast to the sudden fall in the case of the periodic array.     

Resolving manifold ambiguities in direction-of-arrival estimationfor nonuniform linear antenna arrays

This paper addresses the problem of ambiguities in direction of arrival (DOA) estimation for nonuniform (sparse) linear arrays. Usually, DOA estimation ambiguities are associated with linear dependence among the points on the antenna array manifold, that is, the steering vectors degenerate so that each may be expressed as a linear combination of the others. Most nonuniform array geometries, including the so-called “minimum redundancy” arrays, admit such manifold ambiguities. While the standard subspace algorithms such as MUSIC fail to provide unambiguous DOA estimates under these conditions, we demonstrate that this failure does not necessarily imply that consistent and asymptotically effective DOA estimates do not exist. We demonstrate that in most cases involving uncorrelated Gaussian sources, manifold ambiguity does not necessarily imply nonidentifiability; most importantly, we introduce algorithms designed to resolve manifold ambiguity. We also show that for situations where the number of sources exceeds the number of array sensors, a new class of locally nonidentifiable scenario exists     

Synthesis of random antenna array patterns with prescribed nulls

Under study is a method devised to reduce sidelobes of thinned random antenna arrays over specified angular sectors. The thinned array is assumed random in the sense that the nominal location of the elements is known, but their actual position may vary randomly. It is shown that by imposing adequately dense pattern nulls, it is possible to reduce the sidelobes effectively in the region of the nulls. The problem is formulated as a set of points in the radiation pattern, which are constrained to specified values. The unknowns are the excitations, or weights, applied to the array elements. In the general case, the linear system of equations is consistent and has an infinite number of solutions. The solution selected optimizes the pattern in a minimum variance sense. Quantitative relations are derived for the pattern change and the gain cost associated with the imposed pattern nulls. Several examples are included to illustrate the results.     

A simple algorithm to achieve desired patterns for arbitrary arrays

A simple iterative algorithm which can be used to find array weights that produce array patterns with a given look direction and an arbitrary sidelobe specification is presented. The method can be applied to nonuniform array geometries in which the individual elements have arbitrary (and differing) radiation patterns. The method is iterative and uses sequential updating to ensure that peak sidelobe levels in the array meet the specification. Computation of each successive pattern is based on the solution of a linearly constrained least-squares problem. The constraints ensure that the magnitude of the sidelobes at the locations of the previous peaks takes on the prespecified values. Phase values for the sidelobes do not change during this process, and problems associated with choosing a specific phase value are therefore avoided. Experimental evidence suggests that the procedure terminates in remarkably few iterations, even for arrays with significant numbers of elements