differences between all the FFTs?

1 次查看（过去 30 天）

jon 2013-5-2

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/74396-differences-between-all-the-ffts

Wikipedia lists a lot of FFT algorithms:

Cooley–Tukey FFT algorithm, Prime-factor FFT algorithm, Bruun's FFT algorithm, Rader's FFT algorithm, and Bluestein's FFT algorithm http://en.wikipedia.org/wiki/Fast_Fourier_transform

What are the pros and cons of each algorithms? And which one do you prefer?

4 个评论
显示 2更早的评论隐藏 2更早的评论

Matt Kindig 2013-5-3

在 MATLAB Online 中打开

Of course you can do fft with Matlab, using the fft() function. However, your question was a comparison of algorithms, which is not a Matlab question.

For what it's worth, you can learn more about the particular algorithm used by Matlab in the fft() documentation, under "Algorithm", at

doc fft

It seems that several of the algorithms that you named are all used by Matlab at various points in the computation.

Matt Kindig 2013-5-3

Alternatively, you can program any of these FFT algorithms yourself using Matlab. However, how to implement a particular FFT into Matlab is a very different question than your question, which is more of an opinion about the different algorithms.

请先登录，再进行评论。

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