Title :
Fast discrete Fourier transform with exponentially spaced points
Author_Institution :
Dept. of Electr. & Control Eng., Durban-Westville Univ., South Africa
fDate :
12/1/1995 12:00:00 AM
Abstract :
The use of fast algorithms for evaluation of discrete Fourier transform-inverse transform pairs with uniformly spaced input data but with output data required only at exponentially spaced intervals is investigated. The algorithms require order (N) arithmetic operations, rather than the order (N log(N)) required for the full FFT algorithm
Keywords :
digital arithmetic; discrete Fourier transforms; inverse problems; signal processing; DFT; FFT algorithm; arithmetic operations; exponentially spaced intervals; exponentially spaced points; fast algorithms; fast discrete Fourier transform; inverse transform; output data; uniformly spaced input data; Arithmetic; Communication system control; Control systems; Discrete Fourier transforms; Discrete transforms; Displays; Fast Fourier transforms; Frequency domain analysis; Signal resolution; Speech processing;
Journal_Title :
Signal Processing, IEEE Transactions on
