一种有阵元间距约束的稀布阵天线综合方法

提出了一种基于改进遗传算法的稀布阵综合新方法,用于优化设计有最小阵元间距约束的稀布线阵.该方法利用个体的实值编码提高了遗传算法的优化效率,通过设计遗传操作预处理和后处理,并采用一种广义的交叉算子和变异算子,有效地避免了基因重组和变异时出现不可行解.在给定阵列孔径和阵元数的条件下,高效地实现了任意最小阵元间距约束下抑制稀布线阵峰值旁瓣电平的稀布直线阵列综合.给出了应用该方法的具体步骤,并通过仿真实验证实了该方法的有效性和稳健性.

A synthesis technique for linear sparse arrays with optimization constraint of minimum element spacing

For element location synthesis of linear sparse arrays with the design constraint of minimum element spacing,an improved genetic algorithm(IGA)is presented in this paper.It effectively improves the GA's performance by real valued coding of chromosome.The genetic preparative and post-treatment operation are designed to pick-up and reconstruct genetic information of the GA population,respectively.And the broad sense crossover and mutation operator of IGA are applied to avoid infeasible solution in filial generation population.When the aperture and number of element are fixed,the new method can run with the adjustable minimum element spacing and great efficiency so as to achieve lower peak sidelobe level(PSLL)of the sparse array.The simulated results confirm the great efficiency and the robustness of IGA.