共查询到17条相似文献,搜索用时 149 毫秒
1.
2.
针对拖曳线列阵阵元个数多、布阵优化模型复杂以及计算量大等问题,提出了一种基于万有引力搜索算法的拖曳线列阵稀疏布阵模型。采用万有引力搜索算法优化拖曳线列阵阵元布置,并将优化后的非均匀稀疏布阵方式与其他几种不同的布阵方式分析比较。非均匀稀疏拖曳线列阵能以较少的阵元数目达到与其他几种布阵相似甚至更好的指向性,并有效解决均匀稀疏拖曳线列阵的栅瓣问题。利用基于万有引力搜索算法的拖曳线列阵稀疏布阵方法能够保证探测能力,降低拖曳线列阵成阵难度,减少成本。 相似文献
3.
基于孔径空分复用的共享孔径交错稀疏布阵是实现机载多功能天线的有效途径。该文提出一种基于改进迭代FFT算法的均匀线阵交错稀疏布阵方法。基于均匀线阵天线激励与方向图的傅里叶变换关系,通过对目标方向图采样的频谱分析,采用交叉选取子阵激励的方法对子阵单元进行稀疏优化布阵,实现了子阵频谱能量的均匀分配,确保了交错稀疏子阵方向图的一致性。在此基础上采用迭代FFT算法对稀疏交错子阵进行联合优化。理论分析与仿真实验表明,相对于基于差集及遗传算法的稀疏交错优化方法,该算法通过较少次数的迭代,可以实现等稀疏率和方向图近似一致的交错稀疏布阵,而且可以获得更低的副瓣电平。 相似文献
4.
针对多约束条件下的矩形稀布阵列优化问题,提出了一种基于自调整映射法则的矩形稀布阵列优化方法。该方法首先提出一种新的最优化问题用于确定阵元坐标矩阵维数以平衡放置阵元数的自由度和阵列孔径可调整空间,并引入用于稀疏阵元的阵元状态矩阵;其次,构建自调整映射法则,对矩形阵列不同方向进行相应的映射,并对阵列短轴方向进行自调整,使得阵元位置满足最小阵元间距,避免出现不可行解;然后,通过粒子群优化算法优化阵元位置得到最优阵元坐标;最后,考虑适应度函数为单波束指向和多波束指向,对算法进行仿真验证。仿真结果发现该算法可以满足多约束条件并有效降低阵列的峰值旁瓣电平,从而提高矩形稀布阵列的性能。 相似文献
5.
针对MIMO雷达稀疏布阵的问题,提出了一种基于蚁狮算法的MIMO雷达阵列方向图优化设计方法.首先,设定发射与接收阵元的阵列孔径以及最小间距,然后用蚁狮算法对阵元位置进行稀疏优化,计算适应度函数并与全局最优解对比,保存最优值,使峰值旁瓣电平最小,最后以有效阵元数和峰值旁瓣为多目标优化函数,通过归一化处理将其转化为单目标优... 相似文献
6.
超稀疏阵列大孔径场景下最优布阵求解问题是在满足特定副瓣电平要求下,通过对布阵位置和阵元权值的优化获得最稀疏解。该问题属于NP-HARD问题,求解时存在搜索空间大、搜索时间长以及难以求得全局最优解等问题。为了解决上述问题,本文基于交替寻优的思想提出了一种针对大孔径场景下超稀疏阵列方向图综合的快速算法。该算法通过对求解空间进行划分后交替优化快速得出一个初始解,在初始解基础上构建相邻域形成新的求解空间,通过二次搜索寻优得到最优解。本算法通过对初始解空间进行划分和相邻域的构建,可大幅缩短每次优化的时间。本文通过对超稀疏线阵若干场景进行了仿真验证,仿真结果证明了该算法的有效性。 相似文献
7.
平面稀布天线阵列的优化算法 总被引:2,自引:0,他引:2
基于一种改进的实数遗传算法,以降低平面稀布阵旁瓣电平为优化目标,提出了一种综合有阵元数约束、孔径约束和最小阵元间距约束的稀布面阵的新方法。与稀疏布阵相比,该方法利用了阵元在布阵时更大的自由度,因而在阵元数、孔径和最小阵元间距相同的条件下可以获得更优的峰值旁瓣性能,仿真试验显示了改进的实数遗传算法应用到该多约束稀布平面阵优化问题中是稳健和高效的。 相似文献
8.
9.
10.
针对有阵列孔径,阵元数目和最小阵元间距3种约束下的稀布圆形阵列综合问题,该文提出了一种基于修正遗传算法的降维优化方法。为了充分利用阵元布阵的自由度,同时使稀布阵列满足多个设计约束,在阵元排布时将2维平面阵列优化设计降维成1维的稀布直线阵列,计算阵列性能时再还原为平面阵列。该方法改进了现有圆阵综合方法中轨迹圆半径和轨迹圆上阵元数分布优化的不足,实现了全部阵元的联合优化,降低了算法的复杂性,同时保证了阵列的旁瓣性能,仿真结果证明了该方法的有效性。 相似文献
11.
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. 相似文献
12.
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. 相似文献
13.
14.
15.
Numerical annealing of low-redundancy linear arrays 总被引:7,自引:0,他引:7
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 相似文献
16.
提出一种基于改进遗传算法的稀布面阵综合的新方法。该方法通过对阿基米德螺线参数的合理设置,确保了阵元在沿阿基米德螺线的轨迹分布时依然能够满足阵元数约束、孔径约束和最小阵元间距约束,从而将稀布面阵的优化问题转化为非对称线性阵列的稀布问题,这就大大降低了问题的复杂程度。仿真实验结果证明了该方法的有效性。 相似文献
17.
Thinning of 2D and 3D Fractal Antenna Arrays with Bounded and Unbounded Fractal Distribution Functions for Celestial Communications 下载免费PDF全文
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. 相似文献