- ‘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!