On computing the split-radix FFT

This publication has 13 references indexed in Scilit:

• Implementation of "Split-radix" FFT algorithms for complex, real, and real symmetric data
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2005
• Multiply/Add tradeoffs in length-2>sup/sup<FFT algorithms
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2005
• 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
• Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transform
  IEEE Transactions on Acoustics, Speech, and Signal Processing, 1984
• ‘Split radix’ FFT algorithm
  Electronics Letters, 1984
• An in-place, in-order prime factor FFT algorithm
  IEEE Transactions on Acoustics, Speech, and Signal Processing, 1981
• On the multiplicative complexity of the Discrete Fourier Transform
  Advances in Mathematics, 1979
• On Computing the Discrete Fourier Transform
  Mathematics of Computation, 1978
• An economical method for calculating the discrete Fourier transform
  Published by Association for Computing Machinery (ACM) ,1968