Abstract :
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.
Keywords :
Convolution, correlation, digital filtering, digital signal processing, fast Fourier transform, machine organization, special-purpose computer, spectral analysis, time-series analysis.; Arithmetic; Costs; Discrete Fourier transforms; Fast Fourier transforms; Output feedback; Parallel processing; Signal design; Signal processing; Signal processing algorithms; Spectral analysis; Convolution, correlation, digital filtering, digital signal processing, fast Fourier transform, machine organization, special-purpose computer, spectral analysis, time-series analysis.;
