Picking an FFT length

4 次查看（过去 30 天）
Alan
Alan 2011-10-21
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?

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

采纳的回答

Greg Heath
Greg Heath 2011-10-21
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 个）

类别

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

Translated by