Old Web
Extension of a radix-2 fast Fourier transform (FFT) program to include a prime factor
1974
A simple procedure is presented to develop a fast Fourier transform (FFT) program for PQ points starting from a program for Q points, with emphasis on Q = 2 M . The transformation with respect to the factor P is followed by a transformation of P groups of Q points each using the existing subroutine, then the array is unscrambled with respect to P.
Keywords:
- Discrete Fourier transform
- Constant Q transform
- Mathematical optimization
- Mathematics
- Prime-factor FFT algorithm
- Fourier transform on finite groups
- Non-uniform discrete Fourier transform
- Discrete Fourier transform (general)
- Split-radix FFT algorithm
- Cyclotomic fast Fourier transform
- Discrete mathematics
- Mathematical analysis
- Fractional Fourier transform
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
5
References
1
Citations
NaN
KQI