Fast computation of Fourier transforms at arbitrary frequencies

Sudhakar, R. ; Agarwal, R. ; Roy, S. D. (1981) Fast computation of Fourier transforms at arbitrary frequencies IEEE Transactions on Circuits and Systems, 28 (10). pp. 972-980. ISSN 0098-4094

Full text not available from this repository.

Official URL:

Related URL:


An algorithm is proposed for computing the Fourier Transform (FT) of a uniformly sampled signal at arbitrary frequencies. In most of the applications, the algorithm retains the computational efficiency of the Fast Fourier Transform (FFT) algorithm. The method is based on the fact that the FT at an arbitrary frequency can be expressed as a weighted sum of its Discrete Fourier Transform (DFT) coefficients. In the proposed method, these weights are suitably approximated so that the desired FT is very nearly the sum of (i) a few dominant terms of the sum of the DFT which are computed directly, and (ii) the DFT of a new sequence obtained by multiplying the original sequence with a sawtooth function. The number of directly computed terms is so chosen that the error of approximation does not exceed the specified limits. The computational aspects of the algorithm and its error behavior with typical signals have been critically examined.

Item Type:Article
Source:Copyright of this article belongs to IEEE.
ID Code:92264
Deposited On:29 May 2012 12:26
Last Modified:29 May 2012 12:26

Repository Staff Only: item control page