Lecture 2 OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE
|
|
- Lynn Sanders
- 6 years ago
- Views:
Transcription
1 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
2 Linear constant coefficient difference equations Discrete time systems can be finite impulse response or infinite impulse response. Finite impulse response systems have a that dies out over time. Infinite impulse response systems will continue to give an output indefinitely when they receive an impulse at the input (like oscillators). We are interested in infinite impulse response (IIR) systems which can be described using linear constant coefficient difference equations.
3 Recursive difference equations y[n-] is called the state of the system. x[n] is the system input.
4 Recursive implementation of the system
5
6
7 If y[-]=, then the system is linear in the general sense. The system output can be calculated by either convolving with h[n] or using the difference equation. If y[-] is not zero, it is linear in a more general sense, involving linearity with respect to both initial conditions and input.
8
9
10
11 Why z-transform? Need to analyze some signals which don t have a Fourier Transform (Fourier sum/integral does not converge). A better notation to deal with transient signals.
12 z-transform from Laplace transform For a sampled signal x(m) = x(mt s ), the Laplace transform becomes s st sm X e x t e dt x m e ( ) () ( ) X ( z) = x( m) z m = = m= m= begins at. One sided z transform, sum m ( ) x( m) z X z = m= Two sided z transform, sum begins at negative infinity.
13 Fourier and z- Transforms Compare the z-transform to the discrete time Fourier transform (DTFT). forward reverse Discrete time i n iωn X ω = xne ω xn = X( ) e d Fourier transform ( ) [ ] [ ] ω ω n= 2π 2π (DTFT) z-transform m m X ( z ) = x ( m ) z x ( m ) = X ( z ) z dz 2π j m= where C is any positively oriented simple C closed curve that lies in the R< < z region and winds around the origin The DTFT is the z-transform evaluated on the unit circle, where z =.
14 z-transform from Laplace transform Laplace Transform: The s stands for a growing or decaying exponential, good for analyzing transient signals. st ( σ+ jω)t σ t jωt e = e = e e z-transform: The z stands for a growing or decaying exponential, good for analyzing transient signals. ( + j ) z = e = e = e e m sm σ ω m σ m jωm
15 Laplace Transform Plane s-plane jω 3π/2 π π/2 σ π/2 π 3π/2 π= π π/2 z-plane s σ jω z = e = e e Inside of the unit circle on the z-plane corresponds to the left half plane on the s-plane. The unit circle on the z-plane corresponds to the imaginary axis on the s-plane The outside of the unit circle on the z-plane corresponds to the right half plane on the s plane. π/2
16 In practice jω axis on s plane (unit circle, z =, on z-plane) ) sin(t) z = right half plane on s plane (outside unit circle, z >, on z-plane) 2 e -t/2 sin(t) z < left half plane on s plane (inside unit circle, z <, on z-plane) e t/2 sin(t) z >
17 Frequency mapping on the z-plane An angle of 2π, once round the unit circle, corresponds to a frequency of F s Hz where F s is the sampling frequency. Hence a frequency of f Hz corresponds to an angle φ given by 2π ϕ = f radians F s For example, at a sampling rate of F s = 4 khz, a frequency of 5 khz corresponds to an angle of 2π ϕ = 5 =.5 π radians = 45 degrees 4
18 Im X(z) ( ) z = e jω ω Re Re Im X(e jω ) π π ω
19 The region of convergence (ROC) of X(z) is the set of all the values of z for which X(z) ( ) attains a finite computable value. That is, the ROC is all z for which X(z) <. In general the ROC consists of the area between cocentric rings.
20 Example Find the z-transform and the region of convergence for the following function: ( ) ( ) { m = x m = δ m = m SOLUTION: m ( ) ( ) X z = x m z = z = m= Since X(z)= for all z, the region of convergence is the whole z- plane.
21 Example Find the z-transform and the region of convergence for the following function: ( ) ( ) { = m= k x m δ m k = m k SOLUTION: ( ) ( ) δ ( ) X z = x m z = z = z m= m k k X(z) is finite-valued for all the values of z except for z=. The region of convergence is the whole z-plane except the origin z=.
22 Example Find the z-transform and the region of convergence for the following function: ( ) ( ) { = m= k x m δ m+ k = m k SOLUTION: ( ) ( ) δ ( ) X z = x m z = z = z m= m k k X(z) is finite-valued for all the values of z except for z=. The region of convergence is the whole z-plane except the point z=.
23 Example Find the z-transform and the region of convergence for the following function: ( ) ( ) ( ) { = m= ± k x m δ m+ k + δ m k = m ± k SOLUTION: ( ) ( ) δ ( ) δ ( ) X z = x m z = z + z = z + z m= m k k k k X(z) is finite-valued for all the values of z except for z= and z=. The region of convergence is the whole z-plane except the points z= and z=.
24 Example Determine the z-transform and region of convergence of SOLUTION: ( ) x m m α m = m < m α X z = x m z = z = α z m= m= m= z m m m = ( ) ( ) α α if < z otherwise. The region of convergence (ROC) is z > α jω ROC = { z = re r > >α }
25 Example Determine the z-transform and region of convergence of SOLUTION: ( ) x( ) X z ( ) x m m = m α m < z m m if < m α z z = m z α = = = m= m= z m= α α otherwise. z α if z < α if z < α ( ) ( = z = α z ) α otherwise. otherwise. < α The region of convergence (ROC) is z
26 Example Determine the z-transform and region of convergence of ( ) x m α = β m m m m < SOLUTION: m m m m z ( ) ( ) X z β α α = x m z = + = + m= m= z m= z m= β m= z + if z > α and z < β = ( α z ) ( β z ) otherwise. The region of convergence (ROC) is α < z < β m
27 Properties of the z transform Linearity Z ax n by n ax z by z Time shifting ( ) + y ( ) = ( ) + ( ) Z d x ( n d ) = z X ( z ) Note that z delays the signal by unit and z k by k units, and z+ is a noncausal unit time advance, and z+k advances a signal in time by k units. x( n) x d ( n d) z x( n) d z ( + d) x n time delay time advance
28 Example Determine the z-transform and region of convergence of ( ) x m = m k α m m < k SOLUTION: ( ) m m k m k m k m k k α z α z z ( ) = ( ) = = = ( αz ) X z x m z z m= m= k m= k m= k z = ( α z ) if α z < otherwise. The region of convergence (ROC) is α < z m
29 Properties of the z transform Multiplication by an Exponential Sequence (Frequency Modulation) ( ) X( z ) n axn = Z a But multiplication will affect the region of convergence and all the pole-zero locations will be scaled by a factor of a. Time shifting ( )* ( ) ( ) ( ) Z x n y n = X z Y z z-domain differentiation ( ) Z nx n = z dx ( z) dz
30 Properties of the z transform Conjugation Time reversal Z x* ( n ) = X * ( z* ) Z x ( n ) = X ( z ) z / R x Real and imaginary parts Z Re x ( n ) = X ( z ) + X * ( z* ) 2 Z Im x( n) = X ( z) X *( z* ) 2 j Initial value x ( ) = limx ( z) z
31 Transfer functions, poles, zeros Consider the following system x( m) h N M = k + k k= k= ( ) ( ) ( ) y m a y m k b x m k To find the transfer function, take the z transform of both sides. ( ) H z N M = k + k= k= ( ) k k ( ) ( ) Y z a z Y z b z X z ( ) ( ) Y z b + bz + + b z = = = X z a z a z M M k= N N N k M k = bz k k k az k
32 Finding the poles and zeros Rewriting this M ( ) M N ( ) Y z b bz b z H ( z) = = X z az an z M b M b M M z + z bz b + + b = N N N z z a z a ( z z)( z z2) ( z z ) ( )( ) ( ) bz = = M M M+ N k = Gz N N z z p z p 2 z p N N M k = ( z z ) zeros k ( z p ) k Gain poles
33 Finding the poles and zeros If N > M, H(z = ) = and there is a zero at z =, if N < M, H(z ( = ) = and there is a pole at z =. A zero exists at infinity if H(z = ) = and a pole exists at infinity if H(z = ) =. For a system with real-valued coefficients a k and b k, complexvalued poles or zeros always occur in complex conjugate pairs. For a stable system the poles should have a magnitude of less than one and lie inside the unit circle. The transfer function H(z) an be represented using the polezero plot on the complex plane. In the pole-zero plot, the location of the poles are marked by crosses ( ) and the locations of the zeros are marked by circles (O).
34 Example Find the z-transform and plot the pole-zero diagram of the following right-sided discrete-time signal 8.8 m.6 α m x( m) =.4 m <.2 SOLUTION: m m m = z = α z = = m= m= α z z ( ) x ( m ) X z ( ) ( α ) z The region of convergence (ROC) is α < z
35 Example: The Response of a Single (First-Order) Zero or Pole Find the z-transform and plot the pole-zero diagram of the following right-sided discrete-time signal x(m) SOLUTION: ( ) = α ( ) + ( ) y m x m x m ( ) ( ) ( ) ( )( = α + = + α ) Y z z X z X z X z z ( ) Y( z) X ( z) ( ) = z H z = = ( +α z ) H z + α = z = α is a zero. z - + α y(m) To find which frequencies the zero corresponds to, substitute z=e jω. j j H e ω = +αe ω ( ) ( )
36 ( ) ( ) ω = z = H = + α when α =, H () = ω = π z = H = α when α =+, H( ) =
37 Finding the poles and zeros Causal Systems : ROC extends outward from the outermost pole. Stable (BIBO stable) Systems : ROC includes the unit circle. Example: consider the system Im[z] [] yn ( ) = ayn ( ) + xn ( ) Y ( z ) = az Y ( z ) + X ( z ) Y( z) = Re[z] X z az ( ) ( ) = a n u( n) y n a
38 Determination of Frequency Response from pole-zero pattern A LTI system is completely characterized by its pole-zero pattern. You can tell if a filter is high pass or low pass by just looking at its poles and zeros as follows: Example ( ) = ( z p )( z p ) H z z z 2 The red vectors are the vectors (z p ) and (z p 2 ) which are the denominator of H(z). The green vector is the vector (z z ) which is the numerator of H(z). z Im[z] [] p p 2 e jω Re[z]
39 Determination of Frequency Response from pole-zero pattern Example (continued) ( ) H z The magnitude of the green vector will be constant no = z z ( z p )( z p ) 2 Im[z] [] matter where we look on the jω unit circle. The magnitude of the red - vectors are smallest for points close to (+i) on the real axis. This means that H(z) is smallest for low frequencies (around +j) and largest for high frequencies (around +j). H(z) is a low pass filter. z p p 2 e Re[z]
40 Bibliography Notes on the z-transform by Saeed Vaseghi proc essing.htm
ESE 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. 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 information2.161 Signal Processing: Continuous and Discrete Fall 2008
MIT OpenCourseWare http://ocw.mit.edu 2.161 Signal Processing: Continuous and Discrete Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. Massachusetts
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationA system that is both linear and time-invariant is called linear time-invariant (LTI).
The Cooper Union Department of Electrical Engineering ECE111 Signal Processing & Systems Analysis Lecture Notes: Time, Frequency & Transform Domains February 28, 2012 Signals & Systems Signals are mapped
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 informationDigital Signal Processing Lecture 3 - Discrete-Time Systems
Digital Signal Processing - Discrete-Time Systems Electrical Engineering and Computer Science University of Tennessee, Knoxville August 25, 2015 Overview 1 2 3 4 5 6 7 8 Introduction Three components of
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationECE-314 Fall 2012 Review Questions for Midterm Examination II
ECE-314 Fall 2012 Review Questions for Midterm Examination II First, make sure you study all the problems and their solutions from homework sets 4-7. Then work on the following additional problems. Problem
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 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 informationTransform analysis of LTI systems Oppenheim and Schafer, Second edition pp For LTI systems we can write
Transform analysis of LTI systems Oppenheim and Schafer, Second edition pp. 4 9. For LTI systems we can write yœn D xœn hœn D X kd xœkhœn Alternatively, this relationship can be expressed in the z-transform
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 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 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 informationDetailed Solutions to Exercises
Detailed Solutions to Exercises Digital Signal Processing Mikael Swartling Nedelko Grbic rev. 205 Department of Electrical and Information Technology Lund University Detailed solution to problem E3.4 A
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 information2. Typical Discrete-Time Systems All-Pass Systems (5.5) 2.2. Minimum-Phase Systems (5.6) 2.3. Generalized Linear-Phase Systems (5.
. Typical Discrete-Time Systems.1. All-Pass Systems (5.5).. Minimum-Phase Systems (5.6).3. Generalized Linear-Phase Systems (5.7) .1. All-Pass Systems An all-pass system is defined as a system which has
More informationVoiced Speech. Unvoiced Speech
Digital Speech Processing Lecture 2 Homomorphic Speech Processing General Discrete-Time Model of Speech Production p [ n] = p[ n] h [ n] Voiced Speech L h [ n] = A g[ n] v[ n] r[ n] V V V p [ n ] = u [
More informationDigital Filters Ying Sun
Digital Filters Ying Sun Digital filters Finite impulse response (FIR filter: h[n] has a finite numbers of terms. Infinite impulse response (IIR filter: h[n] has infinite numbers of terms. Causal filter:
More informationLecture 9 Infinite Impulse Response Filters
Lecture 9 Infinite Impulse Response Filters Outline 9 Infinite Impulse Response Filters 9 First-Order Low-Pass Filter 93 IIR Filter Design 5 93 CT Butterworth filter design 5 93 Bilinear transform 7 9
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 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 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 information信號與系統 Signals and Systems
Spring 2013 Flowchart Introduction (Chap 1) LTI & Convolution (Chap 2) NTUEE-SS10-Z-2 信號與系統 Signals and Systems Chapter SS-10 The z-transform FS (Chap 3) Periodic Bounded/Convergent CT DT FT Aperiodic
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 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 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 informationDamped Oscillators (revisited)
Damped Oscillators (revisited) We saw that damped oscillators can be modeled using a recursive filter with two coefficients and no feedforward components: Y(k) = - a(1)*y(k-1) - a(2)*y(k-2) We derived
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 informationMassachusetts Institute of Technology Department of Electrical Engineering and Computer Science. Fall Solutions for Problem Set 2
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science Issued: Tuesday, September 5. 6.: Discrete-Time Signal Processing Fall 5 Solutions for Problem Set Problem.
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 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 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 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 information! Introduction. ! Discrete Time Signals & Systems. ! Z-Transform. ! Inverse Z-Transform. ! Sampling of Continuous Time Signals
ESE 531: Digital Signal Processing Lec 25: April 24, 2018 Review Course Content! Introduction! Discrete Time Signals & Systems! Discrete Time Fourier Transform! Z-Transform! Inverse Z-Transform! Sampling
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 informationQuestion Paper Code : AEC11T02
Hall Ticket No Question Paper Code : AEC11T02 VARDHAMAN COLLEGE OF ENGINEERING (AUTONOMOUS) Affiliated to JNTUH, Hyderabad Four Year B. Tech III Semester Tutorial Question Bank 2013-14 (Regulations: VCE-R11)
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 informationPS403 - Digital Signal processing
PS403 - Digital Signal processing 6. DSP - Recursive (IIR) Digital Filters Key Text: Digital Signal Processing with Computer Applications (2 nd Ed.) Paul A Lynn and Wolfgang Fuerst, (Publisher: John Wiley
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 informationFinal Exam of ECE301, Prof. Wang s section 1 3pm Tuesday, December 11, 2012, Lily 1105.
Final Exam of ECE301, Prof. Wang s section 1 3pm Tuesday, December 11, 2012, Lily 1105. 1. Please make sure that it is your name printed on the exam booklet. Enter your student ID number, e-mail address,
More information/ (2π) X(e jω ) dω. 4. An 8 point sequence is given by x(n) = {2,2,2,2,1,1,1,1}. Compute 8 point DFT of x(n) by
Code No: RR320402 Set No. 1 III B.Tech II Semester Regular Examinations, Apr/May 2006 DIGITAL SIGNAL PROCESSING ( Common to Electronics & Communication Engineering, Electronics & Instrumentation Engineering,
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 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 information( ) John A. Quinn Lecture. ESE 531: Digital Signal Processing. Lecture Outline. Frequency Response of LTI System. Example: Zero on Real Axis
John A. Quinn Lecture ESE 531: Digital Signal Processing Lec 15: March 21, 2017 Review, Generalized Linear Phase Systems Penn ESE 531 Spring 2017 Khanna Lecture Outline!!! 2 Frequency Response of LTI System
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 informationUNIVERSITY OF OSLO. Faculty of mathematics and natural sciences. Forslag til fasit, versjon-01: Problem 1 Signals and systems.
UNIVERSITY OF OSLO Faculty of mathematics and natural sciences Examination in INF3470/4470 Digital signal processing Day of examination: December 1th, 016 Examination hours: 14:30 18.30 This problem set
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 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 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 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 informationRoll No. :... Invigilator s Signature :.. CS/B.Tech (EE-N)/SEM-6/EC-611/ DIGITAL SIGNAL PROCESSING. Time Allotted : 3 Hours Full Marks : 70
Name : Roll No. :.... Invigilator s Signature :.. CS/B.Tech (EE-N)/SEM-6/EC-611/2011 2011 DIGITAL SIGNAL PROCESSING Time Allotted : 3 Hours Full Marks : 70 The figures in the margin indicate full marks.
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 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 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 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 informationx[n] = x a (nt ) x a (t)e jωt dt while the discrete time signal x[n] has the discrete-time Fourier transform x[n]e jωn
Sampling Let x a (t) be a continuous time signal. The signal is sampled by taking the signal value at intervals of time T to get The signal x(t) has a Fourier transform x[n] = x a (nt ) X a (Ω) = x a (t)e
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 informationEECE 301 Signals & Systems Prof. Mark Fowler
EECE 30 Signals & Systems Prof. Mark Fowler Note Set #26 D-T Systems: Transfer Function and Frequency Response / Finding the Transfer Function from Difference Eq. Recall: we found a DT system s freq. resp.
More informationDiscrete Time Fourier Transform
Discrete Time Fourier Transform Recall that we wrote the sampled signal x s (t) = x(kt)δ(t kt). We calculate its Fourier Transform. We do the following: Ex. Find the Continuous Time Fourier Transform of
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 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 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 informationIf every Bounded Input produces Bounded Output, system is externally stable equivalently, system is BIBO stable
1. External (BIBO) Stability of LTI Systems If every Bounded Input produces Bounded Output, system is externally stable equivalently, system is BIBO stable g(n) < BIBO Stability Don t care about what unbounded
More informationDigital Signal Processing, Homework 1, Spring 2013, Prof. C.D. Chung
Digital Signal Processing, Homework, Spring 203, Prof. C.D. Chung. (0.5%) Page 99, Problem 2.2 (a) The impulse response h [n] of an LTI system is known to be zero, except in the interval N 0 n N. The input
More information