Chapter 5(第三版教材).ppt

Chapter 5 Finite-Length discrete Transforms Discrete Fourier Transform (DFT) DTFT is the Fourier Transform of discrete-time sequence. It is discrete in time domain and its spectrum is periodical, but continue which cannot be processed by computer which could only process digital signals in both sides, that means the signals in both sides must be both discrete and periodical. Discrete Fourier Transform (DFT) Time domain Frequency domain Continue aperiodical ? FT ? Continue aperiodical Periodical ? FST ? discrete spectrum Discrete ? DTFT ? periodical spectrum Discrete periodical ? DFT ? periodical discrete Typical DFT PairδT(t) ?? ω0δω0(ω) Make a signal discrete and periodical The engineering signals are often continue and aperiodical. If we want to process the signals with DFT, we have to make the signals discrete and periodical. Make a signal discrete and periodical Discrete Fourier Transform (DFT) Definition - The simplest relation between a length-N sequence x[n], defined for 0≤n ≤N-1, and its DTFT X(ej?) is obtained by uniformly sampling X(ej?) on the w-axis between 0≤? ≤2? at ?k=2?k/N , 0≤k≤N-1 From the definition of the DTFT have Discrete Fourier Transform (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] Using the notation WN=e-j2?/N the DFT is usually expressed as: Discrete Fourier Transform (DFT) The Inverse Discrete Fourier Transform (IDFT) is given by Discrete Fourier Transform (DFT) resulting in Discrete Fourier Transform (DFT) Making use of the identity Discrete Fourier Transform (DFT) Example - Consider the length-N sequence Discrete Fourier Transform (DFT) Example - Consider the length-N sequence Discrete Fourier Transform (DFT) Example - Consider the length-N sequence defined for 0 ≤n ≤N-1 Discrete Fourier Transform (DFT) The N-point DFT of g[n] is