基于FFT的阵列方向图快速计算

Fast Computation of Array Pattern Based on FFT

分析了等距线阵方向图与傅立叶变换的一致性,用FFT算法进行阵列方向图快速计算。通过严格的数学推导,揭示变换序列与可见空间的关系,讨论了不同单元间距情况下的处理方法。文中结合实例,阐述了FFT算法在阵列方向图计算中的应用技巧,如扫描处理方法、指向分辨精度和边缘数据点估计,并指出用FFT算法计算阵列方向图其运算速度可提高一个数量级以上。

In this paper, the consistence of equispaced linear array pattern and foureir transform is analyzed, so the linear array pattern can be computed rapidly with FFT algorithm. By. the use of religious mathmatic deducing process, relations between transformation sequences and visible space are given, and different handling procedures are discussed in the case of different element spacing. Meanwhile, examples are given to illustrate some applied techniques for FFT algorithm on the fast computation of linear array pattern, such as treatment of scanning, estimations of resolving accuracy in pointer and marginal angle. It is shown that the operation can be speeded up about tenfold or more while FFT algorithm is applied to the computation of the linear array pattern.