FFT - Effective bits and dynamic range
5 ビュー (過去 30 日間)
古いコメントを表示
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.
0 件のコメント
回答 (1 件)
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
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.
参考
カテゴリ
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!