z-transform Chapter 6
|
|
- Fay Harper
- 5 years ago
- Views:
Transcription
1 z-transform Chapter 6 Dr. Iyad djafar
2 Outline 2 Definition Relation Between z-transform and DTFT Region of Convergence Common z-transform Pairs The Rational z-transform The Inverse z-transform z-transform Properties LTI Systems & z-transform Filter Design using Pole-zero Placement
3 3 Definition The DTFT does not exist for all sequences! Can we still analyze such sequences in the frequency domain? Additionally, i the DTFT is acomplex function of ω, which h makes it hard to manipulate. One way around these issues is to use the z-transform!! The z-transform A generalization of the DTFT and it may exist for sequences for which the DTFT does not exist. For a real sequence, the z-transform is areal function of the complex variable z.this makes provides easier manipulation. For a sequence g[n], the z-transform is defined by where z = Re(z) + j Im(z) n G(z) g[n] z -n
4 Relation between z-transform and DTFT 4 The z-transform is defined in terms of the complex j variable z = Re(z) j Im(z) = r e Im(z) So, the z-transform can written as j G(z) j g[n] re zre for r = 1, n g[n] r n n e j jn -n r =1 j n j G(z) j g[n] e G(e ) zre n ω -1 1 So, the DTFT is the z-transform evaluated at the unit circle (r=1) and varying ω -j Z=re jω Re(z)
5 Relation between z-transform and DTFT Thus, G(e jω ) can be computed from the clockwiseor counter clockwise on the unit circle in the complex plane for 0 ω 2π on the circle (r=1) r =1 j Im(z) Z=re jω ω -1 1 Re(z) -j ω = 0 z = 1 G(z=1) = G(e j0 ) ω = π/2 z = j G(z=1) = G(e jπ/2 ) ω = π z= -1 G(z=1) = G(e jπ ) 5
6 Relation between z-transform and DTFT 6 4 G( (z) 2 DTFT Im(z) -2-2 Re(z)
7 Region of Convergence 7 The z-transform exists if the summation converges to a finite value! n G(z) g[n] z In other words, the summation should be absolutely summable G(z) < -n j g[n] z < g[n] re < -n n -n n j -n j -n g[n] re g[n] r e = g[n] r < -n n n n This implies that the z-transform may exist even if g[n] is not absolutely summable given that we specify appropriate values for r
8 Region of Convergence The set of values of r for which the z-transform exists is called the region of convergence (ROC) In general, the ROC for a sequence g[n] is represented as R z < R g where 0 R g < R g The ROC is always defined in terms of z as circular region in the complex plane (inside a circle/outside a circle / rings) g z > α z < α α < z < β -α α -α α -β -α α β 8
9 Region of Convergence Example 6.1: Let x[n] = α n u[n], the determine X(z). z > α -α α 9 ROC for causal sequences is the region outside z = α
10 Region of Convergence Example 6.2: Let x[n] = -α n u[-n-1], the determine X(z). -α α 10 ROC for anti-causal sequences is the region inside z = α To completely define the z-transform, we must define the ROC
11 11 Common z-transform Pairs
12 The Rational z-transform Most LTI systems have rational z-transforms of the form 12 where P(z) and D(z) are two polynomials in z -1 of degrees M and N, respectively. The rational z-transform can be written as G(z) M M 1 0 k 0 k k1 (NM) k1 z N N 1 0 k 0 k k1 k1 p (1 z ) p (z ) d (1 z ) d (z ) For z = ζ l, G(z) = 0 {ζ l } are called the zeros of G(z) For z = λ l,g(z)= {λ l } are called the poles of G(z) If N > M additional (N M) finiteit zerosat z = 0 If N < M additional (M N) finite poles t z = 0
13 The Rational z-transform Example 6.3: H(z) () z 2 z 2 z 3z2 H(z) has zeros at z = 0 and z = 1 (circles in the z-plane o ) H(z) has poles at z = -1 and z = -2 (crosses in the z-plane x ) H(z) has no additional zeros or poles at z = since M = N Im(z) -2 1 Re(z) 13 z-plane
14 The Rational z-transform The z-transform is not defined at the poles. Thus, the ROC for any z-transform should not include the poles. The rational z-transform can be completely specified by the locations of poles and zeros and the gain p 0 /d 0 Example 6.4: H(z) 1 1 z H(z) 1 z z 1 14 H(z) = 0 at z = 0 H(z) = at z = 1 ROC: z > 1 (causal) ROC : z < 1 (anti-causal)
15 The Rational z-transform Example 6.5: x[n] = (0.5) n u[n] + (-0.3) n u[n] 15 X(z) z 10.3z 1 1 the z-transform exists if z > 0.5 and z > 0.3 ROC : ( Z > 0.5) ( Z > 0.3) ROC : Z > 0.5
16 The Rational z-transform Example 6.6: x[n] = α n 16
17 The Rational z-transform Example 6.7: X(z) 2 z 2z z 3z z5 All possible regions of convergence are 17
18 The Inverse z-transform The general form for computing the inverse z-transform is throughevaluating g the complex integral 1 2 j n1 g[n] G(z)z dz However, the integral has to be evaluated for all values of n Alternatively, we consider two approaches to compute the inverse z-transform Power series in z (Long division) Manipulate G(z) into recognizable pieces (partial fraction expansion) and use lookup tables 18
19 The Inverse z-transform Example 6.8: h[n] = {1, 1.6, -0.52, 0.4, } 19
20 The Inverse z-transform Partial fraction expansion rearrangeg(z)asasumof recognizable terms of simple and known z-transforms P(z) P(z) G(z) D(z) (11z )(12z )(13z ) (1 z ) (1 z ) (1 z ) Thus, a rational z-transform of the form G(z) = P(z)/D(z) can be expressed as G(z) where N is the order of the denominator, λ k are poles and ρ k are called the residues and are computed by N P(z) k D(z) 1 z k1 (1 z ) G(z) 1 20 k k zk k 1
21 The Inverse z-transform Example 6.9: Determine the causal sequence h[n] which has the following z-transform H(z) z(z 2) (z0.2)(z0.6) 21
22 The Inverse z-transform Example 6.9 -Continued. 22
23 The Inverse z-transform Partial fraction expansion What if G(z) has poles with multiplicity li it L? G(z) is expressed by G(z) NL L P(z) k 1 k1 k m1 D(z) 1 z 1 z where σ is a pole with multiplicity L and the residues μ m are computed m 1 m L m 1 d 1 L m (1z ) G(z) Lm 1 Lm (L m)!( ) d(z ) 1 m L 23 z m
24 The Inverse z-transform Example 6.10: Determine the causal sequence g[n] which has the following z-transform G(z) z (z0.5)(z1) 2 24
25 The Inverse z-transform Example Continued. 25
26 The Inverse z-transform Example 6.11: Determine all possible sequences whose z- transform is 1 11 G(z) z z 3z z z 1 26
27 The Inverse z-transform Example Continued. 27
28 28 z-transform Properties
29 z-transform Properties Example 6.12: Determine the z-transform of x[n] = r n cos(ω o n) u[n] 29
30 z-transform Properties Example 6.13: Determine the z-transform of A x[n] + B x[n-1] = C δ[n] + D δ[n-1] 30
31 z-transform Properties Example 6.14: Determine the z-transform of x[n] = (n+1) a n u[n] + a n u[n] 31
32 z-transform Properties Example 6.15: Using z-transform, compute the convolution between h[n] = {0, 3, 4, 5} and g[n] = {2, 7, 1} 32
33 z-transform Properties Example 6.16: Using z-transform, compute the convolution between h[n] = 3 (-0.6) n u[n] g[n] = 2(0.2) 2) n u[n] + 1.2(0.2) 2) n-1 u[n-1] 33
34 LTI Systems and z-transform The impulse response h[n] of a LTI system is completely ltl characterized in frequency domain using the frequency response H(e jω ) However, H(e jω ) is a complex function of ω, which makes it difficult to manipulate for realization How about the characterization of LTI systems using the z-transform? 34
35 35 LTI Systems and z-transform For a LTI system, the input-output relation is given by linear convolution y[n] x[n k] h[k] Computing the z-transform of both sides k Y(z) x[n k] h[k] z n n k Interchanging the order of summation Y(z) h[k] x[n k] z k n n h[k] X(z) z k Y(z) X(z) h[k] z X(z) H(z) k H(z) is called the Transfer Function of the impulse response k k
36 36 LTI Systems and z-transform Consider a FIR LTI system h[n], N 1 n N 2.The transfer function H(z) is H(z) N 2 h[n] z N 1 If h[n] is causal, 0 N 1 <N 2, then all the poles of H(z) will be at z = 0. Thus, the ROC is the entire z-plane except at z =0 If h[n] is anticausal, N 1 <N 2 < 0, then te all the tepoles of H(z) will be at z =. Thus,theROCistheentirezplane except atz= If h[n] is two-sided, then the poles of H(z) will be at z = 0 and z =. Thus, the ROC is the entire z-plane except atz=0andz= n
37 LTI Systems and z-transform Example 6.17: consider the M-point moving average filter M1 1 y[n] x[n k] M k 0 37
38 LTI Systems and z-transform 38 Consider an IIR LTI system described by the difference q equation N M k k0 k0 The transfer function H(z) () is d y[n k] px[nk] N M k k dy(z)z Y(z) k0 k () p k X(z)z () H(z) () N X(z) k0 k0 k M p z -1 k 0 Thus, H(z) is a rational polynomial in z. In case h[n] is causal IIR, the ROC is the exterior of the circlepassing i through hthe furthest pole from theorigin ii In case h[n] is an anti-causal IIR, the ROC is the interior of the circle passing through the closet pole from the origin k dz k k k
39 LTI Systems and z-transform Example 6.18: consider the transfer function for a causal LTI system. Draw the pole-zero diagram and determine all possible regions of convergence. X(z) 2 z 0.2z z 0.4z 0.36z
40 LTI Systems and z-transform 40 We showed earlier that the DTFT is basically the z- j transform evaluated at the unit circle, i.e. For a rational transfer function, the frequency response is computed by H(e ) M M 0 k pz (z ) j k 1 N N 0 k dz (z ) p e d k1 M 0 j (NM) k1 N 0 j k1 j ze j (e ) k (e ) H(e ) H(z) j k ze
41 LTI Systems and z-transform Accordingly, the magnitude response is M H(e ) And the phase response is e j j p0 k1 N d 0 j e k1 k k M N p0 j j ( ) ( ) + (N-M) + (e k )- (e k) d0 k1 k1 Effectively, the computation tti of H(e jω ) can be done by geometric vector manipulation in the z-plane 41
42 LTI Systems and z-transform Example 6.19: Compute the frequency response at ω = π for z 1 X(z) z(z j)(z j) 42
43 LTI Systems and z-transform A LTI is said to be BIBO stable if its impulse response is absolutely summable, i.e. S h n h[n] Can we determine the stability of a LTI system based on its transfer function? 43 H(z) h[n]z h[n]z h[n] z n n n n n n on the unit circle, r = 1 j H(z) j H(e ) h[n] ze This implies that a BIBO stable LTI system has H(e jω ) <. In other words, the DTFT should exist. So, the ROC of A BIBO stable LTI system should include the unit circle. n
44 LTI Systems and z-transform Inverse System Consider the impulse response of two systems h 1 [n] and h 2 [n] that are cascaded x[n] h 1 [n] h 2 [n] y[n] 44 If y[n] equals x[n], then h 2[n]issaidtobetheinverse system of h 1 [n] and vice versa. It can be easily verified that the relation between the transfer functions of a system and its inverse is given by H(z) 1 1 H(z) 2
45 LTI Systems and z-transform Example 6.20: determine the transfer function for the causal inverse system for z 0.2z 0.6 1) H(z), z 0.5 (z0.3)(z0.5) 2) z4z5 H(z), z 0.5 (z0.5)(z0.3) 45
46 LTI Systems and z-transform Example 6.21: determine the transfer function of the causal inverse system for h[n] = 1.9δ[n] (-0.2) n u[n] -0.6(0.7) n u[n] 46
47 LTI Systems and z-transform Deconvolution Given that the relation between the input and output of a LTI system is convolution, y[n] = x[n] * h[n], can we determine x[n] if we know h[n] and y[n]? Y(z) Y(z) = X(z) H(z) X(z) = H(z) Example 6.22: y[n] = {6, 10, 3, -2, 5, -6} h[n] = {2, 4, 1, -3} 47
48 Filter Design Using Pole-Zero Placement Recall the rational z-transform 48 The frequency response (magnitude and phase) at specific frequency can be computed geometrically based on the location of the poles and zeros of the z-transform. Specifically the magnitude response is M M e j k j p0 k1 k1 N N d 0 j e k k1 k1 H(e ) K Dis tan ce to zeros Dis tan ce to poles Note how the magnitude is large nearthepoles and small near the zeros Given some filter type andspecifications, can we design the filter by proper placement of the poles and zeros?
49 Filter Design Using Pole-Zero Placement 49 Example 6.23: Design a single-pole lowpass filter with unity magnitude at ω =0and0.5atω = π/2 1) place the pole at ω =0 2) place on zero at ω = π 3) the transfer function will be z 1 H(z) K z r 4) at ω = 0, the magnitude response is 1 j0 e 1 j0 H(z) j0 K 1 2K = 1 r ze e r 5) at ω = π/2 j /2 e 1 H(z) z e j K 0.5 /2 j /2 e r Solving K = 3/8 and r = 1/4 r
50 Filter Design Using Pole-Zero Placement Example 6.23: continued 1 H(z) 3 z z 8 z z Y(z) z X(z) 1 z y[n] 0.25y[n 1] x[n] x[n 1] H(e j ) x[n] y[n] n
51 Related functions ztrans iztrans zplane tf residuez conv freqz Matlab 51
Z-Transform. 清大電機系林嘉文 Original PowerPoint slides prepared by S. K. Mitra 4-1-1
Chapter 6 Z-Transform 清大電機系林嘉文 cwlin@ee.nthu.edu.tw 03-5731152 Original PowerPoint slides prepared by S. K. Mitra 4-1-1 z-transform The DTFT provides a frequency-domain representation of discrete-time
More informationVery useful for designing and analyzing signal processing systems
z-transform z-transform The z-transform generalizes the Discrete-Time Fourier Transform (DTFT) for analyzing infinite-length signals and systems Very useful for designing and analyzing signal processing
More informationSolutions: Homework Set # 5
Signal Processing for Communications EPFL Winter Semester 2007/2008 Prof. Suhas Diggavi Handout # 22, Tuesday, November, 2007 Solutions: Homework Set # 5 Problem (a) Since h [n] = 0, we have (b) We can
More informationECE503: Digital Signal Processing Lecture 4
ECE503: Digital Signal Processing Lecture 4 D. Richard Brown III WPI 06-February-2012 WPI D. Richard Brown III 06-February-2012 1 / 29 Lecture 4 Topics 1. Motivation for the z-transform. 2. Definition
More informationTopic 4: The Z Transform
ELEN E480: Digital Signal Processing Topic 4: The Z Transform. The Z Transform 2. Inverse Z Transform . The Z Transform Powerful tool for analyzing & designing DT systems Generalization of the DTFT: G(z)
More informationELEG 305: Digital Signal Processing
ELEG 305: Digital Signal Processing Lecture 4: Inverse z Transforms & z Domain Analysis Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 008 K. E. Barner
More informationUNIT-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).
Page no: 1 UNIT-II Z-TRANSFORM The Z-Transform The direct -transform, properties of the -transform, rational -transforms, inversion of the transform, analysis of linear time-invariant systems in the -
More informationZ Transform (Part - II)
Z Transform (Part - II). The Z Transform of the following real exponential sequence x(nt) = a n, nt 0 = 0, nt < 0, a > 0 (a) ; z > (c) for all z z (b) ; z (d) ; z < a > a az az Soln. The given sequence
More informationDigital Signal Processing:
Digital Signal Processing: Mathematical and algorithmic manipulation of discretized and quantized or naturally digital signals in order to extract the most relevant and pertinent information that is carried
More informationThe Z transform (2) 1
The Z transform (2) 1 Today Properties of the region of convergence (3.2) Read examples 3.7, 3.8 Announcements: ELEC 310 FINAL EXAM: April 14 2010, 14:00 pm ECS 123 Assignment 2 due tomorrow by 4:00 pm
More informationUse: Analysis of systems, simple convolution, shorthand for e jw, stability. Motivation easier to write. Or X(z) = Z {x(n)}
1 VI. Z Transform Ch 24 Use: Analysis of systems, simple convolution, shorthand for e jw, stability. A. Definition: X(z) = x(n) z z - transforms Motivation easier to write Or Note if X(z) = Z {x(n)} z
More informationZ-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 The Z-transform is the Discrete-Time counterpart of the Laplace Transform. Laplace : G(s) = Z : G(z) = It is Used in Digital Signal Processing n= g(t)e st dt g[n]z n Used to Define Frequency
More informationStability Condition in Terms of the Pole Locations
Stability Condition in Terms of the Pole Locations A causal LTI digital filter is BIBO stable if and only if its impulse response h[n] is absolutely summable, i.e., 1 = S h [ n] < n= We now develop a stability
More informationELEN E4810: Digital Signal Processing Topic 4: The Z Transform. 1. The Z Transform. 2. Inverse Z Transform
ELEN E480: Digital Signal Processing Topic 4: The Z Transform. The Z Transform 2. Inverse Z Transform . The Z Transform Powerful tool for analyzing & designing DT systems Generalization of the DTFT: G(z)
More informationEEL3135: Homework #4
EEL335: Homework #4 Problem : For each of the systems below, determine whether or not the system is () linear, () time-invariant, and (3) causal: (a) (b) (c) xn [ ] cos( 04πn) (d) xn [ ] xn [ ] xn [ 5]
More informationUniversity of Illinois at Urbana-Champaign ECE 310: Digital Signal Processing
University of Illinois at Urbana-Champaign ECE 0: Digital Signal Processing Chandra Radhakrishnan PROBLEM SET : SOLUTIONS Peter Kairouz Problem. Hz z 7 z +/9, causal ROC z > contains the unit circle BIBO
More informationSignals & Systems Handout #4
Signals & Systems Handout #4 H-4. Elementary Discrete-Domain Functions (Sequences): Discrete-domain functions are defined for n Z. H-4.. Sequence Notation: We use the following notation to indicate the
More informationEE 521: Instrumentation and Measurements
Aly El-Osery Electrical Engineering Department, New Mexico Tech Socorro, New Mexico, USA November 1, 2009 1 / 27 1 The z-transform 2 Linear Time-Invariant System 3 Filter Design IIR Filters FIR Filters
More informationZ-Transform. x (n) Sampler
Chapter Two A- Discrete Time Signals: The discrete time signal x(n) is obtained by taking samples of the analog signal xa (t) every Ts seconds as shown in Figure below. Analog signal Discrete time signal
More informationDiscrete-time Signals and Systems in
Discrete-time Signals and Systems in the Frequency Domain Chapter 3, Sections 3.1-39 3.9 Chapter 4, Sections 4.8-4.9 Dr. Iyad Jafar Outline Introduction The Continuous-Time FourierTransform (CTFT) The
More informationLet 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 )
Review: Poles and Zeros of Fractional Form Let H() = P()/Q() be the system function of a rational form. Let us represent both P() and Q() as polynomials of (not - ) Then Poles: the roots of Q()=0 Zeros:
More informationESE 531: Digital Signal Processing
ESE 531: Digital Signal Processing Lec 6: January 30, 2018 Inverse z-transform Lecture Outline! z-transform " Tie up loose ends " Regions of convergence properties! Inverse z-transform " Inspection " Partial
More informationSignals and Systems. Problem Set: The z-transform and DT Fourier Transform
Signals and Systems Problem Set: The z-transform and DT Fourier Transform Updated: October 9, 7 Problem Set Problem - Transfer functions in MATLAB A discrete-time, causal LTI system is described by the
More informationThe Z-Transform. Fall 2012, EE123 Digital Signal Processing. Eigen Functions of LTI System. Eigen Functions of LTI System
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
More informationDiscrete Time Systems
1 Discrete Time Systems {x[0], x[1], x[2], } H {y[0], y[1], y[2], } Example: y[n] = 2x[n] + 3x[n-1] + 4x[n-2] 2 FIR and IIR Systems FIR: Finite Impulse Response -- non-recursive y[n] = 2x[n] + 3x[n-1]
More informationy[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)
7. The Z-transform 7. Definition of the Z-transform We saw earlier that complex exponential of the from {e jwn } is an eigen function of for a LTI System. We can generalize this for signals of the form
More informationQUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)
QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE) 1. For the signal shown in Fig. 1, find x(2t + 3). i. Fig. 1 2. What is the classification of the systems? 3. What are the Dirichlet s conditions of Fourier
More informationLecture 04: Discrete Frequency Domain Analysis (z-transform)
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
More informationEE123 Digital Signal Processing. M. Lustig, EECS UC Berkeley
EE123 Digital Signal Processing Today Last time: DTFT - Ch 2 Today: Continue DTFT Z-Transform Ch. 3 Properties of the DTFT cont. Time-Freq Shifting/modulation: M. Lustig, EE123 UCB M. Lustig, EE123 UCB
More informationEE102B Signal Processing and Linear Systems II. Solutions to Problem Set Nine Spring Quarter
EE02B Signal Processing and Linear Systems II Solutions to Problem Set Nine 202-203 Spring Quarter Problem 9. (25 points) (a) 0.5( + 4z + 6z 2 + 4z 3 + z 4 ) + 0.2z 0.4z 2 + 0.8z 3 x[n] 0.5 y[n] -0.2 Z
More informationDigital Signal Processing. Midterm 1 Solution
EE 123 University of California, Berkeley Anant Sahai February 15, 27 Digital Signal Processing Instructions Midterm 1 Solution Total time allowed for the exam is 8 minutes Some useful formulas: Discrete
More informationReview of Discrete-Time System
Review of Discrete-Time System Electrical & Computer Engineering University of Maryland, College Park Acknowledgment: ENEE630 slides were based on class notes developed by Profs. K.J. Ray Liu and Min Wu.
More informationLecture 2 OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE
OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE EEE 43 DIGITAL SIGNAL PROCESSING (DSP) 2 DIFFERENCE EQUATIONS AND THE Z- TRANSFORM FALL 22 Yrd. Doç. Dr. Didem Kivanc Tureli didemk@ieee.org didem.kivanc@okan.edu.tr
More informationDiscrete-Time Signals and Systems. The z-transform and Its Application. The Direct z-transform. Region of Convergence. Reference: Sections
Discrete-Time Signals and Systems The z-transform and Its Application Dr. Deepa Kundur University of Toronto Reference: Sections 3. - 3.4 of John G. Proakis and Dimitris G. Manolakis, Digital Signal Processing:
More informationESE 531: Digital Signal Processing
ESE 531: Digital Signal Processing Lec 6: January 31, 2017 Inverse z-transform Lecture Outline! z-transform " Tie up loose ends " Regions of convergence properties! Inverse z-transform " Inspection " Partial
More informationLike bilateral Laplace transforms, ROC must be used to determine a unique inverse z-transform.
Inversion of the z-transform Focus on rational z-transform of z 1. Apply partial fraction expansion. Like bilateral Laplace transforms, ROC must be used to determine a unique inverse z-transform. Let X(z)
More informationModule 4 : Laplace and Z Transform Problem Set 4
Module 4 : Laplace and Z Transform Problem Set 4 Problem 1 The input x(t) and output y(t) of a causal LTI system are related to the block diagram representation shown in the figure. (a) Determine a differential
More informationVI. Z Transform and DT System Analysis
Summer 2008 Signals & Systems S.F. Hsieh VI. Z Transform and DT System Analysis Introduction Why Z transform? a DT counterpart of the Laplace transform in CT. Generalization of DT Fourier transform: z
More informationLecture 7 Discrete Systems
Lecture 7 Discrete Systems EE 52: Instrumentation and Measurements Lecture Notes Update on November, 29 Aly El-Osery, Electrical Engineering Dept., New Mexico Tech 7. Contents The z-transform 2 Linear
More informationSignals and Systems. Spring Room 324, Geology Palace, ,
Signals and Systems Spring 2013 Room 324, Geology Palace, 13756569051, zhukaiguang@jlu.edu.cn Chapter 10 The Z-Transform 1) Z-Transform 2) Properties of the ROC of the z-transform 3) Inverse z-transform
More informationDiscrete-Time Fourier Transform (DTFT)
Discrete-Time Fourier Transform (DTFT) 1 Preliminaries Definition: The Discrete-Time Fourier Transform (DTFT) of a signal x[n] is defined to be X(e jω ) x[n]e jωn. (1) In other words, the DTFT of x[n]
More informationPROBLEM SET 3. Note: This problem set is a little shorter than usual because we have not covered inverse z-transforms yet.
PROBLEM SET 3 Issued: /3/9 Due: 2/6/9 Reading: During the past week we concluded our discussion DTFT properties and began our discussion of z-transforms, covering basic calculation of the z-transform and
More information# 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.
[ ] = h k M [ ] = b k x[ n " k] FIR k= M [ ]x[ n " k] convolution k= x[ n] = Ae j" e j ˆ n Complex exponential input [ ] = h k M % k= [ ]Ae j" e j ˆ % M = ' h[ k]e " j ˆ & k= k = H (" ˆ )Ae j e j ˆ ( )
More information! z-transform. " Tie up loose ends. " Regions of convergence properties. ! Inverse z-transform. " Inspection. " Partial fraction
Lecture Outline ESE 53: Digital Signal Processing Lec 6: January 3, 207 Inverse z-transform! z-transform " Tie up loose ends " gions of convergence properties! Inverse z-transform " Inspection " Partial
More informationECE503: Digital Signal Processing Lecture 5
ECE53: Digital Signal Processing Lecture 5 D. Richard Brown III WPI 3-February-22 WPI D. Richard Brown III 3-February-22 / 32 Lecture 5 Topics. Magnitude and phase characterization of transfer functions
More informationDigital Signal Processing Lecture 8 - Filter Design - IIR
Digital Signal Processing - Filter Design - IIR Electrical Engineering and Computer Science University of Tennessee, Knoxville October 20, 2015 Overview 1 2 3 4 5 6 Roadmap Discrete-time signals and systems
More informationChap 2. Discrete-Time Signals and Systems
Digital Signal Processing Chap 2. Discrete-Time Signals and Systems Chang-Su Kim Discrete-Time Signals CT Signal DT Signal Representation 0 4 1 1 1 2 3 Functional representation 1, n 1,3 x[ n] 4, n 2 0,
More informationNeed for transformation?
Z-TRANSFORM In today s class Z-transform Unilateral Z-transform Bilateral Z-transform Region of Convergence Inverse Z-transform Power Series method Partial Fraction method Solution of difference equations
More informationECE503: Digital Signal Processing Lecture 6
ECE503: Digital Signal Processing Lecture 6 D. Richard Brown III WPI 20-February-2012 WPI D. Richard Brown III 20-February-2012 1 / 28 Lecture 6 Topics 1. Filter structures overview 2. FIR filter structures
More information8. z-domain Analysis of Discrete-Time Signals and Systems
8. z-domain Analysis of Discrete-Time Signals and Systems 8.. Definition of z-transform (0.0-0.3) 8.2. Properties of z-transform (0.5) 8.3. System Function (0.7) 8.4. Classification of a Linear Time-Invariant
More informationChapter Intended Learning Outcomes: (i) Understanding the relationship between transform and the Fourier transform for discrete-time signals
z Transform Chapter Intended Learning Outcomes: (i) Understanding the relationship between transform and the Fourier transform for discrete-time signals (ii) Understanding the characteristics and properties
More informationUNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything.
UNIVERSITY OF OSLO Faculty of mathematics and natural sciences Examination in INF3470/4470 Digital signal processing Day of examination: December 9th, 011 Examination hours: 14.30 18.30 This problem set
More information(i) Represent discrete-time signals using transform. (ii) Understand the relationship between transform and discrete-time Fourier transform
z Transform Chapter Intended Learning Outcomes: (i) Represent discrete-time signals using transform (ii) Understand the relationship between transform and discrete-time Fourier transform (iii) Understand
More informationSignal Analysis, Systems, Transforms
Michael J. Corinthios Signal Analysis, Systems, Transforms Engineering Book (English) August 29, 2007 Springer Contents Discrete-Time Signals and Systems......................... Introduction.............................................2
More informationZ-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.
84 5. Z-TRANSFORMS 5 z-transforms Solution: Using the definition (5..2), we find: for case (a), and H(z) h 0 + h z + h 2 z 2 + h 3 z 3 2 + 3z + 5z 2 + 2z 3 H(z) h 0 + h z + h 2 z 2 + h 3 z 3 + h 4 z 4
More informationZ - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.
Z - Transform The z-transform is a very important tool in describing and analyzing digital systems. It offers the techniques for digital filter design and frequency analysis of digital signals. Definition
More informationGeneralizing the DTFT!
The Transform Generaliing the DTFT! The forward DTFT is defined by X e jω ( ) = x n e jωn in which n= Ω is discrete-time radian frequency, a real variable. The quantity e jωn is then a complex sinusoid
More informationEE482: Digital Signal Processing Applications
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu EE482: Digital Signal Processing Applications Spring 2014 TTh 14:30-15:45 CBC C222 Lecture 02 DSP Fundamentals 14/01/21 http://www.ee.unlv.edu/~b1morris/ee482/
More informationDiscrete-Time Signals and Systems. Frequency Domain Analysis of LTI Systems. The Frequency Response Function. The Frequency Response Function
Discrete-Time Signals and s Frequency Domain Analysis of LTI s Dr. Deepa Kundur University of Toronto Reference: Sections 5., 5.2-5.5 of John G. Proakis and Dimitris G. Manolakis, Digital Signal Processing:
More information6.003: Signals and Systems
6.003: Signals and Systems Z Transform September 22, 2011 1 2 Concept Map: Discrete-Time Systems Multiple representations of DT systems. Delay R Block Diagram System Functional X + + Y Y Delay Delay X
More informationSignals and Systems Lecture 8: Z Transform
Signals and Systems Lecture 8: Z Transform Farzaneh Abdollahi Department of Electrical Engineering Amirkabir University of Technology Winter 2012 Farzaneh Abdollahi Signal and Systems Lecture 8 1/29 Introduction
More informationResponses of Digital Filters Chapter Intended Learning Outcomes:
Responses of Digital Filters Chapter Intended Learning Outcomes: (i) Understanding the relationships between impulse response, frequency response, difference equation and transfer function in characterizing
More informationTransform Analysis of Linear Time-Invariant Systems
Transform Analysis of Linear Time-Invariant Systems Discrete-Time Signal Processing Chia-Ping Chen Department of Computer Science and Engineering National Sun Yat-Sen University Kaohsiung, Taiwan ROC Transform
More informationDigital Signal Processing
COMP ENG 4TL4: Digital Signal Processing Notes for Lecture #21 Friday, October 24, 2003 Types of causal FIR (generalized) linear-phase filters: Type I: Symmetric impulse response: with order M an even
More informationEE 3054: Signals, Systems, and Transforms Spring A causal discrete-time LTI system is described by the equation. y(n) = 1 4.
EE : Signals, Systems, and Transforms Spring 7. A causal discrete-time LTI system is described by the equation Test y(n) = X x(n k) k= No notes, closed book. Show your work. Simplify your answers.. A discrete-time
More informationDIGITAL SIGNAL PROCESSING. Chapter 3 z-transform
DIGITAL SIGNAL PROCESSING Chapter 3 z-transform by Dr. Norizam Sulaiman Faculty of Electrical & Electronics Engineering norizam@ump.edu.my OER Digital Signal Processing by Dr. Norizam Sulaiman work is
More informationDiscrete Time Systems
Discrete Time Systems Valentina Hubeika, Jan Černocký DCGM FIT BUT Brno, {ihubeika,cernocky}@fit.vutbr.cz 1 LTI systems In this course, we work only with linear and time-invariant systems. We talked about
More informationDigital Signal Processing Lecture 4
Remote Sensing Laboratory Dept. of Information Engineering and Computer Science University of Trento Via Sommarive, 14, I-38123 Povo, Trento, Italy Digital Signal Processing Lecture 4 Begüm Demir E-mail:
More informationLECTURE NOTES DIGITAL SIGNAL PROCESSING III B.TECH II SEMESTER (JNTUK R 13)
LECTURE NOTES ON DIGITAL SIGNAL PROCESSING III B.TECH II SEMESTER (JNTUK R 13) FACULTY : B.V.S.RENUKA DEVI (Asst.Prof) / Dr. K. SRINIVASA RAO (Assoc. Prof) DEPARTMENT OF ELECTRONICS AND COMMUNICATIONS
More informationX (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ω
3 The z-transform ² Two advantages with the z-transform:. The z-transform is a generalization of the Fourier transform for discrete-time signals; which encompasses a broader class of sequences. The z-transform
More informationThe z-transform Part 2
http://faculty.kfupm.edu.sa/ee/muqaibel/ The z-transform Part 2 Dr. Ali Hussein Muqaibel The material to be covered in this lecture is as follows: Properties of the z-transform Linearity Initial and final
More informationChapter 7: The z-transform
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.
More informationCh. 7: Z-transform Reading
c J. Fessler, June 9, 3, 6:3 (student version) 7. Ch. 7: Z-transform Definition Properties linearity / superposition time shift convolution: y[n] =h[n] x[n] Y (z) =H(z) X(z) Inverse z-transform by coefficient
More informationYour solutions for time-domain waveforms should all be expressed as real-valued functions.
ECE-486 Test 2, Feb 23, 2017 2 Hours; Closed book; Allowed calculator models: (a) Casio fx-115 models (b) HP33s and HP 35s (c) TI-30X and TI-36X models. Calculators not included in this list are not permitted.
More informationz-transforms Definition of the z-transform Chapter
z-transforms Chapter 7 In the study of discrete-time signal and systems, we have thus far considered the time-domain and the frequency domain. The z- domain gives us a third representation. All three domains
More informationECE 350 Signals and Systems Spring 2011 Final Exam - Solutions. Three 8 ½ x 11 sheets of notes, and a calculator are allowed during the exam.
ECE 35 Spring - Final Exam 9 May ECE 35 Signals and Systems Spring Final Exam - Solutions Three 8 ½ x sheets of notes, and a calculator are allowed during the exam Write all answers neatly and show your
More informationE : Lecture 1 Introduction
E85.2607: Lecture 1 Introduction 1 Administrivia 2 DSP review 3 Fun with Matlab E85.2607: Lecture 1 Introduction 2010-01-21 1 / 24 Course overview Advanced Digital Signal Theory Design, analysis, and implementation
More informationDIGITAL SIGNAL PROCESSING UNIT 1 SIGNALS AND SYSTEMS 1. What is a continuous and discrete time signal? Continuous time signal: A signal x(t) is said to be continuous if it is defined for all time t. Continuous
More informationModule 4. Related web links and videos. 1. FT and ZT
Module 4 Laplace transforms, ROC, rational systems, Z transform, properties of LT and ZT, rational functions, system properties from ROC, inverse transforms Related web links and videos Sl no Web link
More information7.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.
Solutions to Additional Problems 7.7. Determine the -transform and ROC for the following time signals: Sketch the ROC, poles, and eros in the -plane. (a) x[n] δ[n k], k > 0 X() x[n] n n k, 0 Im k multiple
More informationDiscrete-time signals and systems
Discrete-time signals and systems 1 DISCRETE-TIME DYNAMICAL SYSTEMS x(t) G y(t) Linear system: Output y(n) is a linear function of the inputs sequence: y(n) = k= h(k)x(n k) h(k): impulse response of the
More informationHow to manipulate Frequencies in Discrete-time Domain? Two Main Approaches
How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches Difference Equations (an LTI system) x[n]: input, y[n]: output That is, building a system that maes use of the current and previous
More informationThe Z transform (2) Alexandra Branzan Albu ELEC 310-Spring 2009-Lecture 28 1
The Z transform (2) Alexandra Branzan Albu ELEC 310-Spring 2009-Lecture 28 1 Outline Properties of the region of convergence (10.2) The inverse Z-transform (10.3) Definition Computational techniques Alexandra
More informationLecture 18: Stability
Lecture 18: Stability ECE 401: Signal and Image Analysis University of Illinois 4/18/2017 1 Stability 2 Impulse Response 3 Z Transform Outline 1 Stability 2 Impulse Response 3 Z Transform BIBO Stability
More informationDigital Signal Processing Lab 4: Transfer Functions in the Z-domain
Digital Signal Processing Lab 4: Transfer Functions in the Z-domain A very important category of LTI systems is described by difference equations of the following type N a y[ nk] b x[ nk] M k k0 k0 k From
More informationDigital Signal Processing
Digital Signal Processing The -Transform and Its Application to the Analysis of LTI Systems Moslem Amiri, Václav Přenosil Embedded Systems Laboratory Faculty of Informatics, Masaryk University Brno, Cech
More informationDigital Signal Processing Lecture 10 - Discrete Fourier Transform
Digital Signal Processing - Discrete Fourier Transform Electrical Engineering and Computer Science University of Tennessee, Knoxville November 12, 2015 Overview 1 2 3 4 Review - 1 Introduction Discrete-time
More informationEE Homework 5 - Solutions
EE054 - Homework 5 - Solutions 1. We know the general result that the -transform of α n 1 u[n] is with 1 α 1 ROC α < < and the -transform of α n 1 u[ n 1] is 1 α 1 with ROC 0 < α. Using this result, the
More informationVU Signal and Image Processing
052600 VU Signal and Image Processing Torsten Möller + Hrvoje Bogunović + Raphael Sahann torsten.moeller@univie.ac.at hrvoje.bogunovic@meduniwien.ac.at raphael.sahann@univie.ac.at vda.cs.univie.ac.at/teaching/sip/18s/
More informationELEG 305: Digital Signal Processing
ELEG 305: Digital Signal Processing Lecture : Design of Digital IIR Filters (Part I) Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 008 K. E. Barner (Univ.
More informationTopic 7: Filter types and structures
ELEN E481: Digital Signal Processing Topic 7: Filter tpes and structures 1. Some filter tpes 2. Minimum and maximum phase 3. Filter implementation structures 1 1. Some Filter Tpes We have seen the basics
More informationLecture 19 IIR Filters
Lecture 19 IIR Filters Fundamentals of Digital Signal Processing Spring, 2012 Wei-Ta Chu 2012/5/10 1 General IIR Difference Equation IIR system: infinite-impulse response system The most general class
More informationENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin
ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM Dr. Lim Chee Chin Outline Introduction Discrete Fourier Series Properties of Discrete Fourier Series Time domain aliasing due to frequency
More informationDiscrete-Time David Johns and Ken Martin University of Toronto
Discrete-Time David Johns and Ken Martin University of Toronto (johns@eecg.toronto.edu) (martin@eecg.toronto.edu) University of Toronto 1 of 40 Overview of Some Signal Spectra x c () t st () x s () t xn
More informationExamples. 2-input, 1-output discrete-time systems: 1-input, 1-output discrete-time systems:
Discrete-Time s - I Time-Domain Representation CHAPTER 4 These lecture slides are based on "Digital Signal Processing: A Computer-Based Approach, 4th ed." textbook by S.K. Mitra and its instructor materials.
More informationSIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals
SIGNALS AND SYSTEMS Unit IV Analysis of DT signals Contents: 4.1 Discrete Time Fourier Transform 4.2 Discrete Fourier Transform 4.3 Z Transform 4.4 Properties of Z Transform 4.5 Relationship between Z
More informationMultidimensional digital signal processing
PSfrag replacements Two-dimensional discrete signals N 1 A 2-D discrete signal (also N called a sequence or array) is a function 2 defined over thex(n set 1 of, n 2 ordered ) pairs of integers: y(nx 1,
More informationECE 421 Introduction to Signal Processing
ECE 421 Introduction to Signal Processing Dror Baron Assistant Professor Dept. of Electrical and Computer Engr. North Carolina State University, NC, USA The z-transform [Reading material: Sections 3.1-3.3]
More informationDHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A
DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A Classification of systems : Continuous and Discrete
More informationsummable Necessary and sufficient for BIBO stability of an LTI system. Also see poles.
EECS 206 DSP GLOSSARY c Andrew E. Yagle Fall 2005 absolutely impulse response: h[n] is finite. EX: n=0 ( 3 4 )n = 1 = 4 but 1 3 n=1 1 n. 4 summable Necessary and sufficient for BIBO stability of an LI
More information