dspq第十七次课(第九章).pptVIP

Chapter 9 DFT/FFT Algorithms 9.1 Frequency Resolution and Windowing 9.2 DFT Computation9.2.1 DTFT at a Single Frequency 9.2.1 DTFT over Frequency Range 9.2.3 DFT 9.2.4 Zero Padding 9.3 Physical versus Computational Resolution * * DFT : discrete Fourier transform FFT : fast Fourier transform (FFT is the fast implementation of DFT) FFT have three major uses in DSP : a) the numerical computation of the frequency spectrum of a signal b) the efficient implementation of convolution by the FFT c) the coding of waveforms 问题：用数字信号处理的方法分析模拟信号x(t)的频谱 用我们前面学过的知识解决这个问题： 第一步：对x(t)进行采样得