基于Chirp-z 变换的阵列天线方向图快速计算

    Fast Computation of Array Antenna Pattern Based on Chirp-z Transform

    • 摘要: 分析了等距阵列天线方向性函数与Chirp-z 变换之间的一致性,讨论了Chirp-z 变换的快速计算方法,表明可利用Chirp-z 变换法对阵列方向图函数进行快速计算。Chirp-z 算法自身已经考虑了不同单元间距的影响,避免了对可见空间的讨论。另外,Chirp-z 算法能对可见空间进行任意点数的等间距取值,保证了波束指向精度。文中给出实例,对Chirp-z 变换法的准确性、快速性进行验证,结果显示该方法能够准确、快速计算阵列天线方向图。

       

      Abstract: In this paper,a derivation shows that the uniformly-spaced array antenna pattern can be expressed as a Chirp z-transform format. Meanwhile,the Chirp z-transform can be computed with multi-FFT operations which means the Chirp z-transform can be directly used to fast compute array antenna pattern. Difference with FFT algorithm,Chirp z-transform is not troubled with the element distance. The computation result with Chirp z-transform can fitly full of visible space. Moreover,Chirp z-transform can equally get val? ues from the visible space at any numbers which increases the resolving accuracy in pointer. In the text,two examples have been given to verify the accuracy and rapidity of the Chirp-z method,and the results show Chirp-z method satisfy our requirement.

       

    /

    返回文章
    返回