- ‘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 ビュー (過去 30 日間)
古いコメントを表示
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 件のコメント
採用された回答
Star Strider
2014 年 7 月 30 日
From the documentation:
See ‘Algorithms’ under ‘More About’ near the end of the documentation for fft for the full discussion.
3 件のコメント
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 件)
参考
カテゴリ
Help Center および File Exchange で Fourier Analysis and Filtering についてさらに検索
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!