Chapter 7: The z-transform

Similar documents
Chapter 13 Z Transform

Digital Signal Processing Lecture 3 - Discrete-Time Systems

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)

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

Digital Signal Processing

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

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

The Z transform (2) 1

Signals & Systems Handout #4

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

Signals and Systems Lecture 8: Z Transform

Very useful for designing and analyzing signal processing systems

Generalizing the DTFT!

SIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals

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

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 )

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

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

ESE 531: Digital Signal Processing

Topic 4: The Z Transform

6.003: Signals and Systems

7.17. Determine the z-transform and ROC for the following time signals: Sketch the ROC, poles, and zeros in the z-plane. X(z) = x[n]z n.

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

ECE 3620: Laplace Transforms: Chapter 3:

ESE 531: Digital Signal Processing

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

Digital Signal Processing. Midterm 1 Solution

Chap 2. Discrete-Time Signals and Systems

ECE503: Digital Signal Processing Lecture 4

Chapter 6: The Laplace Transform. Chih-Wei Liu

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

Frequency-Domain C/S of LTI Systems

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

Analog vs. discrete signals

Digital Signal Processing Lecture 4

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

DIGITAL SIGNAL PROCESSING. Chapter 3 z-transform

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ω

If every Bounded Input produces Bounded Output, system is externally stable equivalently, system is BIBO stable

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

EC Signals and Systems

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

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

Discrete-Time Fourier Transform (DTFT)

ECE-314 Fall 2012 Review Questions for Midterm Examination II

Stability Condition in Terms of the Pole Locations

ELC 4351: Digital Signal Processing

3.2 Complex Sinusoids and Frequency Response of LTI Systems

Definition of the Laplace transform. 0 x(t)e st dt

ECE 301 Division 1, Fall 2008 Instructor: Mimi Boutin Final Examination Instructions:

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

ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin

Lecture 3 January 23

VU Signal and Image Processing

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

ELEG 305: Digital Signal Processing

Need for transformation?

2.161 Signal Processing: Continuous and Discrete Fall 2008

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

Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is

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

Discrete-time signals and systems

Review of Fundamentals of Digital Signal Processing

The Laplace Transform

Digital Signal Processing

Digital Signal Processing, Homework 1, Spring 2013, Prof. C.D. Chung

Signals and Systems. VTU Edusat program. By Dr. Uma Mudenagudi Department of Electronics and Communication BVCET, Hubli

Discrete Time Systems

EE 521: Instrumentation and Measurements

VI. Z Transform and DT System Analysis

Each problem is worth 25 points, and you may solve the problems in any order.

ECE 301 Division 1, Fall 2006 Instructor: Mimi Boutin Final Examination

Multidimensional digital signal processing

The z-transform Part 2

A system that is both linear and time-invariant is called linear time-invariant (LTI).

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

PROBLEM SET 3. Note: This problem set is a little shorter than usual because we have not covered inverse z-transforms yet.

Module 4 : Laplace and Z Transform Problem Set 4

Definition of Discrete-Time Fourier Transform (DTFT)

Signal Analysis, Systems, Transforms

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

LTI Systems (Continuous & Discrete) - Basics

Review of Discrete-Time System

ELEG 305: Digital Signal Processing

Solutions: Homework Set # 5

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


Signals and Systems Profs. Byron Yu and Pulkit Grover Fall Midterm 2 Solutions

z-transform Chapter 6

The Discrete-Time Fourier

Lecture 7 Discrete Systems

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

Review of Fundamentals of Digital Signal Processing

New Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Fall 2015 Final Exam

EC6303 SIGNALS AND SYSTEMS

Discrete Time Systems

so mathematically we can say that x d [n] is a discrete-time signal. The output of the DT system is also discrete, denoted by y d [n].

ECE 301 Fall 2011 Division 1 Homework 5 Solutions

Lecture 7 - IIR Filters

Transcription:

Chapter 7: The -Transform

ECE352 1 The -Transform - definition Continuous-time systems: e st H(s) y(t) = e st H(s) e st is an eigenfunction of the LTI system h(t), and H(s) is the corresponding eigenvalue. Discrete-time systems: x[n] = n h[n] y[n] y[n] = x[n] h[n] = = k= k= h[k] n k = n h[k]x[n k] k= h[k] k = n H() n is an eigenfunction of the LTI system h[n], and H() is the corresponding eigenvalue.

ECE352 2 The -Transform - definition (cont.) The transfer function: H() = Generally, let = re jω. Then, k= h[k] k. H(re jω ) = n= ( h[n] n ) e jωn. Thus, H() is the DTFT of h[n]r n. The inverse DTFT of H(re jω ) must be h[n]r n.

ECE352 3 The -Transform - definition (cont.) So we may write h[n]r n = 1 2π π π H(re jω )e jωn dω. = re jω d = jre jω dω. dω = 1 j 1 d. As Ω goes from π to π, traverses a circle of radius r in a counterclockwise direction. Thus, we may write h[n] = 1 2πj H() n 1 d

ECE352 4 The -Transform - definition (cont.) For an arbitrary signal x[n], the -transform and inverse -transform are expressed as X() = n= x[n] = 1 2πj x[n] n X() n 1 d We express this relationship between x[n] and X() as x[n] X()

ECE352 5 The -Transform - convergence A necessary condition for convergence: (absolute summability) n= x[n]r n < The range of r for which this condition is satisfied is termed the region of convergence (ROC). Complex number is represented as a location in a complex plane, termed the -plane. If x[n] is absolutely summable, then the DTFT of x[n] is obtained as X(e jω ) = X() =e jω The contour = e jω is termed the unit circle.

ECE352 6 The -Transform - poles and eros The most commonly encountered form of the -transform is a ratio of two polynomials in 1, as shown by the rational function X() = b 0 + b 1 1 + + b M M a 0 + a 1 1 + + a N N = b M k=1 (1 c k 1 ) N k=1 (1 d k 1 ) b = b 0 /a 0. c k : eros of X(). Denoted with the symbol in the plane. d k : poles of X(). Denoted with the symbol in the plane.

ECE352 7 The -Transform - Review of commonly used series Geometric series: Let s n = a + ar + ar 2 + + ar n, then Proof: s n = a(1 rn+1 ) 1 r lim s n = n a, if r < 1 1 r s n = a + ar + ar 2 + + ar n rs n = ar + ar 2 + + ar n + ar n+1 s n rs n = a(1 r n+1 ) s n = a(1 rn+1 ) 1 r

ECE352 8 The -Transform - Review of commonly used series (cont.) Arithmetic progression: Let s n = a + (a + r) + (a + 2r) + + (a + nr), then Proof: s n = (n + 1)(a + (a + nr)) 2 lim n n =, if r > 0 lim n n =, if r < 0 s n = a + (a + r) + (a + 2r) + + (a + nr) s n = (a + nr) + (a + (n 1)r) + + (a + r) + a 2s n = (n + 1)(a + (a + nr)) s n = (n + 1)(a + (a + nr))/2

ECE352 9 The -Transform - Review of commonly used series (cont.) n=1 1 2 n = 1 1 + 1 3 2 + 1 5 2 + = π2 8 1 + 1 2 2 + 1 3 2 + = n=1 1 2 2 + 1 4 2 + 1 6 2 + = π2 24 1 n 2 = π2 6

ECE352 10 The -Transform - Convergence of commonly used series n=1 1 n p for p > 0: Convergent, if p > 1 Divergent, if p 1. Example: 1 + 1 2 + 1 3 + + 1 n + : divergent 1 + 1 2 2 + 1 3 2 + + 1 n 2 + : convergent

ECE352 11 The -Transform - Convergence of commonly used series (cont.) Ratio test: Suppose lim n a n+1 a n = r. r > 1: divergent r < 1: convergent r = 1: test gives no information Comparison test: Assume 0 a n b n, n. If b n is convergent a n is convergent (For convenience, we use b n to represent an infinite series in the notes) Example: Let a n = 2n 3n 3 1, b n = 1 n 2.

ECE352 12 bn is convergent. Thus, a n is convergent because n 1 n 3 1 3n 3 1 2n 3 a n b n.

ECE352 13 The -Transform - Convergence of commonly used series (cont.) Corollary of comparison test (limiting form): Suppose that a n a n > 0, b n > 0 and then lim = k > 0. n b n an convergent iff b n convergent Example: Let a n = a n n n 2 + 1, b n = 1 n. n 2 n 2 + 1 = 1. lim = lim n b n n Because b n is divergent a n is divergent.

ECE352 14 The -Transform - Convergence of commonly used series (cont.) Necessary condition for convergence of a n : lim = a n = 0 n It is not a sufficient condition. For example, a n = 1 n, a n is divergent.

ECE352 15 The -Transform - Examples Determine the -transform of the following signals and depict the ROC and the locations of the poles and eros of X() in the -plane: x[n] = α n u[n] (causal signal) x[n] = α n u[ n 1] (anticausal signal) For signal x[n] = α n u[n]: X() = = α n u[n] n n= n=0 ( α ) n.

ECE352 16 The -Transform - Examples (cont.) This infinite series converges to X() = 1 1 α 1 =, for > α. α For signal x[n] = α n u[ n 1]: X() = = = n= = 1 1 n= k= 1 ( α n u[ n 1] n) ( α ) n ( α ) k ( α ) k = 1 k=0 1 1 α 1 = α, for < α.

ECE352 17 The -Transform - Examples (cont.) Observations: As bilateral Laplace transform, the relationship between x[n] and X() is not unique. The ROC differentiates the two transforms. We must know the ROC to determine the correct inverse -transform.

ECE352 18 The -Transform - Examples (cont.) Read Example 7.4, p 560. Problem 7.1(c), p 561 : Determine the -transform, the ROC, and the locations of poles and eros of X() for the following signal x[n] = ( ) n ( 3 u[ n 1] + 1 n u[n] 4 3) Using the results given in the previous two slides: ( ) n 3 u[ n 1] 4 ( 1 n u[n] 3) 3/4 + 1/3. Thus, X() = 3/4 + + 1/3 = (2 5/12) ( 3/4)( + 1/3)

ECE352 19 Properties of the ROC As the Laplace transform, the ROC cannot contain any poles. ROC for a finite-duration signal includes the entire -plane, except possibly = 0 or = or both. Left-sided sequence: x[n] = 0 for n 0 (notice the difference between the left-sided signal for Laplace transform). Right-sided sequence: x[n] = 0 for n < 0 Two-sided sequence: a signal that has infinite duration in both the positive and negative directions.

ECE352 20 Properties of the ROC RSS: ROC is of the form > r + LSS: ROC is of the form < r TSS: ROC if of the form r + < < r where the boundaries r + and r are determined by the pole locations. See the figure next page.

ECE352 21 Properties of the ROC (cont.)

ECE352 22 Properties of the ROC - Examples Example 7.5, identify the ROC associated with the -transform for each of the following signals. x[n] = ( 1/2) n u[ n] + 2(1/4) n u[n] y[n] = ( 1/2) n u[n] + 2(1/4) n u[n] w[n] = ( 1/2) n u[ n] + 2(1/4) n u[ n]

ECE352 23 Properties of the ROC - Examples (cont.) For x[n], the -transform is written as X() = = 0 n= ( ) n 1 + 2 2 ( 2) k + 2 k=0 n=0 n=0 ( 1 4 ( 1 4 ) n ) n The first sum converges for < 1 2. The second sum converges for > 1 4. Thus, the ROC is 1 4 < < 1 2. Summing the two geometric series: X() = 1 1 + 2 + 2 1/4.

ECE352 24 Observations: Properties of the ROC - Examples (cont.) The first term on the right side of [n] is a left-sided sequence. Its ROC is < r, where r is determined by its pole location. The second term on the right side of [n] is a right-sided sequence. Its ROC is > r +, where r + is determined by its pole location.

ECE352 25 Properties of the ROC - Examples (cont.) For y[n], both terms are right-sided sequences. Thus, the ROC is > r +, where r + is determined by the pole locations. Y () = n=0 ( ) n 1 + 2 2 n=0 ( ) n 1 4 The first series converges for > 1/2 and the second series converges for > 1/4. Thus, the ROC is > 1/2, and we write Y () as Y () = + 1/2 + 2 1/4.

ECE352 26 Properties of the ROC - Examples (cont.) For w[n], both terms are left-sided sequences. Thus, the ROC is < r, where r is determined by the pole locations. W () = = 0 n= ( ) n 1 + 2 2 ( 2) k + 2 k=0 0 n= (4) k k=0 ( ) n 1 4

ECE352 27 Properties of the ROC - Examples (cont.) The first series converges for < 1/2. The second series converges for < 1/4. Thus, the ROC is < 1/4, and we write W () as W () = 1 1 + 2 + 2 1 4. The pole locations of sequences [n], y[n], w[n] are shown in the figure next slide.

ECE352 28 Properties of the ROC (cont.)

ECE352 29 Properties of the -transform Linearity Let x[n] X() (ROC R x ) and y[n] Y (). ax[n] + by[n] ax() + by (), with ROC at least R x Ry The ROC can be larger than the intersection if one or more terms in x[n] or y[n] cancel each other in the sum. In the -plane, this corresponds to a ero canceling a pole that defines one of the ROC boundaries.

ECE352 30 Properties of the -transform (cont.) Example: Example 7.5, p 567. Suppose x[n] = ( ) n ( ) n 1 3 u[n] u[ n 1] 2 2 X() = ( 1/2)( 3/2) with ROC 1/2 < < 3/2, and y[n] = ( ) n 1 u[n] 4 ( ) n 1 u[n] 2 Y () = 1 4 ( 1/4)( 1/2) with ROC > 1/2. Evaluate the -transform of ax[n] + by[n], where a and b are constants.

ECE352 31 Properties of the -transform (cont.) Using the linearity property, we have ax[n] + by[n] a ( 1/2)( 3/2) + b 1 4 ( 1/4)( 1/2) Must be careful in determining ROC. In general, the ROC is the intersection of individual ROCs. For some special cases, however, the ROC could be larger. For instance, let a = b = 1.

ECE352 32 Properties of the -transform (cont.) Then, ax() + by () = = = ( 1/2)( 3/2) + 1 4 ( 1/4)( 1/2) 5 4( 1/2) ( 1/4)( 1/2)( 3/2) 5 4 ( 1/4)( 3/2) The ROC can be verified to be 1/4 < < 3/2 because the pole-ero cancellation ( = 1/2), and the (1/2) n u[n] no longer presents.

ECE352 33 Properties of the -transform (cont.) Time reversal x[ n] X ( ) 1 with ROC 1 R x. If R x is of the form a < < b, the ROC of the reflected signal is 1/b < < 1/a. Time shift x[n n 0 ] n 0X() with ROC R x, except possibly = 0 and =. If n 0 > 0, n 0 introduces a pole = 0. If n 0 < 0, n 0 introduces a pole = ±.

ECE352 34 Properties of the -transform (cont.) Multiplication by an exponential sequence α n x[n] X ( α) with ROC α Rx. α R x implies that the ROC boundaries are multiplied by α. If α = 1, then the ROC is unchanged. Convolution x[n] y[n] X()Y () with ROC at least R x Ry. The ROC may be larger than the intersection of R x and R y if a pole-ero cancellation occurs in the product of X()Y ().

ECE352 35 Properties of the -transform (cont.) Differentiation in the -domain nx[n] d d X(), with ROC R x. Read Example 7.8, p 570. Example: Example 7.7, p 570. Find the -transform of x[n] = ( n ( ) n 1 u[n]) 2 ( ) n 1 u[ n]. 4

ECE352 36 Properties of the -transform: example Basic signal of first term: ( ) 1 n 2 u[n] > 1/2. +1/2, with ROC Applying the -domain differentiation property: n ( ) n 1 u[n] 2 d d + 1/2 = 1 2 ( + 1/2) 2, with ROC > 1/2

ECE352 37 Properties of the -transform: example (cont.) Applying time reversal property: ( 1 > 1/4. Thus, ( 1 4 < 4 4 ) n u[n] ) n u[ n] 1/ 1/ 1/ 1/4 = 4 4 1/4, with ROC with ROC Applying convolution property: x[n] ROC 1 2 < < 4. 2 ( 4)(+1/2) 2, with