Fast discrete Fourier transform with exponentially spaced points

Discrete Fourier transforms or inverse transform pairs with uniformly spaced input data but with output data required only at exponentially spaced intervals are evaluated by means of fast algorithms. Results suggest that the use of the algorithms reduces the number of arithmetic operations involved in the solution of discrete Fourier transforms by minimizing the number of output data points.