Picking an FFT length

2 ビュー (過去 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?
  1 件のコメント
Sean de Wolski
Sean de Wolski 2011 年 10 月 21 日
As far as time is concerned?
Test it and time it!

サインインしてコメントする。

サインインしてこの質問に回答する。

採用された回答

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