The Z-Transform. Fall 2012, EE123 Digital Signal Processing. Eigen Functions of LTI System. Eigen Functions of LTI System

Similar documents
EE123 Digital Signal Processing. M. Lustig, EECS UC Berkeley

ESE 531: Digital Signal Processing

ESE 531: Digital Signal Processing

! z-transform. " Tie up loose ends. " Regions of convergence properties. ! Inverse z-transform. " Inspection. " Partial fraction

Discrete-Time Signals and Systems. The z-transform and Its Application. The Direct z-transform. Region of Convergence. Reference: Sections

X (z) = n= 1. Ã! X (z) x [n] X (z) = Z fx [n]g x [n] = Z 1 fx (z)g. r n x [n] ª e jnω

SIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals

ECE503: Digital Signal Processing Lecture 4

6.003: Signals and Systems

UNIT-II Z-TRANSFORM. This expression is also called a one sided z-transform. This non causal sequence produces positive powers of z in X (z).

Z-Transform. The Z-transform is the Discrete-Time counterpart of the Laplace Transform. Laplace : G(s) = g(t)e st dt. Z : G(z) =

Signals and Systems Lecture 8: Z Transform

ELEG 305: Digital Signal Processing

y[n] = = h[k]x[n k] h[k]z n k k= 0 h[k]z k ) = H(z)z n h[k]z h (7.1)

The Z transform (2) 1

DSP-I DSP-I DSP-I DSP-I

The Z transform (2) Alexandra Branzan Albu ELEC 310-Spring 2009-Lecture 28 1

Chapter Intended Learning Outcomes: (i) Understanding the relationship between transform and the Fourier transform for discrete-time signals

(i) Represent discrete-time signals using transform. (ii) Understand the relationship between transform and discrete-time Fourier transform

Signals and Systems. Spring Room 324, Geology Palace, ,

Lecture 2 OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE

8. z-domain Analysis of Discrete-Time Signals and Systems

The z-transform Part 2

Advanced Training Course on FPGA Design and VHDL for Hardware Simulation and Synthesis

Very useful for designing and analyzing signal processing systems

Lecture 04: Discrete Frequency Domain Analysis (z-transform)

Need for transformation?

z-transform Chapter 6

Review of Discrete-Time System

Use: Analysis of systems, simple convolution, shorthand for e jw, stability. Motivation easier to write. Or X(z) = Z {x(n)}

Z Transform (Part - II)

信號與系統 Signals and Systems

Discrete Time Systems

Solutions: Homework Set # 5

Let H(z) = P(z)/Q(z) be the system function of a rational form. Let us represent both P(z) and Q(z) as polynomials of z (not z -1 )

Like bilateral Laplace transforms, ROC must be used to determine a unique inverse z-transform.

Digital Signal Processing

ELEN E4810: Digital Signal Processing Topic 4: The Z Transform. 1. The Z Transform. 2. Inverse Z Transform

Digital Signal Processing:

Chapter 7: The z-transform

EEL3135: Homework #4

Lecture 7 Discrete Systems

Lecture 19 IIR Filters

Digital Control & Digital Filters. Lectures 1 & 2

Module 4 : Laplace and Z Transform Problem Set 4

EE 3054: Signals, Systems, and Transforms Spring A causal discrete-time LTI system is described by the equation. y(n) = 1 4.

Topic 4: The Z Transform

Discrete-Time Fourier Transform (DTFT)

DIGITAL SIGNAL PROCESSING. Chapter 3 z-transform

Z-Transform. 清大電機系林嘉文 Original PowerPoint slides prepared by S. K. Mitra 4-1-1

Fourier Transform 4: z-transform (part 2) & Introduction to 2D Fourier Analysis

Digital Signal Processing, Homework 2, Spring 2013, Prof. C.D. Chung. n; 0 n N 1, x [n] = N; N n. ) (n N) u [n N], z N 1. x [n] = u [ n 1] + Y (z) =

Discrete-Time Signals and Systems. Frequency Domain Analysis of LTI Systems. The Frequency Response Function. The Frequency Response Function

Z - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.

How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches

VI. Z Transform and DT System Analysis

Digital Signal Processing. Midterm 1 Solution

ECE 421 Introduction to Signal Processing

Discrete-time signals and systems

EE 521: Instrumentation and Measurements

2.161 Signal Processing: Continuous and Discrete Fall 2008

Review of Fundamentals of Digital Signal Processing

ECE-S Introduction to Digital Signal Processing Lecture 4 Part A The Z-Transform and LTI Systems

EE-210. Signals and Systems Homework 7 Solutions

Digital Signal Processing Lecture 9 - Design of Digital Filters - FIR

Module 4. Related web links and videos. 1. FT and ZT

# FIR. [ ] = b k. # [ ]x[ n " k] [ ] = h k. x[ n] = Ae j" e j# ˆ n Complex exponential input. [ ]Ae j" e j ˆ. ˆ )Ae j# e j ˆ. y n. y n.

Chapter 13 Z Transform

LECTURE NOTES DIGITAL SIGNAL PROCESSING III B.TECH II SEMESTER (JNTUK R 13)

Signals & Systems Handout #4

Responses of Digital Filters Chapter Intended Learning Outcomes:

EECE 301 Signals & Systems Prof. Mark Fowler

EE123 Digital Signal Processing

Discrete Time Systems

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

Signal Analysis, Systems, Transforms

Flash File. Module 3 : Sampling and Reconstruction Lecture 28 : Discrete time Fourier transform and its Properties. Objectives: Scope of this Lecture:

Chapter 6: The Laplace Transform. Chih-Wei Liu

Review of Fundamentals of Digital Signal Processing

Signals and Systems. Problem Set: The z-transform and DT Fourier Transform

UNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything.

EE 225D LECTURE ON DIGITAL FILTERS. University of California Berkeley


Digital Filters Ying Sun

Stability Condition in Terms of the Pole Locations

Your solutions for time-domain waveforms should all be expressed as real-valued functions.

Notes 22 largely plagiarized by %khc

ECE 3620: Laplace Transforms: Chapter 3:

2. Typical Discrete-Time Systems All-Pass Systems (5.5) 2.2. Minimum-Phase Systems (5.6) 2.3. Generalized Linear-Phase Systems (5.

EE Homework 5 - Solutions

EE 225a Digital Signal Processing Supplementary Material

Problem 1. Suppose we calculate the response of an LTI system to an input signal x(n), using the convolution sum:

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

Z-TRANSFORMS. Solution: Using the definition (5.1.2), we find: for case (b). y(n)= h(n) x(n) Y(z)= H(z)X(z) (convolution) (5.1.

3.1. Determine the z-transform, including the region of convergence, for each of the following sequences: N, N::: n.

Voiced Speech. Unvoiced Speech

GATE EE Topic wise Questions SIGNALS & SYSTEMS

5 Z-Transform and difference equations

Digital Signal Processing

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING FINAL EXAM

Transcription:

The Z-Transform Fall 202, EE2 Digital Signal Processing Lecture 4 September 4, 202 Used for: Analysis of LTI systems Solving di erence equations Determining system stability Finding frequency response of stable systems Fall 202, EE2 Digital Signal Processing Fall 202, EE2 Digital Signal Processing Eigen Functions of LTI System Eigen Functions of LTI System Consider an LTI system with an impulse response h[n]: Consider an LTI system with an impulse response h[n]: We already showed that x[n] =e j!n are eigen-functions. What if x[n] =z n = re j!n We already showed that x[n] =e j!n are eigen-functions. What if x[n] =z n = re j!n Calculate using Convolution: y[n] = = X h[k]z n k= X k= k! h[k]z k z n = H(z)z n Fall 202, EE2 Digital Signal Processing Fall 202, EE2 Digital Signal Processing

Eigen Functions of LTI System The Z Transform x[n] =z n are also eigen-functions of LTI systems. Transfer Function X H(z) = h[n]z n n= Bilateral Z-Transform X x[n]z n n= Since z = re j! X X (z) z=e j! = x[n]e j!n = DT FT {x[n]} n= H(z) exists for larger classs of h[n] thanh(e j! ) Fall 202, EE2 Digital Signal Processing Fall 202, EE2 Digital Signal Processing Example : Right-sided sequence x[n] = a The ROC is the set of values of z for which the sum X X a n z n = (az ) n n=0 n=0 X n= x[n]z n converges. Fall 202, EE2 Digital Signal Processing Fall 202, EE2 Digital Signal Processing

Example : Right-sided sequence x[n] = a X X a n z n = (az ) n Example 2: x[n] = 2 + n=0 n=0 Recall: So, +x + x 2 + = x, if x < az, ROC = {z : z > a } Fall 202, EE2 Digital Signal Processing Fall 202, EE2 Digital Signal Processing Example 2: x[n] = 2 + 2 z + + z Example 2: x[n] = 2 + 2 z + + z ROC = {z : z > 2 } \ {z : z > } = {z : z > 2 } Fall 202, EE2 Digital Signal Processing Fall 202, EE2 Digital Signal Processing

Example : Left-sided sequence x[n] = a n u[ n ] Example : Left-sided sequence x[n] = a n u[ n ] X n= a n z n = X m= a m z m = X (a z) m m=0 Fall 202, EE2 Digital Signal Processing Fall 202, EE2 Digital Signal Processing Example : Left-sided sequence x[n] = a n u[ n ] X n= a n z n = X m= If a z <, i.e., z < a then, a m z m = a z a z = a z = az X (a z) m m=0 Expression X [z] = az the same as Example ROC = {z : z < a } is di erent The Z-transform without ROC does not uniquely define a sequence! Fall 202, EE2 Digital Signal Processing Fall 202, EE2 Digital Signal Processing

Example 4: x[n] = 2 n u[ n ] + Example 4: x[n] = 2 n u[ n ] + 2 z + + z same as example 2 Fall 202, EE2 Digital Signal Processing Fall 202, EE2 Digital Signal Processing Example 4: x[n] = 2 n u[ n ] + 2 z + + z same as example 2 ROC = {z : z < 2 } \ {z : z > } = {z : < z < 2 } Example 5: x[n] = 2 n u[ n ] ROC = {z : z > 2 } \ {z : z < } = 0 Fall 202, EE2 Digital Signal Processing Fall 202, EE2 Digital Signal Processing

Example 5: x[n] = 2 n u[ n ] Example 7: Finite sequence x[n] =a u[ n + M ] ROC = {z : z > 2 } \ {z : z < } = 0 Example 6: x[n] =a n, two sided a 6= 0 ROC = {z : z > a} \ {z : z < a} = 0 Fall 202, EE2 Digital Signal Processing Fall 202, EE2 Digital Signal Processing Example 7: Finite sequence x[n] =a u[ n + M ] X [z] = MX n=0 a n z n Finite, always converges = am z M az zero cancels the pole MY = ( ae j 2 k M z ) k= Example 7: Finite sequence x[n] =a u[ n + M ] X [z] = MX n=0 a n z n Finite, always converges = am z M az zero cancels the pole MY = ( ae j 2 k M z ) k= ROC = {z : z > 0} Fall 202, EE2 Digital Signal Processing Fall 202, EE2 Digital Signal Processing

Properties of the ROC Section.2 A ring or a disk in the Z-plane, centered at the origin 2 DTFT converges i ROC includes the unit circle ROC can t contain poles Fall 202, EE2 Digital Signal Processing Fall 202, EE2 Digital Signal Processing Properties of the ROC Properties of the ROC 4 For finite duration sequences, ROC is the entire Z-plane, except possibly z =0orz = 4 For finite duration sequences, ROC is the entire Z-plane, except possibly z =0orz = +z + z 2 ROC excludes z =0 +z + z 2 ROC excludes z =0 +z + z 2 ROC excludes z = Fall 202, EE2 Digital Signal Processing Fall 202, EE2 Digital Signal Processing

Properties of the ROC Properties of the ROC 5 For right-sided sequences (x[n] =0 8 n < N for some N ) ROC extends outward from the outer-most pole to infinity. Examples,2 5 For right-sided sequences (x[n] =0 8 n < N for some N ) ROC extends outward from the outer-most pole to infinity. Examples,2 6 For left-sided sequences (x[n] =0 8 n > N 2 for some N 2 ) ROC extends inwards from the inner-most pole to zero. Example Fall 202, EE2 Digital Signal Processing Fall 202, EE2 Digital Signal Processing Properties of the ROC Several Properties of the Z Transform 5 For right-sided sequences (x[n] =0 8 n < N for some N ) ROC extends outward from the outer-most pole to infinity. Examples,2 6 For left-sided sequences (x[n] =0 8 n > N 2 for some N 2 ) ROC extends inwards from the inner-most pole to zero. Example 7 For two-sided sequences, ROC is a ring Inner-bound: Pole with largest magnitude that contributes for n > 0 Outer-bound: Pole with smallest magnitude that contributes for n < 0 Examples 4,5,6 x[n n d ] $ z n d X (z) z n 0 x[n] $ X ( z z 0 ) dx (z) nx[n] $ z dz x[ n] $ X (z ) x[n] y[n] $ X (z)y (z) Fall 202, EE2 Digital Signal Processing Fall 202, EE2 Digital Signal Processing

Several Properties of the Z Transform x[n n d ] $ z n d X (z) z n 0 x[n] $ X ( z z 0 ) dx (z) nx[n] $ z dz x[ n] $ X (z ) In general, we can invert by contour integration within the ROC: x[n] = I X (z)z n 2 j Ways to avoid it: Inspection (known transforms) Properties of the Z-transform Power series expansion Partial fraction expansion Residue theorem C x[n] y[n] $ X (z)y (z) ROC at least ROC x \ ROC y Fall 202, EE2 Digital Signal Processing Fall 202, EE2 Digital Signal Processing In general, we can invert by contour integration within the ROC: x[n] = I X (z)z n 2 j C Example: Long division 2+z 2 z, Ways to avoid it: Inspection (known transforms) Properties of the Z-transform Power series expansion Partial fraction expansion Residue theorem Most useful is the inverse of rational polynomials Why? B(z) A(z) Fall 202, EE2 Digital Signal Processing Fall 202, EE2 Digital Signal Processing

Example: Long division 2+z 2 z, ROC = {z : z > 2 } x[n] right/left sequencs? Arrange num/denum in ascending powers of z What about ROC = {z : z < 2 }? Example: Long division 2+z 2 z, ROC = {z : z > 2 } x[n] right/left sequencs? Arrange num/denum in ascending powers of z What about ROC = {z : z < 2 }? 2 z ) 2 + 2z + z 2 + 2 z + 2 + z 2 z 2z 2z z 2 z 2 z 2 2 z 2 z Fall 202, EE2 Digital Signal Processing Fall 202, EE2 Digital Signal Processing Example: Partial Fraction Expansion 2+2z + z 2 + 2 z +... X = x[n]z n n= = = 4 z + 8 z 2 4 z 2 z A 4 z + A 2 2 z x[n] = 2 [n]+2 [n ] + [n 2] + 2 [n ] +... Fall 202, EE2 Digital Signal Processing Fall 202, EE2 Digital Signal Processing

Example: Partial Fraction Expansion = = 4 z + 8 z 2 4 z 2 z A 4 z + A 2 2 z Partial fraction expansion: From the tables: 4 z + 2 2 z Find A and A 2 A = ( A 2 = ( 4 z )X (z) z= 4 2 z )X (z) z= 2 = =2 Fall 202, EE2 Digital Signal Processing Fall 202, EE2 Digital Signal Processing Partial fraction expansion: 4 z + 2 2 z From the tables: apple x[n] = ( 4 )n + 2( 2 ) because right sided Partial fraction expansion in general: b 0 + b z + + b M z M a 0 + a z + + a N z N Suppose real and unrepeated poles d,, d N If M < N, NX k= A k d k z Like example Fall 202, EE2 Digital Signal Processing Fall 202, EE2 Digital Signal Processing

If M N, ) x[n] = XN B r z r + M r=0 M NX k= XN B r [n r]+ r=0 A k d k z NX A k dk k= If M N, ) x[n] = XN B r z r + M r=0 M NX k= XN B r [n r]+ r=0 A k d k z NX A k dk k= If d k is a repeated pole of order S, replace SX m= C m ( d k z ) m A k d k z with Fall 202, EE2 Digital Signal Processing Fall 202, EE2 Digital Signal Processing Example Example +2z + z 2 2 z + 2 z M = N =2 2 A = B 0 + 2 z + A 2 z Matching coe cients: A = 9, A 2 = 8, B 0 =2 +2z + z 2 2 z + 2 z M = N =2 2 A = B 0 + 2 z + A 2 z Matching coe cients: A = 9, A 2 = 8, B 0 =2 ROC = {z : z > } ) x[n] = 2 [n] 9( 2 )+8u[n] Fall 202, EE2 Digital Signal Processing Fall 202, EE2 Digital Signal Processing