Download
digital signal processing n.
Skip this Video
Loading SlideShow in 5 Seconds..
Digital Signal Processing PowerPoint Presentation
Download Presentation
Digital Signal Processing

Digital Signal Processing

162 Views Download Presentation
Download Presentation

Digital Signal Processing

- - - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

  1. Digital Signal Processing Prof. Nizamettin AYDIN naydin@yildiz.edu.tr http://www.yildiz.edu.tr/~naydin

  2. Digital Signal Processing Lecture 14 Z Transforms: Introduction

  3. READING ASSIGNMENTS • This Lecture: • Chapter 7, Sects 7-1 through 7-5 • Other Reading: • Recitation: Ch. 7 • CASCADING SYSTEMS • Next Lecture: Chapter 7, 7-6 to the end

  4. LECTURE OBJECTIVES • INTRODUCE the Z-TRANSFORM • Give Mathematical Definition • Show how the H(z) POLYNOMIAL simplifies analysis • CONVOLUTIONis SIMPLIFIED ! • Z-Transform can be applied to • FIR Filter: h[n] --> H(z) • Signals: x[n] --> X(z)

  5. THREE DOMAINS Z-TRANSFORM-DOMAIN POLYNOMIALS: H(z) FREQ-DOMAIN TIME-DOMAIN

  6. Three main reasons for Z-Transform • Offers compact and convenient notation for describing digital signals and systems • Widely used by DSP designers, and in the DSP literature • Pole-zero description of a processor is a great help in visualizing its stability and frequency response characteristic

  7. TRANSFORM CONCEPT • Move to a new domain where • OPERATIONS are EASIER & FAMILIAR • Use POLYNOMIALS • TRANSFORM both ways • x[n] ---> X(z) (into the z domain) • X(z) ---> x[n] (back to the time domain)

  8. “TRANSFORM” EXAMPLE • Equivalent Representations x[n] y[n] x[n] y[n]

  9. Z-TRANSFORM IDEA • POLYNOMIAL REPRESENTATION x[n] y[n] x[n] y[n]

  10. Z-Transform DEFINITION • POLYNOMIAL Representation of LTI SYSTEM: • EXAMPLE: APPLIES to Any SIGNAL POLYNOMIAL in z-1

  11. Z-Transform EXAMPLE • ANY SIGNAL has a z-Transform:

  12. EXPONENT GIVES TIME LOCATION

  13. Example x[n] 1 0.8 0.64 0.512 … n • Find the Z-Transform of the exponentially decaying signal shown in the following figure, expressing is as compact as possible.

  14. The Z-Transform of the signal:

  15. Example • Find and sketch, the signal corresponding to the Z-Transform:

  16. Recasting X(z) as a power series in z-1, we obtain: • Succesive values of x[n], starting at n=0, are therefore: 0, 1, -1.2, 1.44, -1.728, ···

  17. x[n] 1.44 1 … n -1.2 -1.728 • x[n] is shown in the following figure:

  18. Z-Transform of FIR Filter CONVOLUTION FIR DIFFERENCE EQUATION • CALLED the SYSTEM FUNCTION • h[n] is same as {bk} SYSTEM FUNCTION

  19. Z-Transform of FIR Filter • Get H(z) DIRECTLY from the {bk} • Example 7.3 in the book:

  20. Ex. DELAY SYSTEM • UNIT DELAY: find h[n] and H(z) x[n] y[n] = x[n-1] x[n] y[n]

  21. DELAY EXAMPLE • UNIT DELAY: find y[n] via polynomials • x[n] = {3,1,4,1,5,9,0,0,0,...}

  22. DELAY PROPERTY

  23. GENERAL I/O PROBLEM • Input is x[n], find y[n] (for FIR, h[n]) • How to combine X(z) and H(z) ?

  24. FIR Filter = CONVOLUTION CONVOLUTION

  25. CONVOLUTION PROPERTY • PROOF: MULTIPLY Z-TRANSFORMS

  26. CONVOLUTION EXAMPLE • MULTIPLY the z-TRANSFORMS: MULTIPLY H(z)X(z)

  27. CONVOLUTION EXAMPLE • Finite-Length input x[n] • FIR Filter (L=4) MULTIPLY Z-TRANSFORMS y[n] = ?

  28. CASCADE SYSTEMS • Does the order of S1 & S2 matter? • NO, LTI SYSTEMS can be rearranged !!! • Remember: h1[n] * h2[n] • How to combine H1(z) and H2(z) ? S1 S2

  29. CASCADE EQUIVALENT x[n] y[n] x[n] y[n] EQUIVALENT SYSTEM • Multiply the System Functions

  30. CASCADE EXAMPLE x[n] w[n] y[n] x[n] y[n]