Picking an FFT length
2 visualizaciones (últimos 30 días)
Mostrar comentarios más antiguos
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 comentario
Respuesta aceptada
Greg Heath
el 21 de Oct. de 2011
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 comentarios
Más respuestas (0)
Ver también
Categorías
Más información sobre Fourier Analysis and Filtering en Help Center y File Exchange.
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!