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

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

基于万有引力搜索算法的拖曳线列阵稀疏布阵方法

针对拖曳线列阵阵元个数多、布阵优化模型复杂以及计算量大等问题，提出了一种基于万有引力搜索算法的拖曳线列阵稀疏布阵模型。采用万有引力搜索算法优化拖曳线列阵阵元布置，并将优化后的非均匀稀疏布阵方式与其他几种不同的布阵方式分析比较。非均匀稀疏拖曳线列阵能以较少的阵元数目达到与其他几种布阵相似甚至更好的指向性，并有效解决均匀稀疏拖曳线列阵的栅瓣问题。利用基于万有引力搜索算法的拖曳线列阵稀疏布阵方法能够保证探测能力，降低拖曳线列阵成阵难度，减少成本。     

基于自调整映射法则的矩形稀布阵列优化方法北大核心CSCD

针对多约束条件下的矩形稀布阵列优化问题,提出了一种基于自调整映射法则的矩形稀布阵列优化方法。该方法首先提出一种新的最优化问题用于确定阵元坐标矩阵维数以平衡放置阵元数的自由度和阵列孔径可调整空间,并引入用于稀疏阵元的阵元状态矩阵;其次,构建自调整映射法则,对矩形阵列不同方向进行相应的映射,并对阵列短轴方向进行自调整,使得阵元位置满足最小阵元间距,避免出现不可行解;然后,通过粒子群优化算法优化阵元位置得到最优阵元坐标;最后,考虑适应度函数为单波束指向和多波束指向,对算法进行仿真验证。仿真结果发现该算法可以满足多约束条件并有效降低阵列的峰值旁瓣电平,从而提高矩形稀布阵列的性能。     

大孔径超稀疏阵列综合算法研究与应用

超稀疏阵列大孔径场景下最优布阵求解问题是在满足特定副瓣电平要求下,通过对布阵位置和阵元权值的优化获得最稀疏解。该问题属于NP-HARD问题,求解时存在搜索空间大、搜索时间长以及难以求得全局最优解等问题。为了解决上述问题,本文基于交替寻优的思想提出了一种针对大孔径场景下超稀疏阵列方向图综合的快速算法。该算法通过对求解空间进行划分后交替优化快速得出一个初始解,在初始解基础上构建相邻域形成新的求解空间,通过二次搜索寻优得到最优解。本算法通过对初始解空间进行划分和相邻域的构建,可大幅缩短每次优化的时间。本文通过对超稀疏线阵若干场景进行了仿真验证,仿真结果证明了该算法的有效性。     

平面稀布天线阵列的优化算法

基于一种改进的实数遗传算法,以降低平面稀布阵旁瓣电平为优化目标,提出了一种综合有阵元数约束、孔径约束和最小阵元间距约束的稀布面阵的新方法。与稀疏布阵相比,该方法利用了阵元在布阵时更大的自由度,因而在阵元数、孔径和最小阵元间距相同的条件下可以获得更优的峰值旁瓣性能,仿真试验显示了改进的实数遗传算法应用到该多约束稀布平面阵优化问题中是稳健和高效的。     

基于分区迭代傅里叶算法的稀疏阵列天线设计优化

针对迭代傅里叶算法（IFT）在对稀疏阵列天线优化时,阵元不分区域地大规模截断带来的不利影响,介绍了一种分区IFT算法。根据满阵幅度锥削分布计算每个分区域需要的激励阵元数,在算法的截断过程中,对每个分区中按照所需的阵元数对激励幅度较大的阵元进行截断,从而使阵元的密度分布更加接近于满阵的幅度分布,更容易获得相对较低的副瓣电平。将其应用于圆形孔径平面稀疏阵列天线的优化布阵,以抑制阵列天线的峰值副瓣电平为目的,仿真试验表明分区IFT算法可以得到比标准IFT算法更优的结果。     

基于蚁狮算法的MIMO雷达阵列方向图优化设计

针对MIMO雷达稀疏布阵的问题,提出了一种基于蚁狮算法的MIMO雷达阵列方向图优化设计方法.首先,设定发射与接收阵元的阵列孔径以及最小间距,然后用蚁狮算法对阵元位置进行稀疏优化,计算适应度函数并与全局最优解对比,保存最优值,使峰值旁瓣电平最小,最后以有效阵元数和峰值旁瓣为多目标优化函数,通过归一化处理将其转化为单目标优化.仿真结果表明,所提算法相比现有算法对旁瓣的优化效果更好且不易陷入早熟现象,也可以较好地实现多目标联合优化,提高雷达的工作性能和自由度.     

基于遗传算法和模拟退火的不等间距稀布阵的设计

副瓣电平在天线阵列的设计中是很重要的指标,已经有很多方法进行这方面的改进。该文在稀布阵概念的基础上,引入了距离微扰,提出不等间距稀布阵的模型,来进一步改善天线阵的副瓣电平,并且利用遗传算法和模拟退火对这种不等间距稀布阵进行了综合设计。给出了200元线阵和4020面阵的优化结果,从仿真结果可以看到天线副瓣电平得到了改善。     

稀布圆阵的降维优化方法

针对有阵列孔径,阵元数目和最小阵元间距3种约束下的稀布圆形阵列综合问题,该文提出了一种基于修正遗传算法的降维优化方法。为了充分利用阵元布阵的自由度,同时使稀布阵列满足多个设计约束,在阵元排布时将2维平面阵列优化设计降维成1维的稀布直线阵列,计算阵列性能时再还原为平面阵列。该方法改进了现有圆阵综合方法中轨迹圆半径和轨迹圆上阵元数分布优化的不足,实现了全部阵元的联合优化,降低了算法的复杂性,同时保证了阵列的旁瓣性能,仿真结果证明了该方法的有效性。     

圆形口径平面天线阵列的多约束稀布优化方法

针对圆形口径平面稀布阵列的多约束优化设计问题,以均匀同心圆环阵列的阵元位置分布特性为基础,构造了稀布圆阵的满足多个优化约束的可行初始解.提出了一种个体元素的间接表示法,设计了一种新的交叉算子和变异算子,运用改进的实数遗传算法优化设计天线阵的阵元位置.优化约束包括阵元数约束、口径约束和最小阵元间距约束,优化目标是使阵列响应的峰值旁瓣电平最小.运用这种改进实数遗传算法可以充分利用阵元布阵的自由度,同时能减小搜索空间,提高计算效率.仿真试验证实了算法的稳健性和有效性.     

New Model for Synthesis of Symmetrical Thinned Linear Arrays

In symmetrical thinned linear arrays design, the positions of thinned array elements are very important for optimal performance in terms of its minimum peak side lobe level (Msll). For the synthesis of thinned arrays with a given thinning rate, it would have almost the same Msll solution between taking only segmental aperture nearby both ends of the aperture into account and taking all the aperture into account. In this paper, the element distribution characteristic over the aperture of many optimum thinned arrays is studied, then the aperture release model is founded by the least square method to synthesize the thinned arrays. This model is vital for the computing burden alleviation and the efficiency optimization, and would hardly bring any degradation of the obtained array performance.     

New Model for Synthesis of Symmetrical Thinned Linear Arrays

In symmetrical thinned linear arrays design, the positions of thinned array elements are very important for optimal performance in terms of its minimum peak side lobe level （Msli）. For the synthesis of thinned arrays with a given thinning rate, it would have almost the same Msll solution between taking only segmental aperture nearby both ends of the aperture into account and taking all the aperture into account. In this paper, the element distribution characteristic over the aperture of many optimum thinned arrays is studied, then the aperture release model is founded by the least square method to synthesize the thinned arrays. This model is vital for the computing burden alleviation and the efficiency optimization, and would hardly bring any degradation of the obtained array performance.     

最佳稀疏直线阵列的分区穷举综合法

综合稀疏直线阵列(单元从规则栅格中稀疏)时,为了增强穷举法的有效性,该文提出了结合分区预处理的穷举综合法,并与其他的优化布阵方法进行了分析和比较,仿真结果表明:分区穷举法具有相当的实效性和优越性。     

多约束稀布矩形平面阵列天线的方向图综合

针对多约束稀布矩形阵列天线的优化设计问题,该文提出一种新的矩阵映射(NMM)方法。首先,综合考虑阵元的可分布范围与可分布数量,重新定义阵元坐标矩阵的维数以提高阵元分布的自由度。其次,当坐标矩阵定义的阵元数量大于实际阵元数量时,建立选择矩阵以确定各阵元的取舍。再次,针对现有矩阵映射方法无法完全避免不可行解的问题,构建了一种NMM方法,通过两种不同的矩阵映射函数将多约束优化问题转换为无约束优化问题。最后进行仿真对比实验,实验结果证明了算法的有效性。     

Numerical annealing of low-redundancy linear arrays

An algorithm is developed that estimates the optimal distribution of antenna elements in a minimum redundancy linear array. These distributions are used in thinned array interferometric imagers to synthesize effective antenna apertures much larger than the physical aperture. The optimal selection of antenna locations is extremely time consuming when large numbers of antennas are involved. This algorithm uses a numerical implementation of the annealing process to guide a random search for the optimal array configuration. Highly thinned low-redundancy arrays are computed for up to 30 array elements. These arrays are equivalent to the optimal solutions that are known for up to 11 elements. The arrays computed for 12-30 elements have the fewest redundancies reported to date     

基于阿基米德螺线的稀布面阵综合方法

提出一种基于改进遗传算法的稀布面阵综合的新方法。该方法通过对阿基米德螺线参数的合理设置,确保了阵元在沿阿基米德螺线的轨迹分布时依然能够满足阵元数约束、孔径约束和最小阵元间距约束,从而将稀布面阵的优化问题转化为非对称线性阵列的稀布问题,这就大大降低了问题的复杂程度。仿真实验结果证明了该方法的有效性。     

Thinning of 2D and 3D Fractal Antenna Arrays with Bounded and Unbounded Fractal Distribution Functions for Celestial Communications

Fractal antenna arrays are geometry‐based thinned arrays having multiband applications. The major challenge of these arrays is their large number of elements at higher expansion factors. This article presents the thinning of fractal antenna arrays while maintaining an appropriate balance between the side lobe level and beam width by using various quantized fractal distribution functions. A 2D square fractal antenna array and 3DSierpinski gasket antenna array are considered in this article to validate the proposed distribution functions. Nearly one third of the antenna elements are thinned in each successive iteration except in the case of a one‐count distribution function. The proposed technique can simplify practical implementation and exhibits better performance for various parameters such as the side lobe level, side lobe angle, and half power beam width than fully populated fractal antenna arrays.