数字信号处理 杨炼 教学课件-Chapter5-2015.pptVIP

Chapter 5 Finite-Length Discrete Transforms Definition of DFT The Relationship Between DFT and DTFT DFT Properties DFT Computation Discrete Fourier Transform (DFT) Time domain Frequency domain Continuous Aperiodical? FT ?Continue Aperiodical Continuous Periodical ? FS ? Discrete Aperiodical Discrete Aperiodical? DTFT ?Periodical Continuous Discrete Periodical ? DFS ? Periodical Discrete Typical DFT Pair δT(t) ?? ω0δω0(ω) Make a Signal Discrete and Periodical The engineering signals are often continuous and aperiodical. If we want to process the signals with DFT, we have to make the signals discrete and periodical. Sampling to make the signal be discrete. Make the signal periodical by periodical expanding. Make a Signal Discrete and Periodical From DTFT to get DFT DTFT: discrete in time domain, continuous in frequency domain. Sampling the DTFT of sequences to get N frequency points to research, that is DFT. 5.2 The Discrete Fourier Transform(DFT) A kind of useful tool to process finite sequences. Based on DFT ,we can use computer to perform signal processing. FFT algorithm is a core in DSP. DFT is the same as the DFS. 5.2.1 The Definition of DFT Where: The Definition of DFT Note: X[k] is also a length-N sequence in the frequency domain. The sequence X[k] is called the Discrete Fourier Transform (DFT) of the sequence x[n]. To verify the above expression we multiply both sides of the above equation by WNln and sum the result from n = 0 to n=N-1. The Definition of DFT resulting in: The Definition of DFT Making use of the identity The Definition of DFT Example - Consider the length-N sequence: The Definition of DFT Example - Consider the length-N sequence: The Definition of DFT Example - Consider the length-N sequence defined for 0 ≤n ≤N-1 The Definition of DFT The N-point DFT of g[n] is thus given by: The Definition of DFT Making use of the identity: 5.2.2 Computational Complexity Issues DFT and IDFT definition: 5.2.3