Does Matlab use Cooley Turkey algorith for their FFT implementation?

24 次查看（过去 30 天）

Nina 2014-7-30

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/144116-does-matlab-use-cooley-turkey-algorith-for-their-fft-implementation

评论： Sriram Paravastu 2016-8-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 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

请先登录，再回答此问题。

采纳的回答

Star Strider 2014-7-30

1
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/144116-does-matlab-use-cooley-turkey-algorith-for-their-fft-implementation#answer_146926

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 个评论
显示 1更早的评论隐藏 1更早的评论

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!

请先登录，再进行评论。