1985/10/01 by P. Simonen, H. Olkkonen · 1 citation
Computer Science · Physics and Astronomy · Engineering · Mathematics · #Digital Filter Design and Implementation #Electromagnetic Scattering and Analysis #Acoustic Wave Phenomena Research #Discrete Fourier transform (general) #Fast Fourier transform #Fourier transform #Prime-factor FFT algorithm #Split-radix FFT algorithm #Non-uniform discrete Fourier transform #Fractional Fourier transform #Algorithm #Discrete-time Fourier transform #Phase correlation #Point (geometry) #Harmonic wavelet transform #Discrete sine transform #Cyclotomic fast Fourier transform #Computer science #Mathematics #Fourier analysis #Mathematical analysis #Artificial intelligence #Geometry
paper · doi:10.1016/0141-5425(85)90067-6
openalex publication_date 1985/10/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/15
A new algorithm for computing the Fourier transform is described. The method is based on the calculation of the Fourier integral transform (FIT) with the aid of the numerical Simpson's integration technique. Compared to the conventional fast Fourier transform (FFT), the new SFIT algorithm, gives results which are much closer to the analytic Fourier transform for discrete signals. Especially in the calculation of the phase spectra considerable improvement is obtained. The N-point SFIT can effectively be computed by using two N/2-point FFTs.