电子学报2013，Vol.41Issue(5)：926-930,5.DOI:10.3969/j.issn.0372-2112.2013.05.015
一种多约束稀布线阵的天线综合方法
A Synthesis Technique for Linear Sparse Arrays with Multiple Constraints
摘要
Abstract
Considering a linear sparse array with the constraints of the array aperture,the minimum and the maximum element spacing,an improved genetic algorithm(IGA) for the element position synthesis is proposed to reduce the peak sidelobe level (PSLL)of the array.In order to avoid the infeasible solution during the optimization,a special vector mapping between the element spaces and their gene coding is utilized by the IGA.Then the strong constrained optimization problem is transformed to an optimization problem with only upper and lower limit,and the infeasible solution is naturally avoided.The computational cost of the IGA can be far less than that of a recently reported modified real genetic algorithm.And the efficiency and the robustness of the IGA have been illustrated clearly from the simulations.关键词
稀布阵/遗传算法(GA)/旁瓣电平/优化布阵/约束优化问题/向量映射Key words
sparse arrays/genetic algorithm(GA)/sidelobe level/optimum arrays/constrained optimization problem/vector mapping分类
信息技术与安全科学引用本文复制引用
贾维敏,林志强,姚敏立,赵鹏,赵建勋..一种多约束稀布线阵的天线综合方法[J].电子学报,2013,41(5):926-930,5.基金项目
国家自然科学基金(No.61179004,No.61179005) （No.61179004,No.61179005）
