首页 | 官方网站   微博 | 高级检索  
     

运用迭代FFT算法优化平面稀疏阵列
引用本文:张飞,黄伟,陈客松. 运用迭代FFT算法优化平面稀疏阵列[J]. 全球定位系统, 2012, 37(2): 38-42
作者姓名:张飞  黄伟  陈客松
作者单位:电子科技大学电子工程学院,四川成都,610054
摘    要:介绍了一种基于迭代FFT算法的优化方法来实现平面稀疏阵列的峰值旁瓣电平优化,给出了详细的优化步骤。在给定的旁瓣约束条件下,利用阵列因子与阵元激励之间存在的傅里叶变换关系,对不同的初始随机阵元激励分别进行迭代循环,可以降低稀疏阵列的旁瓣电平。在迭代过程中,根据稀疏率将阵元激励按幅度大小置1、置0来完成阵列稀疏。仿真实验证明了该方法的高效性和稳健性。

关 键 词:阵列天线  平面阵列  FFT  迭代  旁瓣约束

An Optimum Method of Thinned Planar Array based on Iterative FFT Algorithm
ZHANG Fei,HUANG Wei,CHEN Ke-song. An Optimum Method of Thinned Planar Array based on Iterative FFT Algorithm[J]. Gnss World of China, 2012, 37(2): 38-42
Authors:ZHANG Fei  HUANG Wei  CHEN Ke-song
Affiliation:(School of Electronic Engineering,UESTC,Chengdu Sichuan 610054,China)
Abstract:A method based on iterative FFT algorithm featuring an optimal peak side-lobe level is presented,and the detailed steps of the method are discussed.This method can attack the problem of thinned planar array synthesis.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 exists between the array factor and the element excitations.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.
Keywords:Array antennas  planar array  Fast Fourier Transform (FFT)  iteration  side-control
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号