Z Transforms. Lesson 20 6DT. BME 333 Biomedical Signals and Systems - J.Schesser

Size: px
Start display at page:

Download "Z Transforms. Lesson 20 6DT. BME 333 Biomedical Signals and Systems - J.Schesser"

Transcription

1 Z rasforms Lesso 6D BME 333 Biomedical Sigals ad Systems

2 Z rasforms A Defiitio I a sese similar to the L excet it is associated with discrete time fuctios. Let s assume we hae a cotiuous time fuctio, f t, ad let s create a discrete time fuctio from it, f by samlig it at a rate. We would the hae: f f t t aig the L of f we would hae: st st Fs f f t t e dt f t t e dt f e s BME 333 Biomedical Sigals ad Systems

3 Z rasforms A Defiitio Cotiued Relacig e s with we hae the defiitio of the - trasform: F f Note that this is a -sided summatio. Sice may sigals are ero for t<, we ca also defie a -sided -trasform as: F f Note that both ersios F ca be writte i closed form whe the series coerges BME 333 Biomedical Sigals ad Systems

4 Z-trasform -sided Calculatios - Examles First, recall that the geometric series Examle, let: Ar coerges to f e a for ; otherwise F e a e a ea Usig the result of a geometric series: F ea e a A -r roided that r. ad will coerge whe ea or e a BME 333 Biomedical Sigals ad Systems 3

5 Examle, let: a f e for ; otherwise Examles Cotiued a a F e e let m- we hae: am m a m a e e e where m a a e e Usig the result of a geometric series: a F e a a e e a ad will coerge whe e or e We see that we hae to roide a regio of coergece, i additio, to the fuctio F to comletely defie the -trasform of a f. BME 333 Biomedical Sigals ad Systems a 4

6 -sided -trasforms Useful sice most fuctios we use are ero for t<. F f BME 333 Biomedical Sigals ad Systems 5

7 -sided -trasforms Some examles see. 396 ables 6D. & 6D. for more: Uit samlig fuctio for, otherwise; F u for, otherwise F coerges for u coerges for u coerges for 3 BME 333 Biomedical Sigals ad Systems 6

8 u Proof 3 4 { 3 4 } 3 { 3 } 3 { } { } { } { } { } { } { } coerges for { 3 4 } { 3 } BME 333 Biomedical Sigals ad Systems 7

9 -sided -trasforms Some examles see. 396 ables 6D. & 6D. for more: e a u coerges for ea a e a u a a a coerges for a a BME 333 Biomedical Sigals ad Systems 8

10 Proerties of -trasforms Z{f f } F F Z{af } af Z{f } F Z{f m } m F Z{f } df d If f f f, the F F F BME 333 Biomedical Sigals ad Systems 9

11 Proof of Delay Proerty Gie: Z{f } F Z{ f } F Z{f } Let - m f f f f m m f m m Sice f m f m m m F m BME 333 Biomedical Sigals ad Systems

12 Proof of f Proerty { f } f F f df d d f - f - f d df d df d - f f f { f } BME 333 Biomedical Sigals ad Systems

13 Proerties of -trasforms If Z{f } df ;the d Z{ f } Z{g } dg d where g f but G df ; d dg d Ad { df d d F d } Z{ f } dg d { df d d F d } { df d d F d } Z{ M f } dg ;where G Z{ M f } d BME 333 Biomedical Sigals ad Systems

14 Iertig the -trasform Seeral Methods: aylor series exasio: Sice F f φy f f y f f y f We ca defie a ew fuctio y where y f y f ad ote that this is just a aylor series exasio ad therefore, calculate the coefficiets of this serieswhich are the alues of f by f d! dy Log diisio of the closed form of F should also yield the same results. - y BME 333 Biomedical Sigals ad Systems 3

15 Iertig the -trasform Cotiued Residue Method which relates the, F, to the L, Fs: It ca be show that Fs F residues of at the oles of Fs s -e he residues are calculated for a ole s aof order as : d! ds s a Fs s -e sa BME 333 Biomedical Sigals ad Systems 4

16 BME 333 Biomedical Sigals ad Systems 5 Iertig the -trasform Cotiued d d M M K M M K F F for u f F F Partial Fractio Exasio of sice most discrete fuctios we deal with are of the form ad, therefore, due to, will hae a i its umerator; e.g.,z{ } i F f u u F f u F ad will hae terms of the form which ca be ierted. i i A

17 Aother Iersio Examle F j j F j j A A A* A* j j j j A A j j j j j j j j j 4 j * j A d d j j 3 3 j j j j j j j 3 3 j j j j 4 4 j 4 j 3 j j A * Liewise for B j j BME 333 Biomedical Sigals ad Systems 6

18 Aother Iersio Examle Cotiued j j j 4 j 4 F e e j j j j e e his loos lie the term is related to e e j j df Ze u Zf e d j { } ; Recall { } ; j d df e d d j { u } Ze j j j j e e j j j j e e e e d j j df e e Z e u j d d e Liewise j e e j { } BME 333 Biomedical Sigals ad Systems 7

19 Aother Iersio Examle Cotiued Cotiuig F e j 4 e j e j e j e j 4 e j e j e j f e j 4 e j e j 4 e j u e j 4 e j 4 u { e j 4 j 4 e }u cos 4u BME 333 Biomedical Sigals ad Systems 8

20 BME 333 Biomedical Sigals ad Systems 9 Differece Equatios It ca be show that for a fuctio which equals ero for t<, ay iitial coditios will ot affect the followig formulatio: as :, the resose due to the uit samlig fuctio, Ad we hae the system fuctio which is Or yield: trasform to this system will he alyig the - gie by this equatio : we hae a system If X Y H H a a a b b b X Y X b b b Y a a a x b x b x b y a m y a m y a m m m m m m m m m m

21 BME 333 Biomedical Sigals ad Systems Examle we hae recedig examle, From a Ad 3 3 otherwise. he,, for where 3 Assume we hae u f V Y H V Y V Y V y y y

22 Examle But H which is ot i ay table, - but if: h Z { H } - he, h Z { H } - Z { } h for m m herefore, hm for m Alteratiely, usig Z{ f } F - H ; but Z { } u Ad Z { } Z { } Z { F } f u BME 333 Biomedical Sigals ad Systems

23 Aother Examle r o - r g i - o r g i o + r g i + Let's calculate the odal oltage of this iteratie etwor : By Kirchoff's Curret Law at ode, we hae : o o o i r r / g rg rg i - V o V o o ad let rg H ;, sice c, the or ad / herefore, H H K K K K / H where / h u at By the way this loos lie our first exercise whe f t e for t ; otherwise - the ole art at ad f t e for t ; otherwise - the / ole art. So the left had side of h ca be associated with a -sided Z ad the right had side of h with a -sided Z. BME 333 Biomedical Sigals ad Systems

24 Oe More Examle t R d t dt V V C RC RC t How do we sole this o a digit comuter? d t t t dt RC We use a iteratie techique but first we must aroximate the deriatie. First we defie a discrete ersio of t ow as the forward Euler Algorithm RC RC RC where u RC V K, K V ad t - + u K K BME 333 Biomedical Sigals ad Systems 3

25 Forward Euler Algorithm Cotiued Estimate of the outut oltage s samlig time C..6.4 C C -5 - C BME 333 Biomedical Sigals ad Systems 4

26 BME 333 Biomedical Sigals ad Systems 5 Cotiued ad discrete ersio of First we defie a We use a iteratie techique but first we must aroximate the deriatie. digit comuter? o a How do we sole this t t t t RC dt t d R C t t the bacward Euler Algorithm ow as dt t d, u V K K K K V RC where V V V u RC RC RC RC RC - +

27 Bacward Euler Algorithm Cotiued Estimate of the outut oltage s samlig time C..6.4 C C.6 C BME 333 Biomedical Sigals ad Systems

28 ime Domai to Frequecy Domai rasformatios ime Domai ime Sigal ye Periodic & Cotiuous x t No-Periodic & Cotiuous x t Discrete x Discrete x Quadratic Cotet Fiite Fiite Fiite Fiite a rasformatio ye Fourier Series FS / / x t e j t dt Cotiuous ime Fourier rasform CF X j x t e jt dt Discrete ime Fourier rasform DF X e j ˆ x e j ˆ Discrete Fourier rasform DF L j N X x e Frequecy Domai Discrete Sectrum a Cotiuous Sectral Desity X j Cotiuous Sectral Desity j ˆ X e Discrete Sectral Desity X No-Periodic, Cotiuous & Zero for t < x t Not Necessarily Fiite Lalace rasform X st s x t e dt Comlex Sectrum X s No-Periodic, Discrete & Zero for < x Not Necessarily Fiite -sided Z rasform X x BME 333 Biomedical Sigals ad Systems Comlex Sectrum X 7

29 Problems:.6,.7 Homewor.6 Cosider the LI system ad fid the outut y for x u : y y x, 3.7 Fid x. X BME 333 Biomedical Sigals ad Systems 8

30 Problems: -9, -5.9 Fid the - trasform for x u 3 Homewor u.5 Fid the differece equatio for H 3 6 Fid the outut for a iut of u,a uit ste. BME 333 Biomedical Sigals ad Systems 9

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

Z - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals. Z - Trasform The -trasform is a very importat tool i describig ad aalyig digital systems. It offers the techiques for digital filter desig ad frequecy aalysis of digital sigals. Defiitio of -trasform:

More information

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,

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, 3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [

More information

Classification of DT signals

Classification of DT signals Comlex exoetial A discrete time sigal may be comlex valued I digital commuicatios comlex sigals arise aturally A comlex sigal may be rereseted i two forms: jarg { z( ) } { } z ( ) = Re { z ( )} + jim {

More information

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

Generalizing the DTFT. The z Transform. Complex Exponential Excitation. The Transfer Function. Systems Described by Difference Equations Geeraliig the DTFT The Trasform M. J. Roberts - All Rights Reserved. Edited by Dr. Robert Akl 1 The forward DTFT is defied by X e jω = x e jω i which = Ω is discrete-time radia frequecy, a real variable.

More information

Definition of z-transform.

Definition of z-transform. - Trasforms Frequecy domai represetatios of discretetime sigals ad LTI discrete-time systems are made possible with the use of DTFT. However ot all discrete-time sigals e.g. uit step sequece are guarateed

More information

Special Modeling Techniques

Special Modeling Techniques Colorado School of Mies CHEN43 Secial Modelig Techiques Secial Modelig Techiques Summary of Toics Deviatio Variables No-Liear Differetial Equatios 3 Liearizatio of ODEs for Aroximate Solutios 4 Coversio

More information

Chapter 4 : Laplace Transform

Chapter 4 : Laplace Transform 4. Itroductio Laplace trasform is a alterative to solve the differetial equatio by the complex frequecy domai ( s = σ + jω), istead of the usual time domai. The DE ca be easily trasformed ito a algebraic

More information

The Z-Transform. (t-t 0 ) Figure 1: Simplified graph of an impulse function. For an impulse, it can be shown that (1)

The Z-Transform. (t-t 0 ) Figure 1: Simplified graph of an impulse function. For an impulse, it can be shown that (1) The Z-Trasform Sampled Data The geeralied fuctio (t) (also kow as the impulse fuctio) is useful i the defiitio ad aalysis of sampled-data sigals. Figure below shows a simplified graph of a impulse. (t-t

More information

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

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations ECE-S352 Itroductio to Digital Sigal Processig Lecture 3A Direct Solutio of Differece Equatios Discrete Time Systems Described by Differece Equatios Uit impulse (sample) respose h() of a DT system allows

More information

Solutions of Chapter 5 Part 1/2

Solutions of Chapter 5 Part 1/2 Page 1 of 8 Solutios of Chapter 5 Part 1/2 Problem 5.1-1 Usig the defiitio, compute the -trasform of x[] ( 1) (u[] u[ 8]). Sketch the poles ad eros of X[] i the plae. Solutio: Accordig to the defiitio,

More information

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

Signal Processing in Mechatronics. Lecture 3, Convolution, Fourier Series and Fourier Transform Sigal Processig i Mechatroics Summer semester, 1 Lecture 3, Covolutio, Fourier Series ad Fourier rasform Dr. Zhu K.P. AIS, UM 1 1. Covolutio Covolutio Descriptio of LI Systems he mai premise is that the

More information

COMM 602: Digital Signal Processing

COMM 602: Digital Signal Processing COMM 60: Digital Sigal Processig Lecture 4 -Properties of LTIS Usig Z-Trasform -Iverse Z-Trasform Properties of LTIS Usig Z-Trasform Properties of LTIS Usig Z-Trasform -ve +ve Properties of LTIS Usig Z-Trasform

More information

FIR Filters. Lecture #7 Chapter 5. BME 310 Biomedical Computing - J.Schesser

FIR Filters. Lecture #7 Chapter 5. BME 310 Biomedical Computing - J.Schesser FIR Filters Lecture #7 Chapter 5 8 What Is this Course All About? To Gai a Appreciatio of the Various Types of Sigals ad Systems To Aalyze The Various Types of Systems To Lear the Skills ad Tools eeded

More information

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

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 Quiz No.. Defie: a ifiite sequece A fuctio whose domai is N 2. Defie: a coverget sequece A sequece that has a limit 3. Is this sequece coverget? Why or why ot? l Yes, it is coverget sice L=0 by LHR. INFINITE

More information

732 Appendix E: Previous EEE480 Exams. Rules: One sheet permitted, calculators permitted. GWC 352,

732 Appendix E: Previous EEE480 Exams. Rules: One sheet permitted, calculators permitted. GWC 352, 732 Aedix E: Previous EEE0 Exams EEE0 Exam 2, Srig 2008 A.A. Rodriguez Rules: Oe 8. sheet ermitted, calculators ermitted. GWC 32, 9-372 Problem Aalysis of a Feedback System Cosider the feedback system

More information

Web Appendix O - Derivations of the Properties of the z Transform

Web Appendix O - Derivations of the Properties of the z Transform M. J. Roberts - 2/18/07 Web Appedix O - Derivatios of the Properties of the z Trasform O.1 Liearity Let z = x + y where ad are costats. The ( z)= ( x + y )z = x z + y z ad the liearity property is O.2

More information

PERIODS OF FIBONACCI SEQUENCES MODULO m. 1. Preliminaries Definition 1. A generalized Fibonacci sequence is an infinite complex sequence (g n ) n Z

PERIODS OF FIBONACCI SEQUENCES MODULO m. 1. Preliminaries Definition 1. A generalized Fibonacci sequence is an infinite complex sequence (g n ) n Z PERIODS OF FIBONACCI SEQUENCES MODULO m ARUDRA BURRA Abstract. We show that the Fiboacci sequece modulo m eriodic for all m, ad study the eriod i terms of the modulus.. Prelimiaries Defiitio. A geeralized

More information

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [

More information

Name of the Student:

Name of the Student: SUBJECT NAME : Trasforms ad Partial Diff Eq SUBJECT CODE : MA MATERIAL NAME : Problem Material MATERIAL CODE : JM8AM6 REGULATION : R8 UPDATED ON : April-May 4 (Sca the above QR code for the direct dowload

More information

Appendix: The Laplace Transform

Appendix: The Laplace Transform Appedix: The Laplace Trasform The Laplace trasform is a powerful method that ca be used to solve differetial equatio, ad other mathematical problems. Its stregth lies i the fact that it allows the trasformatio

More information

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as

More information

EE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course

EE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course Sigal-EE Postal Correspodece Course 1 SAMPLE STUDY MATERIAL Electrical Egieerig EE / EEE Postal Correspodece Course GATE, IES & PSUs Sigal System Sigal-EE Postal Correspodece Course CONTENTS 1. SIGNAL

More information

1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series.

1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series. .3 Covergece Theorems of Fourier Series I this sectio, we preset the covergece of Fourier series. A ifiite sum is, by defiitio, a limit of partial sums, that is, a cos( kx) b si( kx) lim a cos( kx) b si(

More information

ELEG3503 Introduction to Digital Signal Processing

ELEG3503 Introduction to Digital Signal Processing ELEG3503 Itroductio to Digital Sigal Processig 1 Itroductio 2 Basics of Sigals ad Systems 3 Fourier aalysis 4 Samplig 5 Liear time-ivariat (LTI) systems 6 z-trasform 7 System Aalysis 8 System Realizatio

More information

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet

More information

Unit 6: Sequences and Series

Unit 6: Sequences and Series AMHS Hoors Algebra 2 - Uit 6 Uit 6: Sequeces ad Series 26 Sequeces Defiitio: A sequece is a ordered list of umbers ad is formally defied as a fuctio whose domai is the set of positive itegers. It is commo

More information

Ma 530 Infinite Series I

Ma 530 Infinite Series I Ma 50 Ifiite Series I Please ote that i additio to the material below this lecture icorporated material from the Visual Calculus web site. The material o sequeces is at Visual Sequeces. (To use this li

More information

Section 11.8: Power Series

Section 11.8: Power Series Sectio 11.8: Power Series 1. Power Series I this sectio, we cosider geeralizig the cocept of a series. Recall that a series is a ifiite sum of umbers a. We ca talk about whether or ot it coverges ad i

More information

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

Lecture 3. Digital Signal Processing. Chapter 3. z-transforms. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev. 2016 Lecture 3 Digital Sigal Processig Chapter 3 z-trasforms Mikael Swartlig Nedelko Grbic Begt Madersso rev. 06 Departmet of Electrical ad Iformatio Techology Lud Uiversity z-trasforms We defie the z-trasform

More information

Signal Processing in Mechatronics

Signal Processing in Mechatronics Sigal Processig i Mechatroics Zhu K.P. AIS, UM. Lecture, Brief itroductio to Sigals ad Systems, Review of Liear Algebra ad Sigal Processig Related Mathematics . Brief Itroductio to Sigals What is sigal

More information

Lesson 10: Limits and Continuity

Lesson 10: Limits and Continuity www.scimsacademy.com Lesso 10: Limits ad Cotiuity SCIMS Academy 1 Limit of a fuctio The cocept of limit of a fuctio is cetral to all other cocepts i calculus (like cotiuity, derivative, defiite itegrals

More information

Digital signal processing: Lecture 5. z-transformation - I. Produced by Qiangfu Zhao (Since 1995), All rights reserved

Digital signal processing: Lecture 5. z-transformation - I. Produced by Qiangfu Zhao (Since 1995), All rights reserved Digital sigal processig: Lecture 5 -trasformatio - I Produced by Qiagfu Zhao Sice 995, All rights reserved DSP-Lec5/ Review of last lecture Fourier trasform & iverse Fourier trasform: Time domai & Frequecy

More information

MA Lesson 26 Notes Graphs of Rational Functions (Asymptotes) Limits at infinity

MA Lesson 26 Notes Graphs of Rational Functions (Asymptotes) Limits at infinity MA 1910 Lesso 6 Notes Graphs of Ratioal Fuctios (Asymptotes) Limits at ifiity Defiitio of a Ratioal Fuctio: If P() ad Q() are both polyomial fuctios, Q() 0, the the fuctio f below is called a Ratioal Fuctio.

More information

Exponential Moving Average Pieter P

Exponential Moving Average Pieter P Expoetial Movig Average Pieter P Differece equatio The Differece equatio of a expoetial movig average lter is very simple: y[] x[] + (1 )y[ 1] I this equatio, y[] is the curret output, y[ 1] is the previous

More information

Ch3 Discrete Time Fourier Transform

Ch3 Discrete Time Fourier Transform Ch3 Discrete Time Fourier Trasform 3. Show that the DTFT of [] is give by ( k). e k 3. Determie the DTFT of the two sided sigal y [ ],. 3.3 Determie the DTFT of the causal sequece x[ ] A cos( 0 ) [ ],

More information

Frequency Response of FIR Filters

Frequency Response of FIR Filters EEL335: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we itroduce the idea of the frequecy respose of LTI systems, ad focus specifically o the frequecy respose of FIR filters.. Steady-state

More information

Signals and Systems. Problem Set: From Continuous-Time to Discrete-Time

Signals and Systems. Problem Set: From Continuous-Time to Discrete-Time Sigals ad Systems Problem Set: From Cotiuous-Time to Discrete-Time Updated: October 5, 2017 Problem Set Problem 1 - Liearity ad Time-Ivariace Cosider the followig systems ad determie whether liearity ad

More information

EE Midterm Test 1 - Solutions

EE Midterm Test 1 - Solutions EE35 - Midterm Test - Solutios Total Poits: 5+ 6 Bous Poits Time: hour. ( poits) Cosider the parallel itercoectio of the two causal systems, System ad System 2, show below. System x[] + y[] System 2 The

More information

FIR Filter Design: Part II

FIR Filter Design: Part II EEL335: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we cosider how we might go about desigig FIR filters with arbitrary frequecy resposes, through compositio of multiple sigle-peak

More information

is also known as the general term of the sequence

is also known as the general term of the sequence Lesso : Sequeces ad Series Outlie Objectives: I ca determie whether a sequece has a patter. I ca determie whether a sequece ca be geeralized to fid a formula for the geeral term i the sequece. I ca determie

More information

CHAPTER 5. Theory and Solution Using Matrix Techniques

CHAPTER 5. Theory and Solution Using Matrix Techniques A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL

More information

Polynomial Functions and Their Graphs

Polynomial Functions and Their Graphs Polyomial Fuctios ad Their Graphs I this sectio we begi the study of fuctios defied by polyomial expressios. Polyomial ad ratioal fuctios are the most commo fuctios used to model data, ad are used extesively

More information

Finite-length Discrete Transforms. Chapter 5, Sections

Finite-length Discrete Transforms. Chapter 5, Sections Fiite-legth Discrete Trasforms Chapter 5, Sectios 5.2-50 5.0 Dr. Iyad djafar Outlie The Discrete Fourier Trasform (DFT) Matrix Represetatio of DFT Fiite-legth Sequeces Circular Covolutio DFT Symmetry Properties

More information

Frequency Domain Filtering

Frequency Domain Filtering Frequecy Domai Filterig Raga Rodrigo October 19, 2010 Outlie Cotets 1 Itroductio 1 2 Fourier Represetatio of Fiite-Duratio Sequeces: The Discrete Fourier Trasform 1 3 The 2-D Discrete Fourier Trasform

More information

2D DSP Basics: Systems Stability, 2D Sampling

2D DSP Basics: Systems Stability, 2D Sampling - Digital Iage Processig ad Copressio D DSP Basics: Systes Stability D Saplig Stability ty Syste is stable if a bouded iput always results i a bouded output BIBO For LSI syste a sufficiet coditio for stability:

More information

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

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 The -Trasform 7. Itroductio Geeralie the complex siusoidal represetatio offered by DTFT to a represetatio of complex expoetial sigals. Obtai more geeral characteristics for discrete-time LTI systems. 7.

More information

Physics 324, Fall Dirac Notation. These notes were produced by David Kaplan for Phys. 324 in Autumn 2001.

Physics 324, Fall Dirac Notation. These notes were produced by David Kaplan for Phys. 324 in Autumn 2001. Physics 324, Fall 2002 Dirac Notatio These otes were produced by David Kapla for Phys. 324 i Autum 2001. 1 Vectors 1.1 Ier product Recall from liear algebra: we ca represet a vector V as a colum vector;

More information

Introduction to Signals and Systems, Part V: Lecture Summary

Introduction to Signals and Systems, Part V: Lecture Summary EEL33: Discrete-Time Sigals ad Systems Itroductio to Sigals ad Systems, Part V: Lecture Summary Itroductio to Sigals ad Systems, Part V: Lecture Summary So far we have oly looked at examples of o-recursive

More information

M2.The Z-Transform and its Properties

M2.The Z-Transform and its Properties M2.The Z-Trasform ad its Properties Readig Material: Page 94-126 of chapter 3 3/22/2011 I. Discrete-Time Sigals ad Systems 1 What did we talk about i MM1? MM1 - Discrete-Time Sigal ad System 3/22/2011

More information

FINALTERM EXAMINATION Fall 9 Calculus & Aalytical Geometry-I Questio No: ( Mars: ) - Please choose oe Let f ( x) is a fuctio such that as x approaches a real umber a, either from left or right-had-side,

More information

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

The Z-Transform. Content and Figures are from Discrete-Time Signal Processing, 2e by Oppenheim, Shafer, and Buck, Prentice Hall Inc. The Z-Trasform Cotet ad Figures are from Discrete-Time Sigal Processig, e by Oppeheim, Shafer, ad Buck, 999- Pretice Hall Ic. The -Trasform Couterpart of the Laplace trasform for discrete-time sigals Geeraliatio

More information

6.003 Homework #3 Solutions

6.003 Homework #3 Solutions 6.00 Homework # Solutios Problems. Complex umbers a. Evaluate the real ad imagiary parts of j j. π/ Real part = Imagiary part = 0 e Euler s formula says that j = e jπ/, so jπ/ j π/ j j = e = e. Thus the

More information

Solutions. Number of Problems: 4. None. Use only the prepared sheets for your solutions. Additional paper is available from the supervisors.

Solutions. Number of Problems: 4. None. Use only the prepared sheets for your solutions. Additional paper is available from the supervisors. Quiz November 4th, 23 Sigals & Systems (5-575-) P. Reist & Prof. R. D Adrea Solutios Exam Duratio: 4 miutes Number of Problems: 4 Permitted aids: Noe. Use oly the prepared sheets for your solutios. Additioal

More information

A. Basics of Discrete Fourier Transform

A. Basics of Discrete Fourier Transform A. Basics of Discrete Fourier Trasform A.1. Defiitio of Discrete Fourier Trasform (8.5) A.2. Properties of Discrete Fourier Trasform (8.6) A.3. Spectral Aalysis of Cotiuous-Time Sigals Usig Discrete Fourier

More information

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

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science. BACKGROUND EXAM September 30, 2004. MASSACHUSETTS INSTITUTE OF TECHNOLOGY Departmet of Electrical Egieerig ad Computer Sciece 6.34 Discrete Time Sigal Processig Fall 24 BACKGROUND EXAM September 3, 24. Full Name: Note: This exam is closed

More information

MATHEMATICS. 61. The differential equation representing the family of curves where c is a positive parameter, is of

MATHEMATICS. 61. The differential equation representing the family of curves where c is a positive parameter, is of MATHEMATICS 6 The differetial equatio represetig the family of curves where c is a positive parameter, is of Order Order Degree (d) Degree (a,c) Give curve is y c ( c) Differetiate wrt, y c c y Hece differetial

More information

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

Chapter 7: The z-transform. Chih-Wei Liu Chapter 7: The -Trasform Chih-Wei Liu Outlie Itroductio The -Trasform Properties of the Regio of Covergece Properties of the -Trasform Iversio of the -Trasform The Trasfer Fuctio Causality ad Stability

More information

Chapter 8. Euler s Gamma function

Chapter 8. Euler s Gamma function Chapter 8 Euler s Gamma fuctio The Gamma fuctio plays a importat role i the fuctioal equatio for ζ(s that we will derive i the ext chapter. I the preset chapter we have collected some properties of the

More information

PAPER : IIT-JAM 2010

PAPER : IIT-JAM 2010 MATHEMATICS-MA (CODE A) Q.-Q.5: Oly oe optio is correct for each questio. Each questio carries (+6) marks for correct aswer ad ( ) marks for icorrect aswer.. Which of the followig coditios does NOT esure

More information

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects

More information

ENGI Series Page 6-01

ENGI Series Page 6-01 ENGI 3425 6 Series Page 6-01 6. Series Cotets: 6.01 Sequeces; geeral term, limits, covergece 6.02 Series; summatio otatio, covergece, divergece test 6.03 Stadard Series; telescopig series, geometric series,

More information

Lecture 8: Solving the Heat, Laplace and Wave equations using finite difference methods

Lecture 8: Solving the Heat, Laplace and Wave equations using finite difference methods Itroductory lecture otes o Partial Differetial Equatios - c Athoy Peirce. Not to be copied, used, or revised without explicit writte permissio from the copyright ower. 1 Lecture 8: Solvig the Heat, Laplace

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

Chapter 7 z-transform

Chapter 7 z-transform Chapter 7 -Trasform Itroductio Trasform Uilateral Trasform Properties Uilateral Trasform Iversio of Uilateral Trasform Determiig the Frequecy Respose from Poles ad Zeros Itroductio Role i Discrete-Time

More information

Continuity, Derivatives, and All That

Continuity, Derivatives, and All That Chater Seve Cotiuity, Derivatives, ad All That 7 imits ad Cotiuity et x R ad r > The set B( a; r) { x R : x a < r} is called the oe ball of radius r cetered at x The closed ball of radius r cetered at

More information

Most text will write ordinary derivatives using either Leibniz notation 2 3. y + 5y= e and y y. xx tt t

Most text will write ordinary derivatives using either Leibniz notation 2 3. y + 5y= e and y y. xx tt t Itroductio to Differetial Equatios Defiitios ad Termiolog Differetial Equatio: A equatio cotaiig the derivatives of oe or more depedet variables, with respect to oe or more idepedet variables, is said

More information

Chapter 2 The Monte Carlo Method

Chapter 2 The Monte Carlo Method Chapter 2 The Mote Carlo Method The Mote Carlo Method stads for a broad class of computatioal algorithms that rely o radom sampligs. It is ofte used i physical ad mathematical problems ad is most useful

More information

ON SUPERSINGULAR ELLIPTIC CURVES AND HYPERGEOMETRIC FUNCTIONS

ON SUPERSINGULAR ELLIPTIC CURVES AND HYPERGEOMETRIC FUNCTIONS ON SUPERSINGULAR ELLIPTIC CURVES AND HYPERGEOMETRIC FUNCTIONS KEENAN MONKS Abstract The Legedre Family of ellitic curves has the remarkable roerty that both its eriods ad its suersigular locus have descritios

More information

Informal Notes: Zeno Contours, Parametric Forms, & Integrals. John Gill March August S for a convex set S in the complex plane.

Informal Notes: Zeno Contours, Parametric Forms, & Integrals. John Gill March August S for a convex set S in the complex plane. Iformal Notes: Zeo Cotours Parametric Forms & Itegrals Joh Gill March August 3 Abstract: Elemetary classroom otes o Zeo cotours streamlies pathlies ad itegrals Defiitio: Zeo cotour[] Let gk ( z = z + ηk

More information

Continuous Functions

Continuous Functions Cotiuous Fuctios Q What does it mea for a fuctio to be cotiuous at a poit? Aswer- I mathematics, we have a defiitio that cosists of three cocepts that are liked i a special way Cosider the followig defiitio

More information

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

from definition we note that for sequences which are zero for n < 0, X[z] involves only negative powers of z. We ote that for the past four examples we have expressed the -trasform both as a ratio of polyomials i ad as a ratio of polyomials i -. The questio is how does oe kow which oe to use? [] X ] from defiitio

More information

Section 7 Fundamentals of Sequences and Series

Section 7 Fundamentals of Sequences and Series ectio Fudametals of equeces ad eries. Defiitio ad examples of sequeces A sequece ca be thought of as a ifiite list of umbers. 0, -, -0, -, -0...,,,,,,. (iii),,,,... Defiitio: A sequece is a fuctio which

More information

L 5 & 6: RelHydro/Basel. f(x)= ( ) f( ) ( ) ( ) ( ) n! 1! 2! 3! If the TE of f(x)= sin(x) around x 0 is: sin(x) = x - 3! 5!

L 5 & 6: RelHydro/Basel. f(x)= ( ) f( ) ( ) ( ) ( ) n! 1! 2! 3! If the TE of f(x)= sin(x) around x 0 is: sin(x) = x - 3! 5! aylor epasio: Let ƒ() be a ifiitely differetiable real fuctio. At ay poit i the eighbourhood of =0, the fuctio ca be represeted as a power series of the followig form: X 0 f(a) f() ƒ() f()= ( ) f( ) (

More information

Discrete-Time Signals and Systems. Discrete-Time Signals and Systems. Signal Symmetry. Elementary Discrete-Time Signals.

Discrete-Time Signals and Systems. Discrete-Time Signals and Systems. Signal Symmetry. Elementary Discrete-Time Signals. Discrete-ime Sigals ad Systems Discrete-ime Sigals ad Systems Dr. Deepa Kudur Uiversity of oroto Referece: Sectios. -.5 of Joh G. Proakis ad Dimitris G. Maolakis, Digital Sigal Processig: Priciples, Algorithms,

More information

Matsubara-Green s Functions

Matsubara-Green s Functions Matsubara-Gree s Fuctios Time Orderig : Cosider the followig operator If H = H the we ca trivially factorise this as, E(s = e s(h+ E(s = e sh e s I geeral this is ot true. However for practical applicatio

More information

Ray Optics Theory and Mode Theory. Dr. Mohammad Faisal Dept. of EEE, BUET

Ray Optics Theory and Mode Theory. Dr. Mohammad Faisal Dept. of EEE, BUET Ray Optics Theory ad Mode Theory Dr. Mohammad Faisal Dept. of, BUT Optical Fiber WG For light to be trasmitted through fiber core, i.e., for total iteral reflectio i medium, > Ray Theory Trasmissio Ray

More information

The optimal online control of the instantaneous power and the multiphase source s current

The optimal online control of the instantaneous power and the multiphase source s current BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES, Vol. 65, No. 6, 27 DOI:.55/bpasts-27-9 The optimal olie cotrol of the istataeous power ad the multiphase source s curret M. SIWCZYŃSKI ad

More information

Ma 530 Introduction to Power Series

Ma 530 Introduction to Power Series Ma 530 Itroductio to Power Series Please ote that there is material o power series at Visual Calculus. Some of this material was used as part of the presetatio of the topics that follow. What is a Power

More information

3 Gauss map and continued fractions

3 Gauss map and continued fractions ICTP, Trieste, July 08 Gauss map ad cotiued fractios I this lecture we will itroduce the Gauss map, which is very importat for its coectio with cotiued fractios i umber theory. The Gauss map G : [0, ]

More information

A New Solution Method for the Finite-Horizon Discrete-Time EOQ Problem

A New Solution Method for the Finite-Horizon Discrete-Time EOQ Problem This is the Pre-Published Versio. A New Solutio Method for the Fiite-Horizo Discrete-Time EOQ Problem Chug-Lu Li Departmet of Logistics The Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog Phoe: +852-2766-7410

More information

A 2nTH ORDER LINEAR DIFFERENCE EQUATION

A 2nTH ORDER LINEAR DIFFERENCE EQUATION A 2TH ORDER LINEAR DIFFERENCE EQUATION Doug Aderso Departmet of Mathematics ad Computer Sciece, Cocordia College Moorhead, MN 56562, USA ABSTRACT: We give a formulatio of geeralized zeros ad (, )-discojugacy

More information

6.003 Homework #12 Solutions

6.003 Homework #12 Solutions 6.003 Homework # Solutios Problems. Which are rue? For each of the D sigals x [] through x 4 [] below), determie whether the coditios listed i the followig table are satisfied, ad aswer for true or F for

More information

Section 5.5. Infinite Series: The Ratio Test

Section 5.5. Infinite Series: The Ratio Test Differece Equatios to Differetial Equatios Sectio 5.5 Ifiite Series: The Ratio Test I the last sectio we saw that we could demostrate the covergece of a series a, where a 0 for all, by showig that a approaches

More information

Notes on the prime number theorem

Notes on the prime number theorem Notes o the rime umber theorem Keji Kozai May 2, 24 Statemet We begi with a defiitio. Defiitio.. We say that f(x) ad g(x) are asymtotic as x, writte f g, if lim x f(x) g(x) =. The rime umber theorem tells

More information

MATH 1080: Calculus of One Variable II Fall 2017 Textbook: Single Variable Calculus: Early Transcendentals, 7e, by James Stewart.

MATH 1080: Calculus of One Variable II Fall 2017 Textbook: Single Variable Calculus: Early Transcendentals, 7e, by James Stewart. MATH 1080: Calculus of Oe Variable II Fall 2017 Textbook: Sigle Variable Calculus: Early Trascedetals, 7e, by James Stewart Uit 3 Skill Set Importat: Studets should expect test questios that require a

More information

Complex Numbers Solutions

Complex Numbers Solutions Complex Numbers Solutios Joseph Zoller February 7, 06 Solutios. (009 AIME I Problem ) There is a complex umber with imagiary part 64 ad a positive iteger such that Fid. [Solutio: 697] 4i + + 4i. 4i 4i

More information

Let us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f.

Let us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f. Lecture 5 Let us give oe more example of MLE. Example 3. The uiform distributio U[0, ] o the iterval [0, ] has p.d.f. { 1 f(x =, 0 x, 0, otherwise The likelihood fuctio ϕ( = f(x i = 1 I(X 1,..., X [0,

More information

Apply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j.

Apply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j. Eigevalue-Eigevector Istructor: Nam Su Wag eigemcd Ay vector i real Euclidea space of dimesio ca be uiquely epressed as a liear combiatio of liearly idepedet vectors (ie, basis) g j, j,,, α g α g α g α

More information

Signals & Systems Chapter3

Signals & Systems Chapter3 Sigals & Systems Chapter3 1.2 Discrete-Time (D-T) Sigals Electroic systems do most of the processig of a sigal usig a computer. A computer ca t directly process a C-T sigal but istead eeds a stream of

More information

Math 312 Lecture Notes One Dimensional Maps

Math 312 Lecture Notes One Dimensional Maps Math 312 Lecture Notes Oe Dimesioal Maps Warre Weckesser Departmet of Mathematics Colgate Uiversity 21-23 February 25 A Example We begi with the simplest model of populatio growth. Suppose, for example,

More information

Chapter 15: Fourier Series

Chapter 15: Fourier Series Chapter 5: Fourier Series Ex. 5.3- Ex. 5.3- Ex. 5.- f(t) K is a Fourier Series. he coefficiets are a K; a b for. f(t) AcosZ t is a Fourier Series. a A ad all other coefficiets are zero. Set origi at t,

More information

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled 1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how

More information

INTRODUCTORY MATHEMATICAL ANALYSIS

INTRODUCTORY MATHEMATICAL ANALYSIS INTRODUCTORY MATHEMATICAL ANALYSIS For Busiess, Ecoomics, ad the Life ad Social Scieces Chapter 4 Itegratio 0 Pearso Educatio, Ic. Chapter 4: Itegratio Chapter Objectives To defie the differetial. To defie

More information

6.003 Homework #12 Solutions

6.003 Homework #12 Solutions 6.003 Homework # Solutios Problems. Which are rue? For each of the D sigals x [] through x 4 [] (below), determie whether the coditios listed i the followig table are satisfied, ad aswer for true or F

More information

Problem 4: Evaluate ( k ) by negating (actually un-negating) its upper index. Binomial coefficient

Problem 4: Evaluate ( k ) by negating (actually un-negating) its upper index. Binomial coefficient Problem 4: Evaluate by egatig actually u-egatig its upper idex We ow that Biomial coefficiet r { where r is a real umber, is a iteger The above defiitio ca be recast i terms of factorials i the commo case

More information

Chapter 2: Numerical Methods

Chapter 2: Numerical Methods Chapter : Numerical Methods. Some Numerical Methods for st Order ODEs I this sectio, a summar of essetial features of umerical methods related to solutios of ordiar differetial equatios is give. I geeral,

More information

EECE 301 Signals & Systems

EECE 301 Signals & Systems EECE 301 Sigals & Systems Prof. Mark Fowler Note Set #8 D-T Covolutio: The Tool for Fidig the Zero-State Respose Readig Assigmet: Sectio 2.1-2.2 of Kame ad Heck 1/14 Course Flow Diagram The arrows here

More information

Ray-triangle intersection

Ray-triangle intersection Ray-triagle itersectio ria urless October 2006 I this hadout, we explore the steps eeded to compute the itersectio of a ray with a triagle, ad the to compute the barycetric coordiates of that itersectio.

More information

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

ELEG 4603/5173L Digital Signal Processing Ch. 1 Discrete-Time Signals and Systems Departmet of Electrical Egieerig Uiversity of Arasas ELEG 4603/5173L Digital Sigal Processig Ch. 1 Discrete-Time Sigals ad Systems Dr. Jigxia Wu wuj@uar.edu OUTLINE 2 Classificatios of discrete-time sigals

More information

Computational Fluid Dynamics. Lecture 3

Computational Fluid Dynamics. Lecture 3 Computatioal Fluid Dyamics Lecture 3 Discretizatio Cotiued. A fourth order approximatio to f x ca be foud usig Taylor Series. ( + ) + ( + ) + + ( ) + ( ) = a f x x b f x x c f x d f x x e f x x f x 0 0

More information