Does Matlab use Cooley Turkey algorith for their FFT implementation?
显示 更早的评论
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
采纳的回答
Star Strider
2014-7-30
1 个投票
From the documentation:
- ‘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.’
See ‘Algorithms’ under ‘More About’ near the end of the documentation for fft for the full discussion.
3 个评论
Nina
2014-7-31
Star Strider
2014-7-31
My pleasure!
Sriram Paravastu
2016-8-30
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!
更多回答（0 个）
类别
在 帮助中心 和 File Exchange 中查找有关 Hilbert and Walsh-Hadamard Transforms 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Translated by 
