平面天线阵方向图的FFT算法简析  

Brief Analysis of FFT Algorithm for Pattern of Planar Array Antennas

作　　者：刘俊群[1] 

机构地区：[1]南京电子技术研究所,江苏省南京市210013

出　　处：《电子工程师》2008年第9期1-3,10,共4页Electronic Engineer

摘　　要：介绍了平面天线阵中常见的方向图FFT(快速傅里叶变换)算法原理,指出该算法在应用中应考虑的条件、范围等,在基本计算原理的基础上,利用常规算法程序给出线阵的计算实例,分析各实例有待扩展的计算特性,并分析原因、给出扩展方法,在此基础上给出线阵和平面阵列的扩展算法计算实例,结果表明该扩展算法能满足一般线阵和平面阵列的方向图计算需求,提高计算效率。This paper introduces the principle of common FFT algorithm for antenna pattern computation of planar array antennas and points out conditions and range of application of this algorithm. The algorithm is illustrated by a few computed examples of linear array antennas. The characteristics of the algorithm are analyzed and proved to be need extension. Then this paper gives the extending methods of the unsatisfactory algorithm after analyzing the reasons, and gives the corresponding computation examples of the linear array antennas and some examples of planar array antennas using the extended algorithm. The results show that the computation requirement of the pattern of conventional linear and planar array antennas can be met using the extended algorithm and that the computation efficiency is improved.

关 键 词：平面天线阵 方向图 FFT 周期性 

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