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

Similar documents
ELEG 305: Digital Signal Processing

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

6.003: Signals and Systems

Need for transformation?

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)

Solutions: Homework Set # 5

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

ECE503: Digital Signal Processing Lecture 4

Signals and Systems Lecture 8: Z Transform

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. Problem Set: The z-transform and DT Fourier Transform

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

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

Very useful for designing and analyzing signal processing systems

z-transform Chapter 6

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

Z Transform (Part - II)

SEL4223 Digital Signal Processing. Inverse Z-Transform. Musa Mohd Mokji

Review of Discrete-Time System

University of Illinois at Urbana-Champaign ECE 310: Digital Signal Processing

DIGITAL SIGNAL PROCESSING. Chapter 3 z-transform

ESE 531: Digital Signal Processing

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ω

Signal Analysis, Systems, Transforms

Z-Transform. x (n) Sampler

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

Discrete Time Systems

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

ESE 531: Digital Signal Processing

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

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

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.

Discrete-Time Fourier Transform (DTFT)

21.4. Engineering Applications of z-transforms. Introduction. Prerequisites. Learning Outcomes

Discrete Time Systems

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

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

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

Lecture 14: Minimum Phase Systems and Linear Phase

Topic 4: The Z Transform

The Z transform (2) 1

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

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 )

VI. Z Transform and DT System Analysis

EEL3135: Homework #4

EC 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).

# 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.

SIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals

Digital Signal Processing

The z-transform Part 2

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

ECE503: Digital Signal Processing Lecture 5

Digital Filters Ying Sun

Module 4 : Laplace and Z Transform Problem Set 4

Lecture 19 IIR Filters

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

Chapter 7: The z-transform

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

Signals & Systems Handout #4

Lecture 18: Stability

Modeling and Analysis of Systems Lecture #8 - Transfer Function. Guillaume Drion Academic year

Lecture 2 OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE

Digital Signal Processing:

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

The z-transform and Discrete-Time LTI Systems

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

Discrete-Time David Johns and Ken Martin University of Toronto

EE Homework 5 - Solutions

Lecture 7 Discrete Systems

Transform Analysis of Linear Time-Invariant Systems

Lecture 8 - IIR Filters (II)

EE102B Signal Processing and Linear Systems II. Solutions to Problem Set Nine Spring Quarter

Digital Signal Processing Lecture 3 - Discrete-Time Systems

Damped Oscillators (revisited)

Digital Control & Digital Filters. Lectures 1 & 2

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION

Digital Signal Processing. Midterm 1 Solution

Digital Signal Processing: Signal Transforms

2.161 Signal Processing: Continuous and Discrete Fall 2008

EE 521: Instrumentation and Measurements

E : Lecture 1 Introduction

( ) John A. Quinn Lecture. ESE 531: Digital Signal Processing. Lecture Outline. Frequency Response of LTI System. Example: Zero on Real Axis

Recursive, Infinite Impulse Response (IIR) Digital Filters:

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

Review of Fundamentals of Digital Signal Processing

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

Discrete-time signals and systems

1. Z-transform: Initial value theorem for causal signal. = u(0) + u(1)z 1 + u(2)z 2 +

Digital Signal Processing

EE480.3 Digital Control Systems. Part 2. z-transform

ELEG 305: Digital Signal Processing

2.161 Signal Processing: Continuous and Discrete Fall 2008

Fourier Series and Fourier Transforms

From Wikipedia, the free encyclopedia

信號與系統 Signals and Systems

Question Paper Code : AEC11T02

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

Stability Condition in Terms of the Pole Locations

56 CHAPTER 3. POLYNOMIAL FUNCTIONS

Transcription:

Lecture 04: Discrete Frequency Domain Analysis (z-transform) John Chiverton School of Information Technology Mae Fah Luang University 1st Semester 2009/ 2552

Outline Overview Lecture Contents Introduction z-transform Time Delays in z-transform Representations The Inverse z-transform Stability BIBO Stability

Lecture Contents Overview Lecture Contents Introduction z-transform Time Delays in z-transform Representations The Inverse z-transform Stability BIBO Stability

Outline Overview Lecture Contents Introduction z-transform Time Delays in z-transform Representations The Inverse z-transform Stability BIBO Stability

Introduction to the z-transform The z-transform Transforms a digital signal to a frequency respresentation Used for stability analysis using the poles and zeros Also used for frequency analysis

Outline Overview Lecture Contents Introduction z-transform Time Delays in z-transform Representations The Inverse z-transform Stability BIBO Stability

z-transform Two z-transforms are common in digital signal processing. The one-sided or unilateral z-transform: X(z) = and the bilateral z-transform: X(z) = x[n]z n n=0 n= x[n]z n. The one-sided transform is considered here only.

z-transform Example Q. Find the z-transform of a step function: A. j 1 for n 0 x[n] = 0 elsewhere X X X(z) = x[n]z n = z n n=0 This is a geometric series of the form: where a = 1 and r = z 1 so that n=0 =(z 0 + z 1 + z 2 + z 3 + z 4 +...) = 1 + 1 z + 1 z 2 + 1 z 3 + 1 «z 4 +... s = X(z) = X ar k = a 1 r k=0 1 1 z 1 = z z 1.

z-transform Example Q. Find the z-transform of a square pulse: A. X(z) = j 0.2 for 0 n < 5 x[n] = 0 elsewhere X x[n]z n = 0.2 n=0 This is a geometric series of the form: where a = 0.2, n = 5 and r = z 1 so that 4X z n n=0 =0.2(z 0 + z 1 + z 2 + z 3 + z 4 ) =0.2 1 + 1 z + 1 z 2 + 1 z 3 + 1 «z 4 n 1 X s = ar k = a 1 rn 1 r k=0 X(z) = 0.2 1 z 5 1 z 1 = 0.2 z5 1 z 5 z 4 = 0.2 z5 1 z 4 (z 1).

Time delays in z-transform Representations Each z 1 in a z-transform can be considered as a single time delay. Consider the time-shifted or delayed unit impulse: then the z-transform is given by: X(z) = x[n] = δ[n τ] δ[n τ]z n = z τ n=0 indicating a delay of τ samples.

The z-transform and Time Delay Example Q. Find the signal corresponding to the z-transform: X(z) = z z 0.5. P A. Remember the geometric series formula: s = ar k = a. Need to find the form 1 r k=0 of X(z) to easily find r and a... Dividing the numerator and denominator by z gives So that r = 0.5z 1 and a = 1 then X(z) = 1 1 0.5z 1. X 1 k X(z) = `0.5z = 1 + 0.5z 1 + (0.5z 1 ) 2 + (0.5z 1 ) 3 + (0.5z 1 ) 4 +... k=0 =1 + 0.5z 1 + 0.25z 2 + 0.125z 1 + 0.0625z 4 +... Remembering that each z 1 is a delay of 1 time instance, the signal x[n] is then given by the coefficients for each time instance, i.e. x[0] = 1, x[1] = 0.5, x[2] = 0.25, x[3] = 0.125, x[4] = 0.0625 etc.

The z-transform and Time Delay Example 2 Q. Find the signal corresponding to the z-transform: X(z) = z2 0.2 z(z 0.2) A. Remember the geometric series formula: s = n 1 P ar k = a 1 rn. Need to find the 1 r k=0 form of X(z) to easily find r, a and n... Dividing through by z 2 gives X(z) = 1 0.2z 2 1 0.2z 1. So that r = 0.2z 1, a = 1 and n = 2 resulting in: n 1 X X(z) = ar k = k=0 1X (0.2z 1 ) k = 1 + 0.2z 1. k=0 Therefore the original signal, x[n] is given by x[0] = 1 and x[1] = 0.2.

Outline Overview Lecture Contents Introduction z-transform Time Delays in z-transform Representations The Inverse z-transform Stability BIBO Stability

The Inverse z-transform The inverse z-transform Z 1 (X(z)) is given by x[n] = Z 1 (X(z)) = 1 X(z)z n 1 dz 2πj The inverse z-transform is not usually computed directly. Instead the z-transform is split into parts using partial fractions And then the inverse z-transform of the parts are found using a table of z-transform pairs.

Table of (unilateral) z-transform Pairs Lynn and Fuerst give the following table of z-transform pairs: Signal x[n] z-transform X(z) δ[n] j 1 1 for n 0 z u[n] = 0 elsewhere z 1 j n for n 0 z r[n] = 0 elsewhere (z 1) 2 a n z u[n] z a (1 a n z(1 a) )u[n] cos(nω 0)u[n] sin(nω 0)u[n] (z a)(z 1) z(z cos(ω 0 ) z 2 2z cos(ω 0 )+1 z sin(ω 0 ) z 2 2z cos(ω 0 )+1 az sin(ω 0 ) z 2 2az cos(ω 0 )+a 2 a n sin(nω 0)u[n] The z-transform representation has therefore to be separated using partial fractions into parts, each of the form of the expressions on the right hand side of the above table.

Method of Partial Fractions Example Q. Decompose the following function into partial fractions: 1 (z + 3)(z 2). A. Let Then So that 1 (z + 3)(z 2) = A z + 3 + B z 2. A(z 2) + B(z + 3) = 1. Az 2A + Bz + 3B = 1 z(a + B) 2A + 3B = 1 Therefore z(a + B) = 0 A = B and 2A + 3B = 1 so that 2A 3A = 1 giving A = 1 5 and B = 1 5. Check: A z + 3 + B z 2 = 1 5 z + 3 + 1 5 1 z 2 = 5 (5) (z + 3)(z + 2) = 1 (z + 3)(z + 2)

Method of Partial Fractions: Cover up method Example Q. Decompose the following function into partial fractions: A. Let z (z + 3)(z 2). z (z+3)(z 2) = A z+3 + B. To find A z + 3 = 0 z = 3. z 2 A = To find B z 2 = 0 z = 2. B = z = 3 (z + 3)(z 2) z= 3 3 2 = 3 5. z = 2 (z + 3)(z 2) z=2 2 + 3 = 2 5. Hence Check: 3 2 z (z + 3)(z 2) = 5 z + 3 + 5 z 2. 3 2 3 5 z + 3 + 5 z 2 = 5 (z 2) + 2 (z + 3) 5 = (z + 3)(z 2) 3 5 z 6 5 + 2 5 z + 6 5 (z + 3)(z 2) = z (z + 3)(z 2).

Inverse z-transform Example Q. Find the inverse z-transform of: X(z) = 1 (z + 3)(z 2) = 1 1 5 z 2 1 «. (1) z + 3 A. Re-writing (1) to X(z) = z 1 5 z z 2 z «. (2) z + 3 Enables us to find inverse z-transforms for the two terms inside the brackets: «z Z 1 = 2 n u[n] z 2 and Z 1 z «= (( 3) n )u[n]. z + 3 The two terms are multiplied by z 1 which is equivalent to a time delay hence the final signal is given by: x[n] = Z 1 (X(z)) = 1 5 2 (n 1) u[n 1] (( 3) (n 1) )u[n 1].

Inverse z-transform Example Q. Find the inverse z-transform of: X(z) = z (z + 3)(z 2). z A. From earlier the partial fraction expansion is given by: (z+3)(z 2) = 3 5 z+3 + 2 5 z 2. (i) However it is more convenient if we divide both sides by z first. Hence (ii) We saw earlier: «X(z) 1 z = z (z + 3)(z 2). Z 1 = 2 n u[n] z 2 The Right Hand Side (RHS) has partial fractions (see earlier slide): X(z) z = 1 1 5 z + 3 + 5 z 2. and Z 1 z «= (( 3) n )u[n] z + 3 so that Multiplying both sides by z then gives: X(z) = 1 5 z z + 3 + z «. z 2 x[n] =Z 1 (X(z)) = 1 2 (n) u[n] (( 3) (n) )u[n]. 5

Inverse z-transform: Algebraic Long Division The numerator and the denominator of the z-transform can be divided using algebraic long division to find coefficients that correspond to the original signal. Example Q. Given H(z) = z (z 1)(z+2) = z z 2, determine the coefficients. +z 2 A. Via algebraic or polynomial long division: z 2 + z 2 z z 1 z 2 + 3z 3 5z 4... z + 1 2z 1 1 + 2z 1 1 z 1 + 2z 2 3z 1 2z 2 3z 1 + 3z 2 5z 3 5z 2 + 5z 3... So the coefficients of the original signal are given by: x[0] = 0, x[1] = 1, x[2] = 1, x[3] = 3, x[4] = 5, etc. This can be checked by performing the inverse z-transform on H(z). Expansion with partial fractions gives: H(z) = 1 z 3 z 1 z z+2 Inverse z-transform: x[n] = Z 1 (H(z)) = 1 3 (u[n] ( 2)n u[n]) Then x[0] = 1 (1 1) = 0, 3 x[1] = 1 (1 + 2) = 1, 3 x[2] = 1 (1 4) = 1, 3 x[3] = 1 (1 + 8) = 3, 3 x[4] = 1 3 (1 15) = 5, etc. This confirms the long division result.

Inverse z-transform Example Q. Find the inverse z-transform of: X(z) = 0.5z z 2 z + 0.5 (3) A. The table of z-transform pairs has the following definition: «Z 1 az sin(ω 0 ) (z 2 2az cos(ω 0 ) + a 2 = a n sin(nω 0 )u[n]. (4) ) Therefore we can try to equate the terms inside (4) and (3). In the numerator: a sin(ω 0 ) = 0.5, and in the denominator a 2 = 0.5 a = 0.5, then sin(ω 0 ) = 0.5/ 0.5, Ω 0 = sin 1 (0.5/ 0.5) = π 4. We can therefore plug these values into the result of (4) to find the inverse z-transform of (3): «x[n] = Z 1 0.5z z 2 = ( 0.5) n sin(nπ/4)u[n]. z + 0.5

Outline Overview Lecture Contents Introduction z-transform Time Delays in z-transform Representations The Inverse z-transform Stability BIBO Stability

BIBO Stability A linear system is said to be stable if it has: A Bounded Output for A Bounded Input Bounded means the signal does not exceed a particular value. System stability is expressed using a function of the impulse response h[n] of the system: X h[n] < (5) where h[n] is the absolute value of h[n]. i.e. h[n] = h[n]. Equation (5) states that the sum across all values of the impulse function should be smaller than infinity ( ). This ensures that the system is bounded and will not be larger than infinity for some input If equation (5) is true then the system can be described as being BIBO stable. A system is not usually very useful if it goes to ±infinity.

z-transform and Stability The z-transform can be used to determine if a system is stable. The z-transform results in a rational function consisting of a numerator N(z) and a denominator D(z) X(z) can be A system input A system output A system transfer function X(z) = N(z) D(z) The stability of X(z) can be found by the roots of N(z) and D(z): X(z) = N(z) K(z z1)(z z2)(z z3)... = D(z) (z p 1)(z p 2)(z p 3)...

z-transform and Stability X(z) = N(z) D(z) = K(z z 1)(z z 2 )(z z 3 )... (z p 1 )(z p 2 )(z p 3 )... The roots of the numerator are z 1, z 2, z 3... known as zeros The roots of the denominator are p 1, p 2, p 3... known as poles The zeros are values of z that make X(z) 0 e.g. if z = z 1 then X(z = z 1 ) = N(z = z 1) D(z = z 1 ) = K(z 1 z 1 )(z 1 z 2 )(z 1 z 3 )... (z 1 p 1 )(z 1 p 2 )(z 1 p 3 )... = K 0 (z 1 z 2 )(z 1 z 3 )... (z 1 p 1 )(z 1 p 2 )(z 1 p 3 )... = 0 The poles are values of z that make X(z) e.g. if z = p 1 then X(z = p 1 ) = N 1 = K(p 1 z 1 )(p 1 z 2 )(p 1 z 3 )... D 1 (p 1 p 1 )(p 1 p 2 )(p 1 p 3 )... = K(p 1 z 1 )(p 1 z 2 )(p 1 z 3 )... 0 (p 1 p 2 )(p 1 p 3 )... = K... 0 =

z-transform and Stability: z-plane A z-transform can be represented graphically with the z-plane. The z-plane is complex (a + jb) where j = 1 The vertical axis ( ) is imaginary (b) The horizontal axis ( ) is real (a) The z-plane is also known as an Argand diagram

z-transform and Stability: z-plane X(z) = N(z) D(z) = K(z z 1)(z z 2 )(z z 3 )... (z p 1 )(z p 2 )(z p 3 )... Each zero: z 1, z 2, z 3,... is represented by a circle: O Each pole: p 1, p 2, p 3,... is represented by a cross: X e.g. X(z) = then z 1 (z+0.5)(z 0.4) z1 = 1 + 0j p1 = 0.5 + 0j p 2 = 0.4 + 0j

z-transform and Stability: z-plane Stability is determined by the location of the poles in the z-plane. Example H(z) = Y (z) X(z) = 1 (z a) From the table of z-transform pairs: ( ) Z 1 z z a = a n u[n] ( ) let H(z) = z 1 z z a z 1 is a unit delay hence: x[n] = a n 1 u[n 1] So that x[0] = 0, x[1] = 1, x[2] = a, x[3] = a 2, x[4] = a 3 etc.

z-transform and Stability: z-plane x[n] = a n 1 u[n 1] x[0] = 0, x[1] = 1, x[2] = a, x[3] = a 2, x[4] = a 3 etc. If a = 0.99 Decreasing and tending to zero (x[n] 0) when a < 1

z-transform and Stability: z-plane x[n] = a n 1 u[n 1] x[0] = 0, x[1] = 1, x[2] = a, x[3] = a 2, x[4] = a 3 etc. If a = 1.01 Increasing and tending to infinity (x[n] ) when a > 1

z-transform and Stability: z-plane x[n] = a n 1 u[n 1] Decreasing and tending to zero (x[n] 0) when a < 1 Increasing and tending to infinity (x[n] ) when a > 1 These observations are true more generally: X(z) = N(z) D(z) = K(z z 1)(z z 2 )(z z 3 )... (z p 1 )(z p 2 )(z p 3 )... If the magnitude of any pole (p i ) is greater than 1 then the system will tend to infinity. A unit circle is drawn on the z-plane. If any pole is outside of the unit circle then the system is not stable.

z-plane and Stability: Magnitude Example If the magnitude of any pole (p i ) is greater than 1 then the system will tend to infinity. Q. Determine whether the following system is stable: H(z) = 1 (z 0.7 + 0.8j)(z 0.7 0.8j) A. The system has two poles at: p 1 = 0.7 0.8j and p 2 = 0.7 + 0.8j. The distance from the origin of these poles is given by the magnitude: r = p 0.7 2 + 0.8 2 = 1.063 > 1. These poles are beyond the unit circle, therefore this system is not stable.

z-plane and Stability: Magnitude Example Q. Determine whether the following system is stable: H(z) = 1 (z 0.5 0.5j)(z 0.5 + 0.5j) A. The system has two poles at: p 1 = 0.5 + 0.5j and p 2 = 0.5 0.5j The distance from the origin of these poles is given by the magnitude: r = p 0.5 2 + 0.5 2 = 0.707 < 1. These poles are inside the unit circle, therefore this system is stable.

z-plane and The Zeros The z-plane zeros: Do not determine stability: They can be located anywhere in the z-plane without directly affecting stability If a zero is located at the origin then there is a time advance of a signal If there are more zeros than poles then the system starts before n = 0 and is therefore not causal It is usually desirable to have the same number of poles and zeros in a system to: Ensure minimum delay or time lag Ensure the system is causal

z-plane and The Zeros Example The inverse z-transform of: H(z) = 1 z 0.4 = z 1 ( z ) z 0.4 is given by (using the table of z-transform pairs): x[n] = 0.4 n 1 u[n 1], which has a delay of 1 time interval. If we provide H(z) with a zero at the origin (i.e. z 1 = 0) so that: H(z) = z z 1 z 0.4 = then the inverse z-transform is given by: which has no time delay. x[n] = 0.4 n u[n], z z 0.4

Lecture Summary Today s lecture has covered: The z-transform The inverse z-transform Stability analysis using the z-plane Partial fractions The z-transform and time delays