摘要
对于给定阵列口径和单元数并有最小单元间距约束的稀布直线阵,仅需对阵列边缘部分的单元进行优化排布就可以达到优化整个直线阵的目的.通过运用统计的方法得出了稀布阵免于排布的单元数目的计算公式,减小了优化算法的计算量;并通过加入间距约束向量改进了粒子群优化算法,不仅减小了布阵空间,而且消除了优化操作过程中的不合格个体,进一步降低了优化算法的计算量.在最小间距约束为0.5λ、阵列均匀排布、单元间距在0.8λ以下时,改进后的优化算法的计算量至少降至原来的28%.
For the synthesis of sparse linear arrays with the design constraints of the number of elements,the array aperture and the minimum element spacing,only taking some elements around both the ends of the aperture into account will have the same effect on the peak side lobe level as taking all the elements into account.Using the statistical method,this paper presents the formula for calculating the number of elements which does not need to be considered in the optimization process,by which the computational cost of the optimization algorithm is considerably reduced.In addition,inserting the element spacing constraint vector,the modified optimization algorithm not only reduces the size of the searching area of the solution,but also avoids the infeasible solution during the optimization process.Thus,the computational cost is further reduced.Using the proposed method,when the minimum element spacing is half-wavelength and the element spacing of equally spaced array is less than 0.8-wavelength,the computing burden of the modified optimization algorithm is reduced to at least 28% of the original one.
出处
《西安电子科技大学学报》
EI
CAS
CSCD
北大核心
2010年第5期888-892,910,共6页
Journal of Xidian University
基金
中央高校基本科研业务费资助项目(JY10000902009)
国家自然科学基金资助项目(60801042)
关键词
阵列天线
稀布阵
粒子群算法
array antenna
sparse arrays
particle swarm optimization
