基于迭代FFT算法的平面稀疏阵列优化方法  

An Optimum Method for Thinned Planar Array Based on Iterative FFT Algorithm

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

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

出　　处：《电讯技术》2011年第11期99-102,共4页Telecommunication Engineering

基　　金：国家自然科学基金资助项目(60702070)~~

摘　　要：提出了一种基于迭代FFT算法的优化方法来实现平面稀疏阵列的峰值旁瓣电平优化,并给出了详细的优化步骤。在给定的旁瓣约束条件下,利用阵列因子与阵元激励之间存在的傅里叶变换关系,对不同的初始随机阵元激励分别进行迭代循环,就可以降低稀疏阵列的旁瓣电平。在迭代过程中,根据稀疏率将阵元激励按幅度大小置1置0来完成阵列稀疏。仿真实验证明了该方法的高效性和稳健性。A method based on iterative FIT algorithm is presented for thinned planar array featuring an optimal peak side-lobe level and the detailed steps of the method are provided. The side-lobe level can be reduced when each iteration loop meeting the given peak side-lobe requirement starts with a different random initialization of element excitations by using the Fourier transform relationship between the array factor and the element excitations. Army thinning is accomplished by setting the amplitudes of the largest element excitations to unity and the others to zero during each iteration cycle. The simulated results confirm the great efficiency and the robustness of the new method.

关 键 词：阵列天线 平面阵列 快速傅里叶变换 旁瓣约束 

分 类 号：TN820.1[电子电信—信息与通信工程]