필터 지우기
필터 지우기

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 CenterFile 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