1994/09/01 by David A. Bailey, Paul N. Swarztrauber · 1 citation
Computer Science · Mathematics · #Digital Filter Design and Implementation #Numerical Methods and Algorithms #Iterative Methods for Nonlinear Equations #Fast Fourier transform #Prime-factor FFT algorithm #Split-radix FFT algorithm #Mathematics #Laplace transform #Fourier transform #Computation #Discrete Fourier transform (general) #Discrete-time Fourier transform #Algorithm #Rader's FFT algorithm #Fourier analysis #Fractional Fourier transform #Mathematical analysis #Applied mathematics
paper · doi:10.1137/0915067
openalex publication_date 1994/09/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/17
The fast Fourier transform (FFT) is often used to compute numerical approximations to continuous Fourier and Laplace transforms. However, a straightforward application of the FFT to these problems often requires a large FFT to be performed, even though most of the input data to this FFT may be zero and only a small fraction of the output data may be of interest. In this note, the “fractional Fourier transform,” previously developed by the authors, is applied to this problem with a substantial savings in computation.