Issue No.08 - August (1971 vol.20)
M.J. Corinthios , IEEE
An arbitrary-radix fast Fourier transform algorithm and a design of its implementing signal processing machine are introduced. The algorithm yields an implementation with a level of parallelism proportional to the radix r of factorization of the discrete Fourier transform, allows 100 percent utilization of the arithmetic unit, and yields properly ordered Fourier coefficients without the need for pre- or postordering of data.
Convolution, correlation, digital filtering, digital signal processing, fast Fourier transform, machine organization, special-purpose computer, spectral analysis, time-series analysis.
M.J. Corinthios, "A Fast Fourier Transform for High-Speed Signal Processing", IEEE Transactions on Computers, vol.20, no. 8, pp. 843-846, August 1971, doi:10.1109/T-C.1971.223359