LINEAR FILTERING APPROACH TO COMPUTATION OF DISCRETE FOURIER TRANSFORM
LINEAR FILTERING APPROACH TO COMPUTATION OF DISCRETE FOURIER TRANSFORM
复制标题
DOI：
10.1109/tau.1970.1162132
复制
发表时间：
1970-01-01
期刊：
影响因子：
--
通讯作者：
BLUESTEIN, LI
中科院分区：
文献类型：
--
作者：
BLUESTEIN, LI
本文指出，为了将离散傅立叶变换（DFT）作为线性滤波过程进行计算，需要一个离散等效的啁啾滤波器。我们进一步表明，在广泛的情况下，啁啾滤波器不应该被实现为横向滤波器；用它来代替传统的FFT，使得DFT的计算时间正比于被变换数组中任何点的数量。另一种提出的啁啾滤波器实现要求N为完全平方。该算法所需的操作数与。
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 tofor anybeing 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.