6.003: Signals and Systems
|
|
- Suzanna Pitts
- 6 years ago
- Views:
Transcription
1 6.003: Signals and Systems Z Transform September 22,
2 2 Concept Map: Discrete-Time Systems Multiple representations of DT systems. Delay R Block Diagram System Functional X + + Y Y Delay Delay X = H(R) = 1 1 R R 2 index shift Unit-Sample Response h[n]: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55,... Difference Equation y[n] = x[n] + y[n 1] + y[n 2] System Function H(z) = Y (z) X(z) = z 2 z 2 z 1
3 3 Concept Map: Discrete-Time Systems Relations among representations. Delay R Block Diagram System Functional X + + Y Y Delay Delay X = H(R) = 1 1 R R 2 index shift Unit-Sample Response h[n]: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55,... Difference Equation y[n] = x[n] + y[n 1] + y[n 2] System Function H(z) = Y (z) X(z) = z 2 z 2 z 1
4 4 Concept Map: Discrete-Time Systems Two interpretations of Delay. Delay R Block Diagram System Functional X + + Y Y Delay Delay X = H(R) = 1 1 R R 2 index shift Unit-Sample Response h[n]: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55,... Difference Equation y[n] = x[n] + y[n 1] + y[n 2] System Function H(z) = Y (z) X(z) = z 2 z 2 z 1
5 5 Concept Map: Discrete-Time Systems Relation between System Functional and System Function. Delay R Block Diagram System Functional X + + Y Y Delay Delay X = H(R) = 1 1 R R 2 index shift Unit-Sample Response h[n]: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55,... R 1 z Difference Equation y[n] = x[n] + y[n 1] + y[n 2] System Function H(z) = Y (z) X(z) = z 2 z 2 z 1
6 Check Yourself What is relation of System Functional to Unit-Sample Response Block Diagram Delay R System Functional X + + Y Y Delay Delay X = H(R) = 1 1 R R 2 index shift Unit-Sample Response h[n]: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55,... Difference Equation y[n] = x[n] + y[n 1] + y[n 2] 6 System Function H(z) = Y (z) X(z) = z 2 z 2 z 1
7 7 Check Yourself Expand functional in a series: Y 1 X = H(R) = 1 R R 2 H(R) = 1 +R +2R 2 +3R 3 +5R 4 +8R R R R R 2 R +R 2 R R 2 R 3 2R 2 +R 3 2R 2 2R 3 2R 4 3R 3 +2R 4 3R 3 3R 4 3R R R 2 = 1 + R + 2R2 + 3R 3 + 5R 4 + 8R R 6 +
8 8 Check Yourself Coefficients of series representation of H(R) 1 H(R) = 1 R R 2 = 1 + R + 2R2 + 3R 3 + 5R 4 + 8R R 6 + are the successive samples in the unit-sample response! h[n] : 1, 1, 2, 3, 5, 8, 13, 21, 34, 55,... If a system is composed of (only) adders, delays, and gains, then H(R) = h[0] + h[1]r + h[2]r 2 + h[3]r 3 + h[4]r 4 + = h[n]r n n We can write the system function in terms of unit-sample response!
9 9 Check Yourself What is relation of System Functional to Unit-Sample Response? Delay R Block Diagram System Functional X + + Y Y Delay Delay X = H(R) = 1 1 R R 2 H(R) = h[n]r n index shift Unit-Sample Response h[n]: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55,... Difference Equation y[n] = x[n] + y[n 1] + y[n 2] System Function H(z) = Y (z) X(z) = z 2 z 2 z 1
10 Check Yourself What is relation of System Function to Unit-Sample Response? Block Diagram Delay R System Functional X + + Y Y Delay Delay X = H(R) = 1 1 R R 2 H(R) = h[n]r n index shift Unit-Sample Response h[n]: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55,... Difference Equation y[n] = x[n] + y[n 1] + y[n 2] 10 System Function H(z) = Y (z) X(z) = z 2 z 2 z 1
11 11 Check Yourself Start with the series expansion of system functional: H(R) = h[n]r n n 1 Substitute R : z n H(z) = h[n]z n
12 12 Check Yourself What is relation of System Function to Unit-Sample Response? Delay R Block Diagram System Functional X + + Y Y Delay Delay X = H(R) = 1 1 R R 2 H(R) = h[n]r n index shift Unit-Sample Response h[n]: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55,... H(z) = h[n]z n Difference Equation y[n] = x[n] + y[n 1] + y[n 2] System Function H(z) = Y (z) X(z) = z 2 z 2 z 1
13 13 Check Yourself Start with the series expansion of system functional: H(R) = h[n]r n n 1 Substitute R : z n H(z) = h[n]z n Today: thinking about a system as a mathematical function H(z) rather than as an operator.
14 14 Z Transform We call the relation between H(z) and h[n] the Z transform. n H(z) = h[n]z n Z transform maps a function of discrete time n to a function of z. Although motivated by system functions, we can define a Z transform for any signal. n X(z) = x[n]z n= Notice that we include n < 0 as well as n > 0 bilateral Z transform (there is also a unilateral Z transform with similar but not identical properties).
15 15 Simple Z transforms Find the Z transform of the unit-sample signal. δ[n] n x[n] = δ[n] n X(z) = x[n]z = x[0]z 0 = 1 n=
16 16 Simple Z transforms Find the Z transform of a delayed unit-sample signal. x[n] n x[n] = δ[n 1] n 1 1 X(z) = x[n]z = x[1]z = z n=
17 17 Check Yourself What is the Z transform of the following signal. x[n] = ( 7 8 ) n u[n] n z z 1 3. z z 4. z z 1 5. none
18 18 Check Yourself What is the Z transform of the following signal. x[n] = ( 7 8 ) n u[n] n n n 7 n 7 n 1 X(z) = z u[n] = z = n= n=0 8 z
19 19 Check Yourself What is the Z transform of the following signal. 2 x[n] = ( 7 8 ) n u[n] n z z 1 3. z z 4. z z 1 5. none
20 20 Z Transform Pairs The signal x[n], which is a function of time n, maps to a Z transform X(z), which is a function of z. ( ) n 7 1 x[n] = u[n] X(z) = z For what values of z does X(z) make sense? The Z transform is only defined for values of z for which the defining sum converges. ( n n 7 ) ( n 7 ) n 1 X(z) = z u[n] = z = 8 8 n= 1 7 n=0 8 z 1 7 Therefore 8 z 1 < 1, i.e., z > 7 8.
21 21 Regions of Convergence The Z transform X(z) is a function of z defined for all z inside a Region of Convergence (ROC). ( ) n x[n] = u[n] X(z) = z > ; 8 8 z 1 7 ROC: z > 8
22 22 Z Transform Mathematics Based on properties of the Z transform. Linearity: if x 1 [n] X 1 (z) for z in ROC 1 and x 2 [n] X 2 (z) for z in ROC 2 then x 1 [n] + x 2 [n] X 1 (z) + X 2 (z) for z in (ROC 1 ROC 2 ). Let y[n] = x 1 [n] + x 2 [n] then n Y (z) = y[n]z n= n = (x 1 [n] + x 2 [n])z n= n n = x 1 [n]z + x 2 [n]z n= n= = X 1 (z) + X 2 (z)
23 23 Delay Property If x[n] X(z) for z in ROC then x[n 1] z 1 X(z) for z in ROC. We have already seen an example of this property. δ[n] 1 δ[n 1] z 1 More generally, n X(z) = x[n]z n= Let y[n] = x[n 1] then n n Y (z) = y[n]z = x[n 1]z n= n= Substitute m = n 1 Y (z) = x[m]z m 1 = z 1 X(z) m=
24 24 Rational Polynomials A system that can be described by a linear difference equation with constant coefficients can also be described by a Z transform that is a ratio of polynomials in z. b 0 y[n] + b 1 y[n 1] + b 2 y[n 2] + = a 0 x[n] + a 1 x[n 1] + a 2 x[n 2] + Taking the Z transform of both sides, and applying the delay property b 0 Y (z)+b 1 z 1 Y (z)+b 2 z 2 Y (z)+ = a 0 X(z)+a 1 z 1 X(z)+a 2 z 2 X(z)+ a 0 + a 1 z 1 + a 2 z 2 + H(z) = Y (z) = X(z) b 0 + b 1 z 1 + b 2 z 2 + a 0 z k + a 1 z k 1 + a 2 z k 2 + = b0 z k + b 1 z k 1 + b 2 z k 2 +
25 Rational Polynomials Applying the fundamental theorem of algebra and the factor theorem, we can express the polynomials as a product of factors. H(z) = a 0z k + a 1 z k 1 + a 2 z k 2 + b 0 z k + b 1 z k 1 + b 2 z k 2 + (z z 0 ) (z z 1 ) (z z k ) = (z p0 ) (z p 1 ) (z p k ) where the roots are called poles and zeros. 25
26 26 Rational Polynomials Regions of convergence for Z transform are delimited by circles in the Z-plane. The edges of the circles are at the poles. Example: x[n] = α n u[n] n n X(z) = α n u[n]z = α n z n= n=0 1 = αz 1 < 1 1 αz 1 ; z = z α ; z > α x[n] = α n u[n] n z z α ROC z-plane α
27 27 Check Yourself What DT signal has the following Z transform? z-plane z z 7 8 ; z < 7 8 ROC 7 8
28 28 Check Yourself Recall that we already know a function whose Z transform is the outer region. x[n] = ( 7 8 ) n u[n] n z z 7 8 ROC z-plane 7 8 What changes if the region changes? The original sum ( n 7 ) n X(z) = z 8 n=0 7 does not converge if z < 8.
29 29 Check Yourself The functional form is still the same, z H(z) = Y (z) = X(z) z 7 8. Therefore, the difference equation for this system is the same, y[n + 1] 8 7 y[n] = x[n + 1]. Convergence inside z = 7 8 corresponds to a left-sided (non-causal) response. Solve by iterating backwards in time: 8 y[n] = (y[n + 1] x[n + 1]) 7
30 Check Yourself Solve by iterating backwards in time: 8 y[n] = (y[n + 1] x[n + 1]) 7 Start at rest : n x[n] y[n] > n 8 n 7 ( ) n ( ) n 8 7 y[n] = ; n < 0 = u[ 1 n]
31 31 Check Yourself Plot y[n] = ( 7 8 ) n u[ 1 n] n z z 7 8 ROC z-plane 7 8
32 32 Check Yourself What DT signal has the following Z transform? z-plane z z 7 8 ; z < 7 8 ROC 7 8 y[n] = ( 7 8 ) n u[ 1 n] n
33 33 Check Yourself Two signals and two regions of convergence. ROC z-plane x[n] = ( 7 8 ) n u[n] n z z y[n] = ( 7 8 ) n u[ 1 n] n z z 7 8 ROC z-plane 7 8
34 34 Check Yourself Find the inverse transform of X(z) = 3z 2z 2 5z + 2 given that the ROC includes the unit circle.
35 35 Check Yourself Find the inverse transform of 3z X(z) = 2z 2 5z + 2 given that the ROC includes the unit circle. Expand with partial fractions: 3z 1 2 X(z) = = 2z 2 5z + 2 2z 1 z 2 Not a standard form!
36 36 Check Yourself Standard forms: ROC z-plane x[n] = ( 7 8 ) n u[n] n z z y[n] = ( 7 8 ) n u[ 1 n] n z z 7 8 ROC z-plane 7 8
37 37 Check Yourself Find the inverse transform of 3z X(z) = 2z 2 5z + 2 given that the ROC includes the unit circle. Expand with partial fractions: 3z 1 2 X(z) = = 2z 2 5z + 2 2z 1 z 2 Not a standard form! Expand it differently: as a standard form: 3z 2z z z z X(z) = = = 2z 2 5z + 2 2z 1 z 2 z 1 z 2 2 Standard form: a pole at 1 2 and a pole at 2.
38 Check Yourself Ratio of polynomials in z: 3z z z X(z) = = 2z2 5z + 2 z 1 2 z 2 a pole at 1 2 and a pole at 2. z-plane ROC Region of convergence is outside pole at 1 ( ) 2 n 1 x[n] = u[n] + 2 n u[ 1 n] 2 38 but inside pole at 2.
39 39 Check Yourself Plot. ( ) n 1 x[n] = u[n] + 2 n u[ 1 n] 2 x[n] n
40 40 Check Yourself Alternatively, stick with non-standard form: 3z 1 2 X(z) = = 2z 2 5z + 2 2z 1 z 2 Make it look more standard: 1 1 z 1 z X(z) = 2z 2 z z 1 z 2 2 Now ) n 1 1 x[n] = R u[n] + 2R {+2 n u[ 1 n]} 2 2 ( ) n = u[n 1] n 1 u[ n] 2 2 = ) n 1 u[n 1] 2 + {+2 n u[ n]} x[n] n
41 41 Check Yourself Alternative 3: expand as polynomials in z 1 : 3z 3z 1 X(z) = = 2z 2 5z z 1 + 2z = = 2 z 1 1 2z z 1 1 2z 1 Now ( ) n 1 x[n] = u[n] + 2 n u[ 1 n] 2 x[n] n
42 42 Check Yourself Find the inverse transform of X(z) = 3z 2z 2 5z + 2 given that the ROC includes the unit circle. x[n] n
43 43 Solving Difference Equations with Z Transforms Start with difference equation: y[n] 2 1 y[n 1] = δ[n] Take the Z transform of this equation: Y (z) 1 2 z 1 Y (z) = 1 Solve for Y (z): 1 Y (z) = z 1 Take the inverse Z transform (by recognizing the form of the transform): ( ) n 1 y[n] = u[n] 2
44 44 Inverse Z transform The inverse Z transform is defined by an integral that is not particularly easy to solve. Formally, 1 x[n] = X(z)z n 1 dz 2πj C where C represents a closed contour that circles the origin by running in a counterclockwise direction through the region of convergence. This integral is not generally easy to compute. This equation can be useful to prove theorems. There are better ways (e.g., partial fractions) to compute inverse transforms for the kinds of systems that we frequently encounter.
45 45 Properties of Z Transforms The use of Z Transforms to solve differential equations depends on several important properties. Property x[n] X(z) ROC Linearity ax 1 [n] + bx 2 [n] ax 1 (z) + bx 2 (z) (R 1 R 2 ) Delay x[n 1] z 1 X(z) R Multiply by n nx[n] dx(z) z dz R Convolve in n x 1 [m]x 2 [n m] X 1 (z)x 2 (z) (R 1 R 2 ) m=
46 46 Check Yourself ( ) 2 z Find the inverse transform of Y (z) = z 1 ; z > 1.
47 Check Yourself ( ) 2 z Find the inverse transform of Y (z) = ; z > 1. z 1 y[n] corresponds to unit-sample response of the right-sided system ( ) 2 ( ) 2 ( ) 2 Y z 1 1 = = 1 = X z 1 1 z 1 R = 1 + R + R 2 + R R + R 2 + R R R 2 R 3 1 R R 2 R 3 1 R R 2 R 3 R R 2 R 3 R 4 R 2 R 3 R 4 R 5 R 3 R 4 R 5 R 6 Y = 1 + 2R + 3R 2 + 4R 3 + = (n + 1)R n X n=0 y[n] = h[n] = (n + 1)u[n] 47
48 48 Check Yourself Table lookup method. ( ) 2 z Y (z) = y[n] =? z 1 z u[n] z 1
49 49 Properties of Z Transforms The use of Z Transforms to solve differential equations depends on several important properties. Property x[n] X(z) ROC Linearity ax 1 [n] + bx 2 [n] ax 1 (z) + bx 2 (z) (R 1 R 2 ) Delay x[n 1] z 1 X(z) R Multiply by n nx[n] dx(z) z dz R Convolve in n x 1 [m]x 2 [n m] X 1 (z)x 2 (z) (R 1 R 2 ) m=
50 50 Check Yourself Table lookup method. ( ) 2 z Y (z) = z 1 z z 1 z d ( ) ( ) 2 z 1 = z dz z 1 z 1 ( z z d ( )) ( ) 2 z z = dz z 1 z 1 y[n] =? u[n] nu[n] (n + 1)u[n + 1] = (n + 1)u[n]
51 51 Concept Map: Discrete-Time Systems Relations among representations. Delay R Block Diagram System Functional X + + Y Y Delay Delay X = H(R) = 1 1 R R 2 index shift Unit-Sample Response h[n]: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55,... Z transform Difference Equation y[n] = x[n] + y[n 1] + y[n 2] System Function H(z) = Y (z) X(z) = z 2 z 2 z 1
52 MIT OpenCourseWare Signals and Systems Fall 2011 For information about citing these materials or our Terms of Use, visit:
ELEG 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 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 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 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 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 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 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 informationFourier Transform 4: z-transform (part 2) & Introduction to 2D Fourier Analysis
052600 VU Signal and Image Processing Fourier Transform 4: z-transform (part 2) & Introduction to 2D Fourier Analysis Torsten Möller + Hrvoje Bogunović + Raphael Sahann torsten.moeller@univie.ac.at hrvoje.bogunovic@meduniwien.ac.at
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 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 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 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 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 informationDSP-I DSP-I DSP-I DSP-I
DSP-I DSP-I DSP-I DSP-I Digital Signal Processing I (8-79) Fall Semester, 005 OTES FOR 8-79 LECTURE 9: PROPERTIES AD EXAPLES OF Z-TRASFORS Distributed: September 7, 005 otes: This handout contains in outline
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 informationDetermine the Z transform (including the region of convergence) for each of the following signals:
6.003 Homework 4 Please do the following problems by Wednesday, March 3, 00. your answers: they will NOT be graded. Solutions will be posted. Problems. Z transforms You need not submit Determine the Z
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 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 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 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 (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 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 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 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 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 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 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 information23 Mapping Continuous-Time Filters to Discrete-Time Filters
23 Mapping Continuous-Time Filters to Discrete-Time Filters Solutions to Recommended Problems S23.1 (a) X,(z) = - 1-2z 2 Z i. (b) X 2 (z) = 0 (-3)"z = (-3)-"z" 1 z 3-'z < 1, n=o
More informationDigital Control & Digital Filters. Lectures 1 & 2
Digital Controls & Digital Filters Lectures 1 & 2, Professor Department of Electrical and Computer Engineering Colorado State University Spring 2017 Digital versus Analog Control Systems Block diagrams
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 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 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 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 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 informationGrades will be determined by the correctness of your answers (explanations are not required).
6.00 (Fall 2011) Final Examination December 19, 2011 Name: Kerberos Username: Please circle your section number: Section Time 2 11 am 1 pm 4 2 pm Grades will be determined by the correctness of your answers
More informationGrades will be determined by the correctness of your answers (explanations are not required).
6.00 (Fall 20) Final Examination December 9, 20 Name: Kerberos Username: Please circle your section number: Section Time 2 am pm 4 2 pm Grades will be determined by the correctness of your answers (explanations
More informationNotice the minus sign on the adder: it indicates that the lower input is subtracted rather than added.
6.003 Homework Due at the beginning of recitation on Wednesday, February 17, 010. Problems 1. Black s Equation Consider the general form of a feedback problem: + F G Notice the minus sign on the adder:
More informationz-transform Chapter 6
z-transform Chapter 6 Dr. Iyad djafar 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
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 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 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 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 information1. Z-transform: Initial value theorem for causal signal. = u(0) + u(1)z 1 + u(2)z 2 +
1. Z-transform: Initial value theorem for causal signal u(0) lim U(z) if the limit exists z U(z) u(k)z k u(k)z k k lim U(z) u(0) z k0 u(0) + u(1)z 1 + u(2)z 2 + CL 692 Digital Control, IIT Bombay 1 c Kannan
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 information6.003 (Fall 2011) Quiz #3 November 16, 2011
6.003 (Fall 2011) Quiz #3 November 16, 2011 Name: Kerberos Username: Please circle your section number: Section Time 2 11 am 3 1 pm 4 2 pm Grades will be determined by the correctness of your answers (explanations
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 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 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 informationNotes 22 largely plagiarized by %khc
Notes 22 largely plagiarized by %khc LTv. ZT Using the conformal map z e st, we can transfer our knowledge of the ROC of the bilateral laplace transform to the ROC of the bilateral z transform. Laplace
More informationA.1 THE SAMPLED TIME DOMAIN AND THE Z TRANSFORM. 0 δ(t)dt = 1, (A.1) δ(t)dt =
APPENDIX A THE Z TRANSFORM One of the most useful techniques in engineering or scientific analysis is transforming a problem from the time domain to the frequency domain ( 3). Using a Fourier or Laplace
More informationDepartment of Electrical and Computer Engineering Digital Speech Processing Homework No. 6 Solutions
Problem 1 Department of Electrical and Computer Engineering Digital Speech Processing Homework No. 6 Solutions The complex cepstrum, ˆx[n], of a sequence x[n] is the inverse Fourier transform of the complex
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 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 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 informationECE-S Introduction to Digital Signal Processing Lecture 4 Part A The Z-Transform and LTI Systems
ECE-S352-70 Introduction to Digital Signal Processing Lecture 4 Part A The Z-Transform and LTI Systems Transform techniques are an important tool in the analysis of signals and linear time invariant (LTI)
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 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 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 informationTHE INVERSE Z-TRANSFORM. 1. Lecture 6-47 minutes. Inv.rse -trondorm. -~~~ -' CkIn-)C ETC. Exam olp. b. i. ipole at g. nao 6.1
6 THE INVERSE Z-TRANSFORM 1. Lecture 6-47 minutes Inv.rse -trondorm -~~~ -' CkIn-)C ETC. A Exam olp b. i nao ipole at g C. 6.1 d. Correction (Fig. d.): IpI < 2 not IpI < 1/2. The region of convergence
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 information6.003: Signals and Systems
6.003: Signals and Systems Discrete-Time Systems September 13, 2011 1 Homework Doing the homework is essential to understanding the content. Weekly Homework Assigments tutor (exam-type) problems: answers
More information2.161 Signal Processing: Continuous and Discrete Fall 2008
IT OpenCourseWare http://ocw.mit.edu 2.161 Signal Processing: Continuous and Discrete all 2008 or information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. assachusetts
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. 清大電機系林嘉文 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 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 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 informationEquations in Quadratic Form
Equations in Quadratic Form MATH 101 College Algebra J. Robert Buchanan Department of Mathematics Summer 2012 Objectives In this lesson we will learn to: make substitutions that allow equations to be written
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 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 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 informationEC Signals and Systems
UNIT I CLASSIFICATION OF SIGNALS AND SYSTEMS Continuous time signals (CT signals), discrete time signals (DT signals) Step, Ramp, Pulse, Impulse, Exponential 1. Define Unit Impulse Signal [M/J 1], [M/J
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 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 informationThe z-transform and Discrete-Time LTI Systems
Chapter 4 The z-transform and Discrete-Time LTI Systems 4.1 INTRODUCTION In Chap. 3 we introduced the Laplace transform. In this chapter we present the z-transform, which is the discrete-time counterpart
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 informationChapter 13 Z Transform
Chapter 13 Z Transform 1. -transform 2. Inverse -transform 3. Properties of -transform 4. Solution to Difference Equation 5. Calculating output using -transform 6. DTFT and -transform 7. Stability Analysis
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 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 informationEE 225D LECTURE ON DIGITAL FILTERS. University of California Berkeley
University of California Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences Professors : N.Morgan / B.Gold EE225D Digital Filters Spring,1999 Lecture 7 N.MORGAN
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 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 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 informationECE 301 Division 1, Fall 2008 Instructor: Mimi Boutin Final Examination Instructions:
ECE 30 Division, all 2008 Instructor: Mimi Boutin inal Examination Instructions:. Wait for the BEGIN signal before opening this booklet. In the meantime, read the instructions below and fill out the requested
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 informationLecture 7: z-transform Properties, Sampling and Nyquist Sampling Theorem
EE518 Digital Signal Proessing University of Washington Autumn 21 Dept. of Eletrial Engineering ure 7: z-ransform Properties, Sampling and Nyquist Sampling heorem Ot 22, 21 Prof: J. Bilmes
More informationECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION
FINAL EXAMINATION 9:00 am 12:00 pm, December 20, 2010 Duration: 180 minutes Examiner: Prof. M. Vu Assoc. Examiner: Prof. B. Champagne There are 6 questions for a total of 120 points. This is a closed book
More informationGeometry Summer Assignment 2018
Geometry Summer Assignment 2018 The following packet contains topics and definitions that you will be required to know in order to succeed in Geometry this year. You are advised to be familiar with each
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 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 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 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 informationGATE EE Topic wise Questions SIGNALS & SYSTEMS
www.gatehelp.com GATE EE Topic wise Questions YEAR 010 ONE MARK Question. 1 For the system /( s + 1), the approximate time taken for a step response to reach 98% of the final value is (A) 1 s (B) s (C)
More informationReview of Fundamentals of Digital Signal Processing
Solution Manual for Theory and Applications of Digital Speech Processing by Lawrence Rabiner and Ronald Schafer Click here to Purchase full Solution Manual at http://solutionmanuals.info Link download
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 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 informationReview of Fundamentals of Digital Signal Processing
Chapter 2 Review of Fundamentals of Digital Signal Processing 2.1 (a) This system is not linear (the constant term makes it non linear) but is shift-invariant (b) This system is linear but not shift-invariant
More informationDigital Signal Processing Lecture 9 - Design of Digital Filters - FIR
Digital Signal Processing - Design of Digital Filters - FIR Electrical Engineering and Computer Science University of Tennessee, Knoxville November 3, 2015 Overview 1 2 3 4 Roadmap Introduction Discrete-time
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 informationhapter 8 Simulation/Realization 8 Introduction Given an nth-order state-space description of the form x_ (t) = f (x(t) u(t) t) (state evolution equati
Lectures on Dynamic Systems and ontrol Mohammed Dahleh Munther Dahleh George Verghese Department of Electrical Engineering and omputer Science Massachuasetts Institute of Technology c hapter 8 Simulation/Realization
More information