非对称直线稀疏阵列的迭代FFT优化方法  

Asymmetric linear arrays thinning using iterative FFT algorithm

作　　者：曾伟一[1] 梁颖[1] 黄伟[2] 陈客松[2] 

机构地区：[1]成都航空职业技术学院电子工程系,成都610100 [2]电子科技大学电子工程学院,成都610054

出　　处：《重庆邮电大学学报（自然科学版）》2012年第3期288-291,共4页Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)

基　　金：国家自然科学基金(60702070)~~

摘　　要：介绍了一种基于迭代快速傅里叶变换(fast Founier transform,FFT)算法的优化方法来实现非对称直线稀疏阵列的旁瓣性能优化,给出了详细的优化步骤。在给定的旁瓣约束条件下,根据稀疏阵列中阵列因子与阵元激励之间存在的傅里叶变换关系,对不同的初始随机阵元激励分别作迭代FFT循环,可以降低稀疏阵列的旁瓣电平。在迭代过程中,根据稀疏率将阵元激励按大小置1/0来完成阵列稀疏。仿真结果证明了该方法的高效性和稳健性。A method based on iterative fast Founier transform（FFT） algorithm for asymmetric linear thinned arrays featuring an optimal peak side-lobe level is presented and the detailed steps of the method are discussed.Starting with a different random initialization of element excitations and using the Fourier transform relationship exists between the array factor and the element excitations,the side-lobe level can be reduced when each iteration loop meets the given peak side-lobe requirement.Array thinning is accomplished by setting the amplitudes of the largest element excitations to unity and the others to zero during each iteration cycle.Finally,the simulated results confirming the great efficiency and the robustness of the new method are shown in this paper.

关 键 词：天线阵列 稀疏阵列 FFT 迭代循环 旁瓣约束 

分 类 号：TP820.15[自动化与计算机技术—检测技术与自动化装置]