Picking an FFT length
显示 更早的评论
How could I find the most efficient FFT size greater than N? I know that with fftw "sizes that are products of small factors are transformed most efficiently". I also know that if N=1025, there is going to be a more efficient size than the next power of 2 which is 2048. But in general, what's the best way to find the right size for a given N?
1 个评论
Sean de Wolski
2011-10-21
As far as time is concerned?
Test it and time it!
采纳的回答
Greg Heath
2011-10-21
0 个投票
Why not just overlay the times vs size plot for
X = fft(randn(N,M))
when M = 1e4 N1 = 2.^(1:10) % blue and N2 = floor(pi.^(1:6)) %red
or, pick your own sizes.
Hope this helps.
Greg
更多回答（0 个）
类别
在 帮助中心 和 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!
Translated by 
