- ‘To compute an N-point DFT when N is composite (that is, when N = N1N2), the FFTW library decomposes the problem using the Cooley-Tukey algorithm [1], which first computes N1 transforms of size N2, and then computes N2 transforms of size N1.’
Does Matlab use Cooley Turkey algorith for their FFT implementation?
24 visualizaciones (últimos 30 días)
Mostrar comentarios más antiguos
Nina
el 30 de Jul. de 2014
Comentada: Sriram Paravastu
el 30 de Ag. de 2016
I am trying to figure out if Matlab fft uses the Cooley Turkey algorithm, if yes could someone please direct me to the source, if not, could you tell me what they use? Thank you
0 comentarios
Respuesta aceptada
Star Strider
el 30 de Jul. de 2014
From the documentation:
See ‘Algorithms’ under ‘More About’ near the end of the documentation for fft for the full discussion.
3 comentarios
Sriram Paravastu
el 30 de Ag. de 2016
While dividing it into an N/2 size transforms, how does the MATLAB algorithm divide it? Is it that all the even-indexed elements go into one set and the odd indexed ones go into the other?
And, what algorithm is used? Radix-2 or Radix-4?
Thanks a lot in advance!
Más respuestas (0)
Ver también
Categorías
Más información sobre Fourier Analysis and Filtering en Help Center y File Exchange.
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!