Chapter 7: The z-transform
|
|
- Archibald Silas Manning
- 5 years ago
- Views:
Transcription
1 Chapter 7: The -Transform
2 ECE352 1 The -Transform - definition Continuous-time systems: e st H(s) y(t) = e st H(s) e st is an eigenfunction of the LTI system h(t), and H(s) is the corresponding eigenvalue. Discrete-time systems: x[n] = n h[n] y[n] y[n] = x[n] h[n] = = k= k= h[k] n k = n h[k]x[n k] k= h[k] k = n H() n is an eigenfunction of the LTI system h[n], and H() is the corresponding eigenvalue.
3 ECE352 2 The -Transform - definition (cont.) The transfer function: H() = Generally, let = re jω. Then, k= h[k] k. H(re jω ) = n= ( h[n] n ) e jωn. Thus, H() is the DTFT of h[n]r n. The inverse DTFT of H(re jω ) must be h[n]r n.
4 ECE352 3 The -Transform - definition (cont.) So we may write h[n]r n = 1 2π π π H(re jω )e jωn dω. = re jω d = jre jω dω. dω = 1 j 1 d. As Ω goes from π to π, traverses a circle of radius r in a counterclockwise direction. Thus, we may write h[n] = 1 2πj H() n 1 d
5 ECE352 4 The -Transform - definition (cont.) For an arbitrary signal x[n], the -transform and inverse -transform are expressed as X() = n= x[n] = 1 2πj x[n] n X() n 1 d We express this relationship between x[n] and X() as x[n] X()
6 ECE352 5 The -Transform - convergence A necessary condition for convergence: (absolute summability) n= x[n]r n < The range of r for which this condition is satisfied is termed the region of convergence (ROC). Complex number is represented as a location in a complex plane, termed the -plane. If x[n] is absolutely summable, then the DTFT of x[n] is obtained as X(e jω ) = X() =e jω The contour = e jω is termed the unit circle.
7 ECE352 6 The -Transform - poles and eros The most commonly encountered form of the -transform is a ratio of two polynomials in 1, as shown by the rational function X() = b 0 + b b M M a 0 + a a N N = b M k=1 (1 c k 1 ) N k=1 (1 d k 1 ) b = b 0 /a 0. c k : eros of X(). Denoted with the symbol in the plane. d k : poles of X(). Denoted with the symbol in the plane.
8 ECE352 7 The -Transform - Review of commonly used series Geometric series: Let s n = a + ar + ar ar n, then Proof: s n = a(1 rn+1 ) 1 r lim s n = n a, if r < 1 1 r s n = a + ar + ar ar n rs n = ar + ar ar n + ar n+1 s n rs n = a(1 r n+1 ) s n = a(1 rn+1 ) 1 r
9 ECE352 8 The -Transform - Review of commonly used series (cont.) Arithmetic progression: Let s n = a + (a + r) + (a + 2r) + + (a + nr), then Proof: s n = (n + 1)(a + (a + nr)) 2 lim n n =, if r > 0 lim n n =, if r < 0 s n = a + (a + r) + (a + 2r) + + (a + nr) s n = (a + nr) + (a + (n 1)r) + + (a + r) + a 2s n = (n + 1)(a + (a + nr)) s n = (n + 1)(a + (a + nr))/2
10 ECE352 9 The -Transform - Review of commonly used series (cont.) n=1 1 2 n = = π = n= = π n 2 = π2 6
11 ECE The -Transform - Convergence of commonly used series n=1 1 n p for p > 0: Convergent, if p > 1 Divergent, if p 1. Example: n + : divergent n 2 + : convergent
12 ECE The -Transform - Convergence of commonly used series (cont.) Ratio test: Suppose lim n a n+1 a n = r. r > 1: divergent r < 1: convergent r = 1: test gives no information Comparison test: Assume 0 a n b n, n. If b n is convergent a n is convergent (For convenience, we use b n to represent an infinite series in the notes) Example: Let a n = 2n 3n 3 1, b n = 1 n 2.
13 ECE bn is convergent. Thus, a n is convergent because n 1 n 3 1 3n 3 1 2n 3 a n b n.
14 ECE The -Transform - Convergence of commonly used series (cont.) Corollary of comparison test (limiting form): Suppose that a n a n > 0, b n > 0 and then lim = k > 0. n b n an convergent iff b n convergent Example: Let a n = a n n n 2 + 1, b n = 1 n. n 2 n = 1. lim = lim n b n n Because b n is divergent a n is divergent.
15 ECE The -Transform - Convergence of commonly used series (cont.) Necessary condition for convergence of a n : lim = a n = 0 n It is not a sufficient condition. For example, a n = 1 n, a n is divergent.
16 ECE The -Transform - Examples Determine the -transform of the following signals and depict the ROC and the locations of the poles and eros of X() in the -plane: x[n] = α n u[n] (causal signal) x[n] = α n u[ n 1] (anticausal signal) For signal x[n] = α n u[n]: X() = = α n u[n] n n= n=0 ( α ) n.
17 ECE The -Transform - Examples (cont.) This infinite series converges to X() = 1 1 α 1 =, for > α. α For signal x[n] = α n u[ n 1]: X() = = = n= = 1 1 n= k= 1 ( α n u[ n 1] n) ( α ) n ( α ) k ( α ) k = 1 k=0 1 1 α 1 = α, for < α.
18 ECE The -Transform - Examples (cont.) Observations: As bilateral Laplace transform, the relationship between x[n] and X() is not unique. The ROC differentiates the two transforms. We must know the ROC to determine the correct inverse -transform.
19 ECE The -Transform - Examples (cont.) Read Example 7.4, p 560. Problem 7.1(c), p 561 : Determine the -transform, the ROC, and the locations of poles and eros of X() for the following signal x[n] = ( ) n ( 3 u[ n 1] + 1 n u[n] 4 3) Using the results given in the previous two slides: ( ) n 3 u[ n 1] 4 ( 1 n u[n] 3) 3/4 + 1/3. Thus, X() = 3/ /3 = (2 5/12) ( 3/4)( + 1/3)
20 ECE Properties of the ROC As the Laplace transform, the ROC cannot contain any poles. ROC for a finite-duration signal includes the entire -plane, except possibly = 0 or = or both. Left-sided sequence: x[n] = 0 for n 0 (notice the difference between the left-sided signal for Laplace transform). Right-sided sequence: x[n] = 0 for n < 0 Two-sided sequence: a signal that has infinite duration in both the positive and negative directions.
21 ECE Properties of the ROC RSS: ROC is of the form > r + LSS: ROC is of the form < r TSS: ROC if of the form r + < < r where the boundaries r + and r are determined by the pole locations. See the figure next page.
22 ECE Properties of the ROC (cont.)
23 ECE Properties of the ROC - Examples Example 7.5, identify the ROC associated with the -transform for each of the following signals. x[n] = ( 1/2) n u[ n] + 2(1/4) n u[n] y[n] = ( 1/2) n u[n] + 2(1/4) n u[n] w[n] = ( 1/2) n u[ n] + 2(1/4) n u[ n]
24 ECE Properties of the ROC - Examples (cont.) For x[n], the -transform is written as X() = = 0 n= ( ) n ( 2) k + 2 k=0 n=0 n=0 ( 1 4 ( 1 4 ) n ) n The first sum converges for < 1 2. The second sum converges for > 1 4. Thus, the ROC is 1 4 < < 1 2. Summing the two geometric series: X() = /4.
25 ECE Observations: Properties of the ROC - Examples (cont.) The first term on the right side of [n] is a left-sided sequence. Its ROC is < r, where r is determined by its pole location. The second term on the right side of [n] is a right-sided sequence. Its ROC is > r +, where r + is determined by its pole location.
26 ECE Properties of the ROC - Examples (cont.) For y[n], both terms are right-sided sequences. Thus, the ROC is > r +, where r + is determined by the pole locations. Y () = n=0 ( ) n n=0 ( ) n 1 4 The first series converges for > 1/2 and the second series converges for > 1/4. Thus, the ROC is > 1/2, and we write Y () as Y () = + 1/ /4.
27 ECE Properties of the ROC - Examples (cont.) For w[n], both terms are left-sided sequences. Thus, the ROC is < r, where r is determined by the pole locations. W () = = 0 n= ( ) n ( 2) k + 2 k=0 0 n= (4) k k=0 ( ) n 1 4
28 ECE Properties of the ROC - Examples (cont.) The first series converges for < 1/2. The second series converges for < 1/4. Thus, the ROC is < 1/4, and we write W () as W () = The pole locations of sequences [n], y[n], w[n] are shown in the figure next slide.
29 ECE Properties of the ROC (cont.)
30 ECE Properties of the -transform Linearity Let x[n] X() (ROC R x ) and y[n] Y (). ax[n] + by[n] ax() + by (), with ROC at least R x Ry The ROC can be larger than the intersection if one or more terms in x[n] or y[n] cancel each other in the sum. In the -plane, this corresponds to a ero canceling a pole that defines one of the ROC boundaries.
31 ECE Properties of the -transform (cont.) Example: Example 7.5, p 567. Suppose x[n] = ( ) n ( ) n 1 3 u[n] u[ n 1] 2 2 X() = ( 1/2)( 3/2) with ROC 1/2 < < 3/2, and y[n] = ( ) n 1 u[n] 4 ( ) n 1 u[n] 2 Y () = 1 4 ( 1/4)( 1/2) with ROC > 1/2. Evaluate the -transform of ax[n] + by[n], where a and b are constants.
32 ECE Properties of the -transform (cont.) Using the linearity property, we have ax[n] + by[n] a ( 1/2)( 3/2) + b 1 4 ( 1/4)( 1/2) Must be careful in determining ROC. In general, the ROC is the intersection of individual ROCs. For some special cases, however, the ROC could be larger. For instance, let a = b = 1.
33 ECE Properties of the -transform (cont.) Then, ax() + by () = = = ( 1/2)( 3/2) ( 1/4)( 1/2) 5 4( 1/2) ( 1/4)( 1/2)( 3/2) 5 4 ( 1/4)( 3/2) The ROC can be verified to be 1/4 < < 3/2 because the pole-ero cancellation ( = 1/2), and the (1/2) n u[n] no longer presents.
34 ECE Properties of the -transform (cont.) Time reversal x[ n] X ( ) 1 with ROC 1 R x. If R x is of the form a < < b, the ROC of the reflected signal is 1/b < < 1/a. Time shift x[n n 0 ] n 0X() with ROC R x, except possibly = 0 and =. If n 0 > 0, n 0 introduces a pole = 0. If n 0 < 0, n 0 introduces a pole = ±.
35 ECE Properties of the -transform (cont.) Multiplication by an exponential sequence α n x[n] X ( α) with ROC α Rx. α R x implies that the ROC boundaries are multiplied by α. If α = 1, then the ROC is unchanged. Convolution x[n] y[n] X()Y () with ROC at least R x Ry. The ROC may be larger than the intersection of R x and R y if a pole-ero cancellation occurs in the product of X()Y ().
36 ECE Properties of the -transform (cont.) Differentiation in the -domain nx[n] d d X(), with ROC R x. Read Example 7.8, p 570. Example: Example 7.7, p 570. Find the -transform of x[n] = ( n ( ) n 1 u[n]) 2 ( ) n 1 u[ n]. 4
37 ECE Properties of the -transform: example Basic signal of first term: ( ) 1 n 2 u[n] > 1/2. +1/2, with ROC Applying the -domain differentiation property: n ( ) n 1 u[n] 2 d d + 1/2 = 1 2 ( + 1/2) 2, with ROC > 1/2
38 ECE Properties of the -transform: example (cont.) Applying time reversal property: ( 1 > 1/4. Thus, ( 1 4 < 4 4 ) n u[n] ) n u[ n] 1/ 1/ 1/ 1/4 = 4 4 1/4, with ROC with ROC Applying convolution property: x[n] ROC 1 2 < < 4. 2 ( 4)(+1/2) 2, with
Chapter 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 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 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 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 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 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 informationLecture 4: FT Pairs, Random Signals and z-transform
EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 4: T Pairs, Rom Signals z-transform Wed., Oct. 10, 2001 Prof: J. Bilmes
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 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 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 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 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 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 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 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 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 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. 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 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 30, 2018 Inverse z-transform Lecture Outline! z-transform " Tie up loose ends " Regions of convergence properties! Inverse z-transform " Inspection " Partial
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 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 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 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 informationECE 3620: Laplace Transforms: Chapter 3:
ECE 3620: Laplace Transforms: Chapter 3: 3.1-3.4 Prof. K. Chandra ECE, UMASS Lowell September 21, 2016 1 Analysis of LTI Systems in the Frequency Domain Thus far we have understood the relationship between
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 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 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 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 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 informationChapter 6: The Laplace Transform. Chih-Wei Liu
Chapter 6: The Laplace Transform Chih-Wei Liu Outline Introduction The Laplace Transform The Unilateral Laplace Transform Properties of the Unilateral Laplace Transform Inversion of the Unilateral Laplace
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 informationFrequency-Domain C/S of LTI Systems
Frequency-Domain C/S of LTI Systems x(n) LTI y(n) LTI: Linear Time-Invariant system h(n), the impulse response of an LTI systems describes the time domain c/s. H(ω), the frequency response describes the
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 informationAnalog vs. discrete signals
Analog vs. discrete signals Continuous-time signals are also known as analog signals because their amplitude is analogous (i.e., proportional) to the physical quantity they represent. Discrete-time signals
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 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 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 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 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 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 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 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 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 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 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 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 informationELC 4351: Digital Signal Processing
ELC 4351: Digital Signal Processing Liang Dong Electrical and Computer Engineering Baylor University liang dong@baylor.edu October 18, 2016 Liang Dong (Baylor University) Frequency-domain Analysis of LTI
More information3.2 Complex Sinusoids and Frequency Response of LTI Systems
3. Introduction. A signal can be represented as a weighted superposition of complex sinusoids. x(t) or x[n]. LTI system: LTI System Output = A weighted superposition of the system response to each complex
More informationDefinition of the Laplace transform. 0 x(t)e st dt
Definition of the Laplace transform Bilateral Laplace Transform: X(s) = x(t)e st dt Unilateral (or one-sided) Laplace Transform: X(s) = 0 x(t)e st dt ECE352 1 Definition of the Laplace transform (cont.)
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 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 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 informationLecture 3 January 23
EE 123: Digital Signal Processing Spring 2007 Lecture 3 January 23 Lecturer: Prof. Anant Sahai Scribe: Dominic Antonelli 3.1 Outline These notes cover the following topics: Eigenvectors and Eigenvalues
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 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 informationELEG 305: Digital Signal Processing
ELEG 305: Digital Signal Processing Lecture 1: Course Overview; Discrete-Time Signals & Systems Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 2008 K. E.
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 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 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 informationDiscrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is
Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section 5. 3 The (DT) Fourier transform (or spectrum) of x[n] is X ( e jω) = n= x[n]e jωn x[n] can be reconstructed from its
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 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 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 informationThe Laplace Transform
The Laplace Transform Introduction There are two common approaches to the developing and understanding the Laplace transform It can be viewed as a generalization of the CTFT to include some signals with
More informationDigital Signal Processing
Digital Signal Processing Discrete-Time Signals and Systems (2) Moslem Amiri, Václav Přenosil Embedded Systems Laboratory Faculty of Informatics, Masaryk University Brno, Czech Republic amiri@mail.muni.cz
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 informationSignals and Systems. VTU Edusat program. By Dr. Uma Mudenagudi Department of Electronics and Communication BVCET, Hubli
Signals and Systems Course material VTU Edusat program By Dr. Uma Mudenagudi uma@bvb.edu Department of Electronics and Communication BVCET, Hubli-580030 May 22, 2009 Contents 1 Introduction 1 1.1 Class
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 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 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 informationEach problem is worth 25 points, and you may solve the problems in any order.
EE 120: Signals & Systems Department of Electrical Engineering and Computer Sciences University of California, Berkeley Midterm Exam #2 April 11, 2016, 2:10-4:00pm Instructions: There are four questions
More informationECE 301 Division 1, Fall 2006 Instructor: Mimi Boutin Final Examination
ECE 30 Division, all 2006 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 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 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 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 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 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 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 informationDefinition of Discrete-Time Fourier Transform (DTFT)
Definition of Discrete-Time ourier Transform (DTT) {x[n]} = X(e jω ) + n= {X(e jω )} = x[n] x[n]e jωn Why use the above awkward notation for the transform? X(e jω )e jωn dω Answer: It is consistent with
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 informationParametric Signal Modeling and Linear Prediction Theory 1. Discrete-time Stochastic Processes (cont d)
Parametric Signal Modeling and Linear Prediction Theory 1. Discrete-time Stochastic Processes (cont d) Electrical & Computer Engineering North Carolina State University Acknowledgment: ECE792-41 slides
More informationLTI Systems (Continuous & Discrete) - Basics
LTI Systems (Continuous & Discrete) - Basics 1. A system with an input x(t) and output y(t) is described by the relation: y(t) = t. x(t). This system is (a) linear and time-invariant (b) linear and time-varying
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 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 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 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 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 informationSignals and Systems Profs. Byron Yu and Pulkit Grover Fall Midterm 2 Solutions
8-90 Signals and Systems Profs. Byron Yu and Pulkit Grover Fall 08 Midterm Solutions Name: Andrew ID: Problem Score Max 8 5 3 6 4 7 5 8 6 7 6 8 6 9 0 0 Total 00 Midterm Solutions. (8 points) Indicate whether
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 informationThe Discrete-Time Fourier
Chapter 3 The Discrete-Time Fourier Transform 清大電機系林嘉文 cwlin@ee.nthu.edu.tw 03-5731152 Original PowerPoint slides prepared by S. K. Mitra 3-1-1 Continuous-Time Fourier Transform Definition The CTFT of
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 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 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 informationNew Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Fall 2015 Final Exam
New Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Fall 2015 Name: Solve problems 1 3 and two from problems 4 7. Circle below which two of problems 4 7 you
More informationEC6303 SIGNALS AND SYSTEMS
EC 6303-SIGNALS & SYSTEMS UNIT I CLASSIFICATION OF SIGNALS AND SYSTEMS 1. Define Signal. Signal is a physical quantity that varies with respect to time, space or a n y other independent variable.(or) It
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 informationso mathematically we can say that x d [n] is a discrete-time signal. The output of the DT system is also discrete, denoted by y d [n].
ELEC 36 LECURE NOES WEEK 9: Chapters 7&9 Chapter 7 (cont d) Discrete-ime Processing of Continuous-ime Signals It is often advantageous to convert a continuous-time signal into a discrete-time signal so
More informationECE 301 Fall 2011 Division 1 Homework 5 Solutions
ECE 301 Fall 2011 ivision 1 Homework 5 Solutions Reading: Sections 2.4, 3.1, and 3.2 in the textbook. Problem 1. Suppose system S is initially at rest and satisfies the following input-output difference
More informationLecture 7 - IIR Filters
Lecture 7 - IIR Filters James Barnes (James.Barnes@colostate.edu) Spring 204 Colorado State University Dept of Electrical and Computer Engineering ECE423 / 2 Outline. IIR Filter Representations Difference
More information