- ‘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 visualizzazioni (ultimi 30 giorni)
Mostra commenti meno recenti
Nina
il 30 Lug 2014
Commentato: Sriram Paravastu
il 30 Ago 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 Commenti
Risposta accettata
Star Strider
il 30 Lug 2014
From the documentation:
See ‘Algorithms’ under ‘More About’ near the end of the documentation for fft for the full discussion.
3 Commenti
Sriram Paravastu
il 30 Ago 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!
Più risposte (0)
Vedere anche
Categorie
Scopri di più su Fourier Analysis and Filtering in Help Center e File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!