电子科技大学电子工程学院,四川,成都,610054
纸质出版:2006
移动端阅览
陈客松, 何子述, 韩春林. 非均匀线天线阵优化布阵研究[J]. 电子学报, 2006,34(12):2263-2267.
CHEN Ke-song, HE Zi-shu, HAN Chun-lin. Research on Synthesis of the Linear Sparse Arrays[J]. Acta Electronica Sinica, 2006, 34(12): 2263-2267.
针对有阵元数、孔径和最小阵元间距约束的稀布直线阵列综合问题
提出了一种基于修正遗传算法(MGA)的综合方法.该方法采用真值编码
个体的描述方式可使搜索空间减小
通过设计用于处理约束的矩阵变换和广义的交叉算子和变异算子
有效地避免了基因重组和变异时出现不可行解.在约束阵列孔径和阵元数的条件下
高效地实现了任意最小阵元间距约束下抑制峰值旁瓣电平(PSLL)的稀布阵综合.文中给出了修正遗传算法的流程
该算法的有效性和鲁棒性在稀布阵列综合的仿真实验中得到了验证.
A modified genetic algorithm (MGA) for the element spacing synthesis of linear sparse array is described.Under the optimization constraints of the number of element
the aperture and the minimum element spacing
the MGA has been utilized to reduce the peak sidelobe level (PSLL) of the array.It improves the optimization efficiency of GA by the application of real valued coding of chromosome
the manner of individual description allows the GA to search a smaller solution space.For the sake of avoiding infeasible solution during the process of recombination and mutation
constraint matrix and its transforms are designed
and the broad sense crossover operator and mutation operator of GA are applied.When the aperture and the number of elements are a priori fixed
the synthesis of linear sparse arrays using this new method can run with the adjustable minimum element spacing.The flowchart of the MGA and the simulated results confirming the validity and the robustness of the algorithm are provided.
0
浏览量
1619
下载量
14
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621