Lecture 16: Zeros and Poles

Similar documents
Lecture 18: Stability

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

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

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

Discrete-Time Fourier Transform (DTFT)

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science. Fall Solutions for Problem Set 2

ESE 531: Digital Signal Processing

6.02 Practice Problems: Frequency Response of LTI Systems & Filters

Discrete Time Systems

Lecture 8 Finite Impulse Response Filters

Signals and Systems Lecture 8: Z Transform

Review of Discrete-Time System

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) =

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

ESE 531: Digital Signal Processing

Lecture 7 Discrete Systems

The Z transform (2) 1

Signals and Systems. Lecture 11 Wednesday 22 nd November 2017 DR TANIA STATHAKI

Damped Oscillators (revisited)

Digital Signal Processing

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

1. Determine if each of the following are valid autocorrelation matrices of WSS processes. (Correlation Matrix),R c =

Chapter 8: Frequency Domain Analysis

NAME: ht () 1 2π. Hj0 ( ) dω Find the value of BW for the system having the following impulse response.

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

Lecture 7 - IIR Filters

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

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

EEL3135: Homework #4

ECE-314 Fall 2012 Review Questions for Midterm Examination II

ELEG 305: Digital Signal Processing

Digital Control & Digital Filters. Lectures 1 & 2

Parametric Signal Modeling and Linear Prediction Theory 1. Discrete-time Stochastic Processes (cont d)

Topic 4: The Z Transform

Stability Condition in Terms of the Pole Locations

Transform Analysis of Linear Time-Invariant Systems

Sinusoidal Modeling. Yannis Stylianou SPCC University of Crete, Computer Science Dept., Greece,

EE 521: Instrumentation and Measurements

ECGR4124 Digital Signal Processing Midterm Spring 2010

summable Necessary and sufficient for BIBO stability of an LTI system. Also see poles.

ELEG 305: Digital Signal Processing

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

Frequency-Domain C/S of LTI Systems

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

6.003: Signals and Systems

Chap 2. Discrete-Time Signals and Systems

Digital Filters Ying Sun

ECE 8440 Unit 13 Sec0on Effects of Round- Off Noise in Digital Filters

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

Practical Spectral Estimation

ECE503: Digital Signal Processing Lecture 5

CITY UNIVERSITY LONDON. MSc in Information Engineering DIGITAL SIGNAL PROCESSING EPM746

Solutions: Homework Set # 5

Digital Signal Processing. Midterm 1 Solution

Very useful for designing and analyzing signal processing systems

CMPT 889: Lecture 5 Filters

Digital Filters. Linearity and Time Invariance. Linear Time-Invariant (LTI) Filters: CMPT 889: Lecture 5 Filters

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

Discrete-Time David Johns and Ken Martin University of Toronto

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

Review of Frequency Domain Fourier Series: Continuous periodic frequency components

Solutions. Number of Problems: 10

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

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

EE482: Digital Signal Processing Applications

ENEE630 ADSP RECITATION 5 w/ solution Ver

CMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation

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

ECG SIGNAL FILTERING 6

Lecture 4: FT Pairs, Random Signals and z-transform

Sinusoidal steady-state analysis

The Convolution Sum for Discrete-Time LTI Systems

EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 19, Cover Sheet

Poles and Zeros in z-plane

EE538 Final Exam Fall 2007 Mon, Dec 10, 8-10 am RHPH 127 Dec. 10, Cover Sheet

A.1 THE SAMPLED TIME DOMAIN AND THE Z TRANSFORM. 0 δ(t)dt = 1, (A.1) δ(t)dt =

Lecture 13: Discrete Time Fourier Transform (DTFT)

Lecture 14: Minimum Phase Systems and Linear Phase

SOLUTIONS to ECE 2026 Summer 2017 Problem Set #2

EE40 Lecture 11 Josh Hug 7/19/2010

Problem Value

ESE 531: Digital Signal Processing

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

LECTURE 13 Introduction to Filtering

ECE503: Digital Signal Processing Lecture 4

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

Methods for Synthesizing Very High Q Parametrically Well Behaved Two Pole Filters

Topics: Discrete transforms; 1 and 2D Filters, sampling, and scanning

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.

Fourier Analysis of Signals Using the DFT

Lecture 9: Space-Vector Models

Sinusoidal Steady-State Analysis

Ch. 7: Z-transform Reading

Detailed Solutions to Exercises

VI. Z Transform and DT System Analysis

EE 123: Digital Signal Processing Spring Lecture 23 April 10

Analog vs. discrete signals

SIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals

EECE 301 Signals & Systems Prof. Mark Fowler

PS403 - Digital Signal processing

Transcription:

Lecture 16: Zeros and Poles ECE 401: Signal and Image Analysis University of Illinois 4/6/2017

1 Poles and Zeros at DC 2 Poles and Zeros with Nonzero Bandwidth 3 Poles and Zeros with Nonzero Center Frequency 4 Notch Filter

Outline 1 Poles and Zeros at DC 2 Poles and Zeros with Nonzero Bandwidth 3 Poles and Zeros with Nonzero Center Frequency 4 Notch Filter

Z Transform of a Unit Step What s the Z transform of Let s find out: U(z) = This corresponds to u[n] = n= { 1 n 0 0 otherwise u[n]z n = U(ω) = n= 1 1 e jω z n = 1 1 z 1 Notice that when ω = 0, U(ω) = 1/(1 1) = 1/0 =. We say U(z) has a pole at ω = 0.

Filter with a Zero at DC Consider the following filter: y[n] = x[n] x[n 1] Y (z) = X (z) z 1 X (z) = (1 z 1 )X (z) H(z) = 1 z 1, H(ω) = 1 e jω Notice that when ω = 0, H(ω) = 0. We say that H(z) has a zero at ω = 0.

Pole-Zero Cancellation What happens when a pole meets a zero? Let s find out. Let s put x[n] = u[n] into y[n] = u[n] u[n 1] U(z) = 1 1 z 1, H(z) = (1 z 1 ) Y (z) = H(z)U(z) = 1 z 1 1 z 1 = 1 So y[n] is the inverse Z-transform of Y (z) = 1, which is y[n] = δ[n]....but we could have figured that out directly from the system equation!

A Filter with a Pole Let s find the transfer function for this system: y[n] = x[n] + y[n 1] Y (z) = X (z) + z 1 Y (z) Y (z)(1 z 1 ) = X (z) H(z) = Y (z) X (z) = 1 1 z 1 So this is a transfer function with a pole at ω = 0!

Pole-Pole Coincidence What happens when a pole in the input (X (z)) meets a pole in the transfer function (H(z))? Let s use u[n] as the input to this system: y[n] = u[n] + y[n 1] By plugging u[n] into that equation directly, we discover that y[n] = (n + 1)u[n]...which is almost certainly a very bad thing, because it grows without bound (we sometimes say it is unbounded or it goes to infinity ). The Z transform is: Y (z) = 1 1 z 1 U(z) = 1 (1 z 1 ) 2 So it has two poles at ω = 0. We have learned that when Y (z) has two poles at the same frequency, then y[n] goes to infinity.

Summary so far: Poles and Zeros When X (z) has a pole at some frequency, and H(z) has a zero at the same frequency (or vice versa!!), then the pole and zero cancel. When X (z) and H(z) both have poles at the same frequency, then y[n] goes to infinity.

Summary so far: Useful Z Transform Pairs y[n] Y (z) Zeros Poles δ[n] δ[n 1] (1 z 1 ) One at ω = 0 None δ[n] 1 None None 1 u[n] (1 z 1 ) None One at ω = 0 1 (n + 1)u[n] (1 z 1 ) 2 None Two at ω = 0

Outline 1 Poles and Zeros at DC 2 Poles and Zeros with Nonzero Bandwidth 3 Poles and Zeros with Nonzero Center Frequency 4 Notch Filter

Z Transform of an Exponential What s the Z transform of Let s find out: X (z) = x[n] = e Bn u[n] = n= This corresponds to U(ω) = x[n]z n = { e Bn n 0 0 otherwise n= e Bn z n 1 1 e B z 1 1 1 e (B+jω) ; U(0) = 1 1 e B, U(B) = 1 1 e B(1+j) 1 B 2 We say that this signal has a pole of bandwidth B at ω = 0.

Filter with a Zero at DC Consider the following filter: y[n] = x[n] e B x[n 1] Y (z) = X (z) e B z 1 X (z) = (1 e B z 1 )X (z) H(z) = 1 e B z 1, H(ω) = 1 e (B+jω) We say that H(z) has a zero of bandwidth B at ω = 0.

Pole-Zero Cancellation What happens when a pole meets a zero? Let s find out. Let s put x[n] = e Bn u[n] into U(z) = y[n] = x[n] e B x[n 1] 1 1 e B z 1, H(z) = (1 e B z 1 ) Y (z) = H(z)U(z) = 1 e B z 1 1 e B z 1 = 1 So y[n] is the inverse Z-transform of Y (z) = 1, which is y[n] = δ[n]....but we could have figured that out directly from the system equation!

A Filter with a Pole Let s find the transfer function for this system: y[n] = x[n] + e B y[n 1] Y (z) = X (z) + e B z 1 Y (z) Y (z)(1 e B z 1 ) = X (z) H(z) = Y (z) X (z) = 1 1 e B z 1 So this is a transfer function with a pole of bandwidth B at ω = 0!

Pole-Pole Coincidence What happens when a pole in the input (X (z)) meets a pole in the transfer function (H(z))? Let s use e Bn u[n] as the input to this system: y[n] = u[n] + e B y[n 1] By plugging u[n] into that equation directly, we discover that y[n] = (n + 1)e Bn u[n] This is OK, as long as B > 0. As long as B > 0, the output y[n] will rise and then fall again. The Z transform is: Y (z) = 1 1 e B z 1 U(z) = 1 (1 e B z 1 ) 2 So it has two poles with bandwidth B at ω = 0. We have learned that when a pole has positive bandwidth, then y[n] doesn t go to infinity.

Summary so far: Poles and Zeros When X (z) has a pole at some frequency, and H(z) has a zero at the same frequency with the same bandwidth, then the pole and zero cancel. When X (z) and H(z) both have poles at the same frequency but with positive bandwidth, then y[n] doesn t go to infinity; it rises, then falls again.

Summary so far: Useful Z Transform Pairs y[n] Y (z) Zeros Poles δ[n] e B δ[n 1] (1 e B z 1 ) ω = 0, BW=B None δ[n] 1 None None e Bn 1 u[n] (1 e B z 1 ) None ω = 0, BW=B 1 (n + 1)u[n] (1 e B z 1 ) 2 None Two at ω = 0, BW=B

Outline 1 Poles and Zeros at DC 2 Poles and Zeros with Nonzero Bandwidth 3 Poles and Zeros with Nonzero Center Frequency 4 Notch Filter

Z Transform of a Sinusoid What s the Z transform of Let s find out: X (z) = x[n] = cos(θn)u[n] = n= This corresponds to x[n]z n = 1 2 { cos(θn) n 0 0 otherwise n= e jθn z n + 1 2 n= U(ω) = 1 1 2 1 e j(ω+θ) + 1 1 2 1 e j(ω θ) e jθn z n Notice that U(ω) = 1 0 poles at ω = ±θ = when ω = ±θ. We say that U(z) has

Filter with a Zero at DC Consider the following filter: y[n] = x[n] e jθ x[n 1] Y (z) = X (z) e jθ z 1 X (z) = (1 e jθ z 1 )X (z) H(z) = 1 e jθ z 1, H(ω) = 1 e j(ω θ)) We say that H(z) has a zero at ω = θ.

Pole-Zero Cancellation What happens when a pole meets a zero? Let s find out. Let s put x[n] = e jθn u[n] into X (z) = y[n] = x[n] e jθ x[n 1] 1 1 e jθ z 1, H(z) = (1 ejθ z 1 ) Y (z) = H(z)X (z) = 1 ejθ z 1 1 e jθ z 1 = 1 So y[n] is the inverse Z-transform of Y (z) = 1, which is y[n] = δ[n]....but we could have figured that out directly from the system equation!

A Filter with a Pole Let s find the transfer function for this system: y[n] = x[n] + e jθ y[n 1] Y (z) = X (z) + e jθ z 1 Y (z) Y (z)(1 e jθ z 1 ) = X (z) H(z) = Y (z) X (z) = 1 1 e jθ z 1 So this is a transfer function with a pole of zero bandwidth B at ω = θ!

Pole-Pole Coincidence What happens when a pole in the input (X (z)) meets a pole in the transfer function (H(z))? Let s use x[n] = e jθn u[n] as the input to this system: y[n] = x[n] + e jθ y[n 1] By plugging x[n] into that equation directly, we discover that y[n] = (n + 1)e jθn u[n] This is a very bad thing, because e jθn = 1. Therefore the magnitude of y[n] is y[n] = (n + 1), which goes to infinity. The Z transform is: Y (z) = 1 1 e jθ z 1 X (z) = 1 (1 e jθ z 1 ) 2 So it has two poles with zero bandwidth at ω = θ. We have learned that when Y (z) has two poles of zero bandwidth, at any center frequency ω = θ, then y[n] goes to infinity.

Summary so far: Poles and Zeros When X (z) has a pole at some frequency, and H(z) has a zero at the same frequency, then the pole and zero cancel. When X (z) and H(z) both have poles at the same frequency with zero bandwidth, then y[n] goes to infinity.

Summary so far: Useful Z Transform Pairs y[n] Y (z) Zeros Poles δ[n] e jθ δ[n 1] (1 e jθ z 1 ) ω = θ, BW=0 None δ[n] 1 None None e jθn 1 u[n] (1 e jθ z 1 ) None ω = θ, BW=0 (n + 1)e jθn 1 u[n] (1 e jθ z 1 ) 2 None Two at ω = θ, BW=0

Outline 1 Poles and Zeros at DC 2 Poles and Zeros with Nonzero Bandwidth 3 Poles and Zeros with Nonzero Center Frequency 4 Notch Filter

Narrowband Noise Suppose our measurement, x[n], includes a desired signal, s[n], that has been corrupted by narrowband noise v[n]: x[n] = s[n] + v[n] Where v[n] is a cosine at a known frequency ω = θ, but with unknown phase φ, and unknown amplitude A: v[n] = A cos (θn + φ) V (z) = A ( e jφ 2 1 e jθ z 1 + e jφ ) 1 e jθ z 1 We call v[n] a narrowband noise, because V (z) = at ω = ±θ, and V (z) is small or zero at all other frequencies.

Noise Removal We want to design an LCCDE that will get rid of the noise. In other words, we want to find coefficients a m and b m so that y[n] = M 1 m=0 b m x[n m] + N 1 m=0 a m y[n m] and y[n] s[n]

Noise Removal Let s put it in the Z transform domain: where Y (z) = H(z)X (z) = H(z)S(z) + H(z)V (z) H(z) = We want to design H(z) so that: M 1 m=0 b mz m 1 N 1 m=0 a mz m h[n] v[n] = 0 for all n > 0. For example, we can design it so that h[n] v[n] = δ[n] by using pole-zero cancellation. H(z)S(z) S(z).

Part One: the Zeros First, let s find V (z). = Aejφ 2 V (z) = n=0 A cos (θn + φ) z n n=0 e jθn z n + Ae jφ 2 e jθn z n n=0 = Aejφ /2 1 e jθ z 1 + Ae jφ /2 1 e jθ z 1

Part One: the Zeros V (z) = Aejφ /2 1 e jθ z 1 + Ae jφ /2 1 e jθ z 1 We can cancel these two poles by using zeros: H(z) = (1 ejθ z 1 )(1 e jθ z 1 ) something So that, right at the two frequencies ω = ±θ, H(z) = 0, and therefore, right at those two noise frequencies, Y (z) = 0.

Part Two: The Poles Recall that we want H(z) = 0 right at ω = θ, but at all other frequencies, we want H(z)S(z) S(z). In other words, at all frequencies other than ω = θ, we want H(z) 1. This can be done by giving H(z) a pair of poles at exactly the same frequency, but with small positive bandwidth: H(z) = This has the following properties: (1 e jθ z 1 )(1 e jθ z 1 ) (1 e B+jθ z 1 )(1 e B jθ z 1 ) Right at ω = ±θ, the numerator ensures that H(z) = 0 exactly. At frequencies such that ω θ B, the numerator and denominator cancel each other out, so that H(z) 1.

The LCCDE Let s turn it into an LCCDE. H(z) = So the LCCDE is: H(z) = (1 e jθ z 1 )(1 e jθ z 1 ) (1 e B+jθ z 1 )(1 e B jθ z 1 ) 1 2 cos θz 1 + z 2 1 2e B cos θz 1 + e 2B z 2 y[n] = x[n] 2 cos θx[n 1]+x[n 2]+2e B cos θy[n 1] e 2B y[n 2]