首页 | 本学科首页   官方微博 | 高级检索  
     

一种基于迭代FFT算法的直线稀疏阵列优化方法
引用本文:黄 伟,吴宏刚,陈客松.一种基于迭代FFT算法的直线稀疏阵列优化方法[J].现代雷达,2012,34(5):62-65.
作者姓名:黄 伟  吴宏刚  陈客松
作者单位:1. 电子科技大学电子工程学院,成都,610054
2. 中国民用航空局第二研究所科研开发中心,成都,610041
基金项目:国家自然科学基金资助项目
摘    要:介绍了一种基于迭代快速傅里叶变换(FFT)算法的优化方法来实现直线稀疏阵列的峰值旁瓣电平最优化,分析并给出了该方法的详细优化步骤.利用阵列因子与阵元激励之间存在的傅里叶变换关系,对不同的初始随机阵元激励分别作迭代循环,便可以得到最优的阵元分布.在迭代过程中,根据稀疏率将阵元激励按幅度大小置1置0来完成阵列稀疏.通过对仿真结果进行分析,证明了该方法的快速性、有效性和稳健性.

关 键 词:天线阵列  稀疏阵列  快速傅里叶变换  迭代循环  旁瓣约束

An Optimum Method of Thinned Linear Arrays Based on Iterative FFT Algorithm
HUANG Wei,WU Hong-gang and CHEN Ke-song.An Optimum Method of Thinned Linear Arrays Based on Iterative FFT Algorithm[J].Modern Radar,2012,34(5):62-65.
Authors:HUANG Wei  WU Hong-gang and CHEN Ke-song
Affiliation:1(1.School of Electronic Engineering,University of Electronic Science and Technology of China,Chengdu 610054,China)(2.Research and Development Center,The Second Research Institute of Civil Aviation Administration of China,Chengdu 610041,China)
Abstract:An optimum method based on iterative FFT algorithm for thinned linear arrays featuring an optimal peak side-lobe level is presented and the detailed steps of the method are discussed.An optimal elements distribution can be obtained when each iteration loop 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 analysis of the simulated results confirm the quickness,the effectiveness and the robustness of the method.
Keywords:array antennas  thinned arrays  fast Fourier transform  iteration loop  side-control
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《现代雷达》浏览原始摘要信息
点击此处可从《现代雷达》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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