A linear filtering approach to the computation of discrete Fourier transform
暂无分享,去创建一个
It is shown in this paper that the discrete equivalent of a chirp filter is needed to implement the computation of the discrete Fourier transform (DFT) as a linear filtering process. We show further that the chirp filter should not be realized as a transversal filter in a wide range of cases; use instead of the conventional FFT permits the computation of the DFT in a time proportional to N \log_{2} N for any N, N being the number of points in the array that is transformed. Another proposed implementation of the chirp filter requires N to be a perfect square. The number of operations required for this algorithm is proportional to N^{3/2} .
[1] I. Vinogradov,et al. Elements of number theory , 1954 .
[2] J. Tukey,et al. An algorithm for the machine calculation of complex Fourier series , 1965 .
[3] Thomas G. Stockham,et al. High-speed convolution and correlation , 1966, AFIPS '66 (Spring).
[4] L. Rabiner,et al. The chirp z-transform algorithm and its application , 1969 .
[5] Alan R. Jones,et al. Fast Fourier Transform , 1970, SIGP.