DIGITAL SIGNAL PROCESSING LECTURE 5

Similar documents
The Z-Transform. Content and Figures are from Discrete-Time Signal Processing, 2e by Oppenheim, Shafer, and Buck, Prentice Hall Inc.

Chapter 10: The Z-Transform Adapted from: Lecture notes from MIT, Binghamton University Dr. Hamid R. Rabiee Fall 2013

DEPARTMENT OF ELECTRICAL &ELECTRONICS ENGINEERING SIGNALS AND SYSTEMS. Assoc. Prof. Dr. Burak Kelleci. Spring 2018

Chapter 10: The Z-Transform Adapted from: Lecture notes from MIT, Binghamton University Hamid R. Rabiee Arman Sepehr Fall 2010

Frequency-domain Characteristics of Discrete-time LTI Systems

2.1.1 Definition The Z-transform of a sequence x [n] is simply defined as (2.1) X re x k re x k r

ELEG 5173L Digital Signal Processing Ch. 2 The Z-Transform

from definition we note that for sequences which are zero for n < 0, X[z] involves only negative powers of z.

Digital Signal Processing

The z Transform. The Discrete LTI System Response to a Complex Exponential

M2.The Z-Transform and its Properties

Definition of z-transform.

Infinite Series Sequences: terms nth term Listing Terms of a Sequence 2 n recursively defined n+1 Pattern Recognition for Sequences Ex:

Unit 1. Extending the Number System. 2 Jordan School District

UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION

Chapter 7 z-transform

Chapter 3. z-transform

FOURIER SERIES PART I: DEFINITIONS AND EXAMPLES. To a 2π-periodic function f(x) we will associate a trigonometric series. a n cos(nx) + b n sin(nx),

10.5 Power Series. In this section, we are going to start talking about power series. A power series is a series of the form

Lecture 3. Digital Signal Processing. Chapter 3. z-transforms. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev. 2016

Generalizing the DTFT. The z Transform. Complex Exponential Excitation. The Transfer Function. Systems Described by Difference Equations

SUTCLIFFE S NOTES: CALCULUS 2 SWOKOWSKI S CHAPTER 11

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

Taylor Polynomials. The Tangent Line. (a, f (a)) and has the same slope as the curve y = f (x) at that point. It is the best

[ 20 ] 1. Inequality exists only between two real numbers (not complex numbers). 2. If a be any real number then one and only one of there hold.

Z-Transform of a discrete time signal x(n) is defined as the power series

SM2H. Unit 2 Polynomials, Exponents, Radicals & Complex Numbers Notes. 3.1 Number Theory

Content: Essential Calculus, Early Transcendentals, James Stewart, 2007 Chapter 1: Functions and Limits., in a set B.

6.003 Homework #3 Solutions

 n. A Very Interesting Example + + = d. + x3. + 5x4. math 131 power series, part ii 7. One of the first power series we examined was. 2!

The z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j

POWER SERIES R. E. SHOWALTER

Chapter 7 Infinite Series

Surds, Indices, and Logarithms Radical

Discrete-Time Signals & Systems

=> PARALLEL INTERCONNECTION. Basic Properties LTI Systems. The Commutative Property. Convolution. The Commutative Property. The Distributive Property

1. (25 points) Use the limit definition of the definite integral and the sum formulas to compute. [1 x + x2

2. Infinite Series 3. Power Series 4. Taylor Series 5. Review Questions and Exercises 6. Sequences and Series with Maple

Exponential Moving Average Pieter P

82A Engineering Mathematics

Student Success Center Elementary Algebra Study Guide for the ACCUPLACER (CPT)

z-transform A generalization of the DTFT defined by

Chapter 7: The z-transform. Chih-Wei Liu

Review of Discrete-time Signals. ELEC 635 Prof. Siripong Potisuk

9.5. Alternating series. Absolute convergence and conditional convergence

b a 2 ((g(x))2 (f(x)) 2 dx

FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures

Quiz No. 1. ln n n. 1. Define: an infinite sequence A function whose domain is N 2. Define: a convergent sequence A sequence that has a limit

Test Info. Test may change slightly.

Finite-length Discrete Transforms. Chapter 5, Sections

Lincoln Land Community College Placement and Testing Office

UNIVERSITY OF BRISTOL. Examination for the Degrees of B.Sc. and M.Sci. (Level C/4) ANALYSIS 1B, SOLUTIONS MATH (Paper Code MATH-10006)

f(bx) dx = f dx = dx l dx f(0) log b x a + l log b a 2ɛ log b a.

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

FIR Filter Design: Part II

Mathematical Description of Discrete-Time Signals. 9/10/16 M. J. Roberts - All Rights Reserved 1

Digital Signal Processing, Fall 2006

Fast Fourier Transform 1) Legendre s Interpolation 2) Vandermonde Matrix 3) Roots of Unity 4) Polynomial Evaluation

CALCULUS BASIC SUMMER REVIEW

Z - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.

BC Calculus Review Sheet

1 Section 8.1: Sequences. 2 Section 8.2: Innite Series. 1.1 Limit Rules. 1.2 Common Sequence Limits. 2.1 Denition. 2.

Important Facts You Need To Know/Review:

COMM 602: Digital Signal Processing

CHAPTER 2: Boundary-Value Problems in Electrostatics: I. Applications of Green s theorem

{ } { S n } is monotonically decreasing if Sn

The z-transform can be used to obtain compact transform-domain representations of signals and systems. It

ELEG 4603/5173L Digital Signal Processing Ch. 1 Discrete-Time Signals and Systems

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science. BACKGROUND EXAM September 30, 2004.

EE Midterm Test 1 - Solutions

National Quali cations AHEXEMPLAR PAPER ONLY

Course 121, , Test III (JF Hilary Term)

Math 153: Lecture Notes For Chapter 1

Signal Processing in Mechatronics. Lecture 3, Convolution, Fourier Series and Fourier Transform

Probability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J.

The z Transform. The Discrete LTI System Response to a Complex Exponential

Limit of a function:

Graphing Review Part 3: Polynomials

10.5 Test Info. Test may change slightly.

Week 13 Notes: 1) Riemann Sum. Aim: Compute Area Under a Graph. Suppose we want to find out the area of a graph, like the one on the right:

Auto-correlation. Window Selection: Hamming. Hamming Filtered Power Spectrum. White Noise Auto-Covariance vs. Hamming Filtered Noise

is continuous at x 2 and g(x) 2. Oil spilled from a ruptured tanker spreads in a circle whose area increases at a

F x = 2x λy 2 z 3 = 0 (1) F y = 2y λ2xyz 3 = 0 (2) F z = 2z λ3xy 2 z 2 = 0 (3) F λ = (xy 2 z 3 2) = 0. (4) 2z 3xy 2 z 2. 2x y 2 z 3 = 2y 2xyz 3 = ) 2

Analog and Digital Signals. Introduction to Digital Signal Processing. Discrete-time Sinusoids. Analog and Digital Signals

Solution of EECS 315 Final Examination F09

CHAPTER 10 INFINITE SEQUENCES AND SERIES

SUTCLIFFE S NOTES: CALCULUS 2 SWOKOWSKI S CHAPTER 11

0 otherwise. sin( nx)sin( kx) 0 otherwise. cos( nx) sin( kx) dx 0 for all integers n, k.

Algebra II, Chapter 7. Homework 12/5/2016. Harding Charter Prep Dr. Michael T. Lewchuk. Section 7.1 nth roots and Rational Exponents

INTEGRATION TECHNIQUES (TRIG, LOG, EXP FUNCTIONS)

Review of the Riemann Integral

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

Module 18 Discrete Time Signals and Z-Transforms Objective: Introduction : Description: Discrete Time Signal representation

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations

denominator, think trig! Memorize the following two formulas; you will use them often!

8.3 Sequences & Series: Convergence & Divergence

Certain sufficient conditions on N, p n, q n k summability of orthogonal series

Students must always use correct mathematical notation, not calculator notation. the set of positive integers and zero, {0,1, 2, 3,...

Notes #3 Sequences Limit Theorems Monotone and Subsequences Bolzano-WeierstraßTheorem Limsup & Liminf of Sequences Cauchy Sequences and Completeness

BC Calculus Path to a Five Problems

Transcription:

DIGITAL SIGNAL PROCESSING LECTURE 5 Fll K8-5 th Semester Thir Muhmmd tmuhmmd_7@yhoo.com Cotet d Figures re from Discrete-Time Sigl Processig, e by Oppeheim, Shfer, d Buck, 999- Pretice Hll Ic.

The -Trsform Couterprt of the Lplce trsform for discrete-time sigls Geerlitio of the Fourier Trsform Fourier Trsform does ot eist for ll sigls Defiitio: X Compre to DTFT defiitio: X ( ) [ jω jω ( e ) [ e is comple vrible tht c be represeted s r e jω Substitutig e jω will reduce the -trsform to DTFT

The -trsform d the DTFT The -trsform is fuctio of the comple vrible Coveiet to describe o the comple -ple If we plot e jω for ω to π we get the uit circle Im ( ) jω X e Uit Circle r ω Re π π

Covergece of the -Trsform ( jω ) jω DTFT does ot lwys coverge [ DTFT does ot lwys coverge X e Emple: [ u[ for > does ot hve DTFT Comple vrible c be writte s r e jω so the - trsform ( jω ) jω [( ) ( X re re [ r ) covert to the DTFT of [ multiplied with epoetil sequece r e jω For certi choices of r the sum mybe mde fiite [ r - < e

Regio of Covergece (ROC) ROC: The set of vlues of for which the -trsform coverges The regio of covergece is mde of circles Im Re Emple: -trsform coverges for vlues of.5<r< ROC is show o the left I this emple the ROC icludes the uit circle, so DTFT eists

Regio of Covergece (ROC) Emple: Does't coverge for y r. DTFT eists. It hs fiite eergy. DTFT coverges i me squre sese. [ cos ( ω ) o Emple: Does't coverge for y r. [ It does t hve eve fiite eergy. But we defie useful DTFT with impulse fuctio. siω π c

Emple : Right-Sided Epoetil Sequece [ u [ X ( ) u [ ( ) For Covergece we require < Hece the ROC is defied s Im o Re < > Iside the ROC series coverges to ( ) ( ) X Regio outside the circle of rdius is the ROC Right-sided sequece ROCs eted outside circle

Emple : Left-Sided Epoetil Sequece [ [ [ [ u ( ) [ ( ) ( ) u X ROC < < < : < < < ( ) X

Emple : Two-Sided Epoetil Sequece ROC : < [ [ [ u - - - u < + + ROC : > > Im ( ) + X oo + +

Emple 4: Fiite Legth Sequece [ ( u [ u [ N ) [ N otherwise N N N X ( ) N N N ( ) ( ) ROC : N < <

Some commo -trsform pirs SEQUENCE TRANSFORM ROC δ [ ALL u [ u [ > < δ [ m m All ecept ( if m > ) ( if m < ) or <

Some commo -trsform pirs u u [ [ u u [ [ [ ω u[ ( ) ( ) [ cosω [ cosω ROC : > ROC : < ROC : > ROC : < cos ROC : > +

Some commo -trsform pirs [ si ω u [ [ siω [ cosω + ROC : > [ cos r cosω ω u ROC : r cosω + r [ r [ [ > r [ r ω u[ [ r siω [ r cosω si ROC : > + r r N otherwise N N ROC : >

Properties of The ROC of -Trsform The ROC is rig or disk cetered t the origi DTFT eists if d oly if the ROC icludes the uit circle The ROC cot coti y poles The ROC for fiite-legth sequece is the etire -ple ecept possibly d The ROC for right-hded sequece eteds outwrd from the outermost pole possibly icludig The ROC for left-hded sequece eteds iwrd from the iermost pole possibly icludig The ROC of two-sided sequece is rig bouded by poles The ROC must be coected regio A -trsform does ot uiquely determie sequece without specifyig the ROC

Stbility, Cuslity, d the ROC Cosider system with impulse respose h[ The -trsform H() d the pole-ero plot show below Without y other iformtio h[ is ot uiquely determied d > or <½ or ½< < If system stble ROC must iclude uit-circle: ½< < If system is cusl must be right sided: >

-Trsform Properties: Lierity Nottio Lierity [ X( ) ROC R [ + b [ X ( ) + bx ( ) ROC R R Note tht the ROC of combied sequece my be lrger th either ROC This would hppe if some pole/ero ccelltio occurs Emple: R [ u[ - u[ - N Both sequeces re right-sided Both sequeces hve pole Both hve ROC defied s > I the combied sequece the pole t ccels with ero t The combied ROC is the etire ple ecept

-Trsform Properties: Time Shiftig Here o is iteger [ o X ( ) ROC R o If positive the sequece is shifted right If egtive the sequece is shifted left The ROC c chge The ew term my dd or remove poles t or Emple ( ) X > 4 4 4 [ u [ - -

-Trsform Properties: Multiplictio by Epoetil ROC is scled by o o [ X( / o ) ROC o R All pole/ero loctios re scled If o is positive rel umber: -ple shriks or epds If o is comple umber with uit mgitude it rottes u[ ROC : > - - Emple: We kow the -trsform pir jω o jωo [ r cos( ω ) u[ ( re ) u[ + ( re ) u[ Let s fid the -trsform of o / jωo re / ( ) + > r X jω re o

-Trsform Properties: Differetitio dx ( [ ) ROC R d Emple: We wt the iverse -trsform of X( ) log ( + ) > Let s differetite to obti rtiol epressio dx d ( ) dx( ) + d + Mkig use of -trsform properties d ROC [ ( ) u[ [ ( ) u[

-Trsform Properties: Cojugtio * * [ X ( ) ROC R * X ( ) [ X ( ) [ [ ( ) [ ( ) [ { [ } X

-Trsform Properties: Time Reversl ROC is iverted [ X( / ) ROC Emple: [ u[ R Time reversed versio of - - - - ( ) < X

-Trsform Properties: Covolutio [ [ X( ) X( ) ROC : R R Covolutio i time domi is multiplictio i - domi Emple: Let s clculte the covolutio of [ u[ d [ u[ ( ) ROC : ( ) ROC : X > Multiplictios of -trsforms is Y ( ) X ( ) X ( ) X > ( )( ) ROC: if < ROC is > if > ROC is > Prtil frctiol epsio of Y() + y ( u u ) Y ( ) ssume ROC : [ [ [ >