フィルターのクリア

FFT - Effective bits and dynamic range

4 ビュー (過去 30 日間)
William
William 2011 年 10 月 12 日
Hi,
I have some data recorded using a 10-bit analog to digital converter. I have imported the data into MATLAB and analyzed it using the FFT.
My questions is: how can I determine the FFT dynamic range and number of effective bits? Thanks.

回答 (1 件)

joeDiHare
joeDiHare 2011 年 10 月 12 日
What is the syntax you used?
fft(x) by default takes N=nextpow2(length(x)) points, which gives a fs/N time resolution.
  2 件のコメント
Wayne King
Wayne King 2011 年 10 月 12 日
@stefano, fft(x) computes the discrete Fourier transform for an N-point signal and returns the N-point DFT, not nextpow2(length(x)) by default.
William
William 2011 年 10 月 12 日
Thanks for the reply. I just used fft(x) where x is the data vector (not necessarily a power of two).
The time resolution is useful, but I would still like to know the FFT dynamic range and number of effective bits? Thanks again.

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

カテゴリ

Help Center および File ExchangeFourier Analysis and Filtering についてさらに検索

タグ

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by