基于改进交叉熵算法多目标不等间距阵列综合  

Multi-objective Unequally-Spaced Array Synthesis Based on Modified Cross Entropy Algorithm

作　　者：边莉[1] 车向前[1] 张少卿[1] 

机构地区：[1]黑龙江科技大学电子与信息工程学院,哈尔滨150022

出　　处：《上海交通大学学报》2014年第3期372-376,共5页Journal of Shanghai Jiaotong University

基　　金：黑龙江省青年科学基金(QC2010023);黑龙江省普通高等学校青年学术骨干支持计划(1251G055);黑龙江科技大学优秀青年才俊计划资助

摘　　要：将模糊C均值聚类算法与传统交叉算法相结合,提出改进交叉熵算法.利用该算法成功完成阵元个数分别为6、8、10、12不等间距阵列综合,解决了不等间距阵列综合中峰值旁瓣电平和波束宽度的多目标优化问题,得到了对应情况下不等间距阵列的峰值旁瓣电平和波束宽度的平衡曲线.优化结果表明,给定波束宽度,阵元个数相同的不等间距阵列的峰值旁瓣电平比均匀阵列下降近30%.在均匀阵列超出截止间距时,可以更加有效准确地找寻峰值旁瓣和波束宽度的折中点.The modified cross entropy algorithm and the program flow were proposed based on the combi nation of fuzzy C mean clustering algorithm and traditional cross entropy algorithm. This algorithm was successfully used in unequally-spaced arrays synthesis, whose number of array element are respectively 6, 8, 10, and 12, and solved the multi objective optimization problems of the peak sidelobe level and beam width in the field of unequally-spaced array synthesis. In the corresponding cases, the balance curves to peak sidelobe level and beam width of unequally-spaced arrays were proposed. Optimization shows that, given the beam width and the number of unequally spaced array elements, the peak sidelobe level of une qually-spaced array was decreased by nearly 30% compared with equally-spaced array. In the uniform array beyond the cutoff distance, the algorithm more efficiently and accurately found tradeoff to peak sidelobe and beamwidth.

关 键 词：阵列综合 不等间距阵列 改进交叉熵算法 

分 类 号：TN821[电子电信—信息与通信工程]