Implementation of "Split-radix" FFT algorithms for complex, real, and real-symmetric data

This publication has 20 references indexed in Scilit:

• Existence of a 2 ⁿ FFT algorithm with a number of multiplications lower than 2 ^{n +1}
  Electronics Letters, 1984
• Simple FFT and DCT algorithms with reduced number of operations
  Signal Processing, 1984
• Fast algorithms for the discrete W transform and for the discrete Fourier transform
  IEEE Transactions on Acoustics, Speech, and Signal Processing, 1984
• Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transform
  IEEE Transactions on Acoustics, Speech, and Signal Processing, 1984
• Discrete Fourier transform algorithms for real valued sequences
  IEEE Transactions on Acoustics, Speech, and Signal Processing, 1984
• ‘Split radix’ FFT algorithm
  Electronics Letters, 1984
• On Computing the Discrete Fourier Transform
  Mathematics of Computation, 1978
• A fast Fourier transform algorithm for symmetric real-valued series
  IEEE Transactions on Audio and Electroacoustics, 1972
• Numerical Analysis: A fast fourier transform algorithm for real-valued series
  Communications of the ACM, 1968
• An economical method for calculating the discrete Fourier transform
  Published by Association for Computing Machinery (ACM) ,1968