1 / 33

Chapter 8. The Discrete Fourier Transform

Chapter 8. The Discrete Fourier Transform. 8.1 Laplace, z-, and Fourier Transforms 8.2 Fourier Transform 8.3 Fourier Series 8.4 Discrete Fourier Transform (DFT) 8.5 Properties of DFS/DFT 8.6 DFT and z-Transform 8.7 Linear Convolution vs. Circular Convolution

bly
Download Presentation

Chapter 8. The Discrete Fourier Transform

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Chapter 8. The Discrete Fourier Transform 8.1 Laplace, z-, and Fourier Transforms 8.2 Fourier Transform 8.3 Fourier Series 8.4 Discrete Fourier Transform (DFT) 8.5 Properties of DFS/DFT 8.6 DFT and z-Transform 8.7 Linear Convolution vs. Circular Convolution 8.8 Discrete Cosine Transform(DCT) BGL/SNU

  2. H(s) H(z) 1. Laplace, z-, Fourier Transforms • Analog systems • (continuous time) • Digital Systems • (discrete time) BGL/SNU

  3. Laplace transform -z-transform LHP inside u.c Fouier transforms BGL/SNU

  4. 2. Fourier Transform (1) continuous aperiodic signals conti aper aper conti x(t) 1 t BGL/SNU

  5. (2) Discrete aperiodic signals conti per aper discr x(n) 1 t ω

  6. 3. Fourier Series (1) continuous periodic signals discrete aper per conti BGL/SNU

  7. X(t) 1 k t T (2) discrete periodic signals (*Discrete Fourier Series) discrete per per discre BGL/SNU

  8. x[n] 1 BGL/SNU

  9. 4. Discrete Fourier Transform (DFT) -For a numerical evaluation of Fourier transform and its inversion, (i.e,computer-aided computation), we need discrete expression of of both the time and the transform domain data. -For this,take the advantage of discrete Fourier series(DFS, on page 4), in which the data for both domain are discrete and periodic. discrete periodic periodic discrete -Therefore, given a time sequence x[n], which is aperiodic and discrete, take the following approach. BGL/SNU

  10. Mip Top Top Mip DFS DFT Reminding that, in DFS BGL/SNU

  11. Define DFT as (eq) X[k] x[n] 1 k n N N BGL/SNU

  12. Graphical Development of DFT

  13. DFS BGL/SNU

  14. DFT BGL/SNU

  15. 5. Property of DFS/DFT (8.2 , 8.6) (1) Linearity (2) Time shift (3) Frequency shift BGL/SNU

  16. (4) Periodic/circular convolution in time (5) Periodic/circular convolution in frequency BGL/SNU

  17. (6) Symmetry DFT DFS BGL/SNU

  18. 6. DFT and Z-Transform (1) Evaluation of from ①If length limited in time, (I.e., x[n]=0, n<0, n>=N) then BGL/SNU

  19. … ② What if x[n] is not length-limited? then aliasing unavoidable. … … … … …

  20. (2) Recovery of [or ] from (in the length-limited case) BGL/SNU

  21. BGL/SNU

  22. 7. Linear Convolution vs. Circular Convolution (1) Definition ① Linear convolution BGL/SNU

  23. ② Circular convolution N Rectangular window of length N Periodic convolution N BGL/SNU

  24. (2) Comparison N H[n] 2N 2N Omit chap. 8.7

  25. 8. Discrete cosine transform (DCT) Definition - Effects of Energy compaction BGL/SNU Test signal for computing DFT and DCT

  26. (a) Real part of N-point DFT; (b) Imaginary part of N-point DFT; (c) N-point DCT-2 of the test signal BGL/SNU

  27. Comparison of truncation errors for DFT and DCT-2 BGL/SNU

  28. Appendix: Illustration of DFTs for Derived Signals BGL/SNU

  29. BGL/SNU

  30. BGL/SNU

  31. BGL/SNU

  32. BGL/SNU

  33. H.W. of Chapter 8 Text : [1] 8.10    [2] 8.29   [3] 8.32   [4] 8.37 Ref : [5] Project 3.4 DFT Properties Q3.31, Q3.33, Q3.36, Q3.38, Q3.40, Q3.44 BGL/SNU

More Related