Discrete-Time Signals & Systems

Size: px
Start display at page:

Download "Discrete-Time Signals & Systems"

Transcription

1 Chpter 2 Discrete-Time Sigls & Systems 清大電機系林嘉文 cwli@ee.thu.edu.tw Discrete-Time Sigls Sigls re represeted s sequeces of umbers, clled smples Smple vlue of typicl sigl or sequece deoted s x = {x} with x is defied oly for iteger vlues of d udefied for o-iteger vlues of Represettio of discrete-time sigls: 2, 0 Fuctiol represettio x 3, 0 Tbulr represettio Sequece represettio x() = {,0.2, 2.2,., 0.2, -3.7, 2.9. } 20/3/2 Digitl Sigl Processig 2

2 Discrete-Time Sigls Grphicl represettio 20/3/2 Digitl Sigl Processig 3 Discrete-Time Sigls Smplig speech sigl ( ), xx T 20/3/2 Digitl Sigl Processig 4 2

3 Bsic Sequeces Uit smple sequece -, 0 0, 0 Uit step sequece -, 0 u 0, 0 u 0 u u 20/3/2 Digitl Sigl Processig 5 Bsic Sequeces Uit rmp sigl - u r, 0 0, 0 Rel expoetil sigl - is rel vlue x A 0 < > /3/2 Digitl Sigl Processig 6 3

4 Bsic Sequeces Complex expoetil sigl - x x jx R R cos x A I j j0 j0 x A A e e e 0 0 si 0 A cos j I si x A 0 20/3/2 Digitl Sigl Processig 7 Bsic Sequeces Complex expoetil sigl - x x jx x x R I x A r x 20/3/2 Digitl Sigl Processig 8 4

5 Bsic Sequeces Siusoidl sigls with differet frequecies 20/3/2 Digitl Sigl Processig 9 Bsic Sequeces A rbitrry sequece c be represeted i the timedomi s weighted sum of some bsic sequece d its delyed (dvced) versios p p 20/3/2 Digitl Sigl Processig 0 5

6 The orm of Discrete-Time Sigl Size of Sigl - give by the orm of the sigl L p -orm: where p is positive iteger The vlue of p is typiclly or 2 or L 2 -orm x 2 is the root-me-squred (rms) vlue of {x} L -orm x is the me bsolute vlue of {x} L -orm is the pe bsolute vlue of {x} (why?) x x p x p p x x mx 20/3/2 Digitl Sigl Processig Clssifictio of Discrete-Time Sigls Periodic sigls d periodic sigls A sigl is periodic with period ( > 0) if d oly if x x for ll The smllest vlue of for which the bove coditio holds is clled the (fudmetl) period A sigl ot stisfyig the periodicity coditio is clled operiodic or periodic 20/3/2 Digitl Sigl Processig 2 6

7 Clssifictio of Discrete-Time Sigls Cojugte-symmetric sequece: * x x If x is rel, the it is eve sequece for cojugte-symmetric sequece {x}, x0 must be rel umber 20/3/2 Digitl Sigl Processig 3 Clssifictio of Discrete-Time Sigls Cojugte-tisymmetric sequece: * x x If x is rel, the it is odd sequece for cojugte ti-symmetric sequece {y}, y0 must be imgiry umber 20/3/2 Digitl Sigl Processig 4 7

8 Clssifictio of Discrete-Time Sigls Ay complex sequece c be expressed s sum of its cojugte-symmetric d cojugte-tisymmetric prts: x xcs xc where * x xx * xc xx 2 Ay rel sequece c be expressed s sum of its eve prt d its odd prt: where cs 2 x x x ev 20/3/2 Digitl Sigl Processig 5 od xev x x 2 xod x x 2 Clssifictio of Discrete-Time Sigls Periodic sigls d periodic sigls A sigl is periodic with period ( > 0) if d oly if x x for ll The smllest vlue of for which the bove coditio holds is clled the (fudmetl) period A sigl ot stisfyig the periodicity coditio is clled operiodic or periodic 20/3/2 Digitl Sigl Processig 6 8

9 Clssifictio of Discrete-Time Sigls Eergy sigls d power sigls The totl eergy of sigl x() is defied by E x 2 A ifiite legth sequece with fiite smple vlues my or my ot be eergy sigl (with fiite eergy) The verge power of discrete-time sigl x is defied by P lim x 2 2 Defie the sigl eergy of x() over the fiite itervl s E 2 x 20/3/2 Digitl Sigl Processig 7 Clssifictio of Discrete-Time Sigls Eergy sigls d power sigls The sigl eergy c the be expressed s E lim E The verge power of x() becomes lim P E 2 If E is fiite, P = 0. O the other hd, if E is ifiite, the verge power P my be either fiite or ifiite If P is fiite (d ozero), the sigl is clled power sigl 20/3/2 Digitl Sigl Processig 8 9

10 Clssifictio of Discrete-Time Sigls Eergy sigls d power sigls Exmple Determie the power d eergy of the uit step sequece The verge power of the uit step sigl is lim P lim It s power sigl with ifiite eergy Exmple - Cosider the cusl sequece defied by 3, 0 x 0, 0 ote: x() hs ifiite eergy, its verge power is 20/3/2 Digitl Sigl Processig 9 P lim Clssifictio of Discrete-Time Sigls A ifiite eergy sigl with fiite verge power is clled power sigl Exmple - A periodic sequece which hs fiite verge power but ifiite eergy A fiite eergy sigl with zero verge power is clled eergy sigl Exmple - A fiite-legth sequece which hs fiite eergy but zero verge power 20/3/2 Digitl Sigl Processig 20 0

11 Clssifictio of Discrete-Time Sigls A sequece x is sid to be bouded if Exmple - The sequece x = cos0.3π is bouded sequece s x A sequece x is sid to be bsolutely summble if x cos(0.3 ) B x Exmple - The followig sequece is bsolutely summble 0.3, 0 y 0, 0 x 20/3/2 Digitl Sigl Processig 2 Clssifictio of Discrete-Time Sigls A sequece x is sid to be squre summble if Exmple - The sequece 2 x si(0.4 ) h is squre-summble but ot bsolutely summble 20/3/2 Digitl Sigl Processig 22

12 Mipultio of Discrete-Time Sigls (/5) Trsformtio of idepedet vrible (time) Time shiftig: A sigl x my be shifted i time by replcig the idepedet vrible by 20/3/2 Digitl Sigl Processig 23 Mipultio of Discrete-Time Sigls (2/5) Trsformtio of idepedet vrible (time) Foldig/Reflectio: A sigl x my be folded i time by replcig the idepedet vrible by 20/3/2 Digitl Sigl Processig 24 2

13 Mipultio of Discrete-Time Sigls (3/5) The opertios of foldig d time delyig (or dvcig) sigl re OT commuttive Deote the time-dely opertio by TD d the foldig opertio by FD TD x x ow wheres, 0 FDx x TD FD x TD x x FD TD x FD x x TD FD x 20/3/2 Digitl Sigl Processig 25 Mipultio of Discrete-Time Sigls (4/5) Trsformtio of idepedet vrible (time) Time Sclig or dow-smplig: A sigl x my be scled i time by replcig by 20/3/2 Digitl Sigl Processig 26 3

14 Mipultio of Discrete-Time Sigls (5/5) Trsformtio of idepedet vrible (time) Additio, multiplictio, d sclig of sequeces: Amplitude modifictios iclude dditio, multiplictio, d sclig of discrete-time Amplitude sclig of sigl by costt : y Ax, Sum of two sigls: 2 Product of two sigls: yx + x, yx x 2, 20/3/2 Digitl Sigl Processig 27 Discrete-Time Systems Discrete-time system: A device or lgorithm tht performs some prescribed opertio o discrete-time sigl (iput or excittio) to produce other discretetime sigl (output or respose) We sy tht the iput sigl x is trsformed by the system ito sigl y s expressed below yt x 20/3/2 Digitl Sigl Processig 28 4

15 Iput-Output Descriptio of Systems The iput-output descriptio or discrete-time system cosists of mthemticl expressio or rule, which explicitly defies the reltio betwee the iput d output sigls T x y Exmple: Determie the respose of the followig systems to the iput sigl, 33 x 0, otherwise () y x (b) y x x x 3 (d) y x (c) y medi x, x, x 20/3/2 Digitl Sigl Processig 29 Lier Systems: Accumultor Accumultor - y xl l x l x y x l The output y is the sum of the iput smple x d the previous output y The system cumultively dds, i.e., it ccumultes ll iput smple vlues Iput-output reltio c lso be writte i the form y xl xl y xl, 0 l l0 l0 The secod form is used for cusl iput sequece, i which cse y is clled the iitil coditio 20/3/2 Digitl Sigl Processig 30 5

16 Lier Systems: Movig Averge M 2 y x M M2 M M M 2 x M x M... x x... x M2 A pplictio: Cosider x = s + d where s = 2(0.9) is the sigl corrupted by rdom oise d 20/3/2 Digitl Sigl Processig 3 olier Systems: Medi Filter (/3) The medi of set of (2K+) umbers is the umber such tht K umbers from the set hve vlues greter th this umber d the other K umbers hve vlues smller Medi c be determied by r-orderig the umbers i the set by their vlues d choosig the umber t the middle Exmple: Cosider the set of umbers {2, 3, 0, 5, } R-order set is give by { 3,, 2, 5, 0} medi{2, 3, 0, 5, } = 2 20/3/2 Digitl Sigl Processig 32 6

17 olier Systems: : Medi Filter (2/3) Medi Filterig Exmple 20/3/2 Digitl Sigl Processig 33 olier Systems: Medi Filter (3/3) Medi Filterig Exmple Origil Imge oisy Imge (pepper-d-slt oise) Filtered Imge 20/3/2 Digitl Sigl Processig 34 7

18 Bloc Digrm Represettio of Discrete-Time Systems Adder Costt multiplier 20/3/2 Digitl Sigl Processig 35 Bloc Digrm Represettio of Discrete-Time Systems Sigl multiplier/modultor Uit dely elemet Uit dvce elemet 20/3/2 Digitl Sigl Processig 36 8

19 Bloc Digrm Represettio of Discrete-Time Systems Exmple: y y x x 20/3/2 Digitl Sigl Processig 37 Sttic vs. Dymic Systems A discrete-time system is clled sttic or memoryless if its output t y time istt depeds t most o the iput smple t the sme time yt x, y y x bx If discrete-time system is ot sttic, it is sid to be dymic or to hve memory y x 3x (fiite memory) y x 0 x 3 (ifiite memory) 20/3/2 Digitl Sigl Processig 38 9

20 Time (Shift) Ivrice Time-ivrit vs. time-vrit systems A system is clled time-ivrit if its iput-output chrcteristics do ot chge with time y Tx Defiitio: A relxed system T is time-ivrit or shift-ivrit if d oly if x( ) T y( ) Implies tht x( ) T y( ) For every iput sigl x() d every time shift. I geerl, we c write the output of time-ivrit system s y (, ) T x ( ) 20/3/2 Digitl Sigl Processig 39 Time (Shift) Ivrice Exmples time ivrit time vrit y T x xx, y, y y x x y x x yt x x y, x y x y, y 20/3/2 Digitl Sigl Processig 40 20

21 Time (Shift) Ivrice Exmples time vrit yt x x y, x y x y, y time vrit T cos0 y, x cos0 cos0 y, y y x x y x 20/3/2 Digitl Sigl Processig 4 Lierity (/3) A lier system is oe tht stisfies the superpositio priciple Defiitio: A system T is lier if d oly if x 2x2 x 2 x2 T T T for y rbitrry iput sequeces x d x 2, d y rbitrry costts d 2. Multiplictive/sclig property: Suppose tht 2 =0 T x T x y Additivity property: Suppose tht = 2 = x x2 x x2 y y2 T T T 20/3/2 Digitl Sigl Processig 42 2

22 Lierity (2/3) Grphicl represettio of the superpositio priciple T is lier if d oly if y =y 20/3/2 Digitl Sigl Processig 43 Lierity (3/3) Lier vs. o-lier systems The lier coditio c be exteded rbitrrily to y weighted lier combitio of sigls where M M T x x y y,,2,, y T x M If system produces ozero output with zero iput, it my be either o-relxed or olier Exmples: ()y =x, (b) y =x 2, (c) y = x 2, (d) y =Ax +B, (e)y =e x 20/3/2 Digitl Sigl Processig 44 22

23 Cuslity Cusl vs. o-cusl systems Defiitio: A system is sid to be cusl if the output of the system t y time depeds oly o preset d pst iputs, but does ot deped o future iputs T y x, x, x2, where T{ } is some rbitrry fuctio. ocusl vs. ticusl If system produces ozero output with zero iput, it my be either o-relxed or olier Exmples: ()y =x x, (b) y =x + 3x+4, (c) y =x 2, (d) y =x2, (e) y =x 20/3/2 Digitl Sigl Processig 45 Stbility Bouded-Iput, Bouded Output (BIBO) stbility If y is the respose to iput x d if x Bx for ll vlues of the y By for ll vlues of Exmple the M-poit movig verge filter is BIBO stble M y x M 0 With bouded iput x Bx M M y x x M M M 0 0 MB x B x 20/3/2 Digitl Sigl Processig 46 23

24 Pssive & Lossless Systems A discrete-time system is defied to be pssive if, for every fiite-eergy iput x, the output y hs, t most, the sme eergy y 2 For lossless system, the bove iequlity is stisfied with equl sig for every iput Exmple - Cosider the discrete-time system defied by y =α x with positive iteger Its output eergy is give by pssive system if ǀαǀ <, d lossless if ǀαǀ = x y x 2 20/3/2 Digitl Sigl Processig 47 Itercoectio of Discrete-Time Systems Cscde itercoectio T x 2 2 y yt y T T x Systems T d T 2 c be combied or cosolidted ito sigle overll system yt x where T TT c I geerl TT 2 TT 2. However, if systems T d T 2 re LTI, the () is time ivrit d (b) TT TT c /3/2 Digitl Sigl Processig 48 24

25 Itercoectio of Discrete-Time Systems Prllel itercoectio Tx T2x TT2x y y y 3 2 Tp x We c use prllel d cscde itercoectio of systems to costruct lrger, more complex systems 20/3/2 Digitl Sigl Processig 49 Techiques for the Alysis of Lier Systems Two bsic methods for lyzig the behvior of lier system: The first is bsed o the direct solutio of the iputoutput equtio y y b x 0 The secod method is to decompose or resolve the iput sigl ito sum of elemetry sigls. The, usig the lierity of the system, the respose of the system to the elemetry sigls re sum to obti the totl respose M 20/3/2 Digitl Sigl Processig 50 25

26 Techiques for the Alysis of Lier Systems Suppose the iput sigl is resolved ito weighted sum of elemetry sigls x cx The respose y of the system to the compoet x is y T x If the system is lier, we hve y T x= T cx c T x c y 20/3/2 Digitl Sigl Processig 5 Why & how to do the sigl decompositio? Resolutio of Discrete-Time Sigl ito Impulses Select the elemetry sigls x to be x where represets the dely of the uit smple sequece Multiply the two sequeces x d? x x 20/3/2 Digitl Sigl Processig 52 26

27 Resolutio of Discrete-Time Sigl ito Impulses Cosequetly x x Exmple - Cosider fiite-durtio sequece give s The sequece c be resolved s x 2, 4,0, x 20/3/2 Digitl Sigl Processig 53 Resolutio of Discrete-Time Sigl ito Impulses The respose of relxed lier system to the uit smple sequece iput: y, h, T If the impulse t the iput is scled by s, x h, ch If the iput is expressed s x x The output becomes y T x T x T, x x h 20/3/2 Digitl Sigl Processig 54 27

28 Respose of LTI Systems to Arbitrry Iputs If the system is time ivrit, d deote the respose of the LTI system to the uit smple sequece s h T The respose of the system to is Cosequetly T h y x h The relxed LTI system is completely chrcterized by sigle fuctio h, the impulse respose. Covolutio is commuttive y x h h x 20/3/2 Digitl Sigl Processig 55 Computig the Covolutio Sum The output of LTI system t = 0 is give by To compute y y x h Foldig. Fold h bout = 0 to obti h Shiftig. Shift h by 0 to the right (left) if is positive (egtive), to obti h 0 Multiplictio. Multiply x by h 0 to obti the product sequece v 0 xh0 Summtio. Sum ll the vlues of v 0 to obti y 0 20/3/2 Digitl Sigl Processig 56 28

29 Computig the Covolutio Sum x, 2,3, h, 2,,,0,0,,4,8,8,3, 2,,0,0, y 20/3/2 Digitl Sigl Processig 57 Computig the Covolutio Sum y x * h x * h x 2 x0 x3 * h x 2 2 x0 x3 3 * h x 2( 2* h ) x0( * h ) x3( 3* h ) x 2 h 2 x0 h x3 h 3 y y y /3/2 Digitl Sigl Processig 58 29

30 30 Computig the Covolutio Sum 20/3/2 Digitl Sigl Processig 59 Tbulr Method of Covolutio Sum Computtio 20/3/2 Digitl Sigl Processig ) ( * h g h g h g h g y

31 3 20/3/2 Digitl Sigl Processig 6 Exmple:, h u x u y y y 2 y lim y y Computig the Covolutio Sum 20/3/2 Digitl Sigl Processig 62 Computig the Covolutio Sum r r r r ote u u u x h h x y u x u u h M M : if, ) ( 0 if ) ( 0 if 0, * 0 0 ) ( 0 0,,

32 Properties of Covolutio (/2) Commuttive Property y x h x h hx hx Idetity d Shiftig Properties y x x x y x 20/3/2 Digitl Sigl Processig 63 Properties of Covolutio (2/2) Associtive Property xh h2 xh2 h xh h2 Distributive Property 2 2 x h h x h x h 20/3/2 Digitl Sigl Processig 64 32

33 Cuslity of LTI Systems (/2) The output of LTI system t = 0 is give by 0 0 y x h Divide the sum ito two sets of terms: y hx h x h0x 0hx 0 hx 0 h2x 0 2 deped o preset d pst iputs deped o future iputs For cusl system, h = 0 for < 0 Sice h is the respose of the relxed LTI system to uit impulse sequece t = 0, LTI system is cusl if d oly if its impulse respose is zero for egtive vlues of 20/3/2 Digitl Sigl Processig 65 Cuslity of LTI Systems (2/2) The output of cusl LTI system becomes y h x x h 0 A sequece x is clled cusl sequece if x = 0 for < 0; otherwise, it s ocusl sequece If the iput to cusl LTI system is cusl sequce, the iput-output equtio reduces to Exmple: Determie the uit step respose of the LTI system with impulse respose h u, y 20/3/2 Digitl Sigl Processig 66 y h x x h

34 Stbility of LTI Systems (/3) BIBO Stbility Coditio - A discrete-time system is BIBO stble if d oly if the output sequece {y} remis bouded for ll bouded iput sequece {x} A LTI discrete-time system is BIBO stble if d oly if its impulse respose sequece {h} is bsolutely summble, i.e. B h h Proof: Assume h is rel sequece Sufficiet coditio: Sice the iput sequece x is bouded we hve x ( ) Bx therefore y hx h x B h BB x x h 20/3/2 Digitl Sigl Processig 67 Stbility of LTI Systems (2/3) Thus, B h < implies ǀyǀ B x B h <, idictig tht y is lso bouded To prove the ecessry coditio, ssume y is bouded, i.e., ǀyǀ B y Cosider the bouded iput give by * h, h 0 x h 0, h 0 For this iput, y t = 0 is 2 h y0 xh Bh h Therefore, if B h =, the {y} is ot bouded sequece 20/3/2 Digitl Sigl Processig 68 34

35 Stbility of LTI Systems (3/3) Exmple - Cosider cusl LTI discrete-time system with impulse respose For this system h Therefore B h < if <, for which the system is BIBO stble If =, the system is ot BIBO stble u Bh u, if 0 20/3/2 Digitl Sigl Processig 69 35

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

=> PARALLEL INTERCONNECTION. Basic Properties LTI Systems. The Commutative Property. Convolution. The Commutative Property. The Distributive Property Lier Time-Ivrit Bsic Properties LTI The Commuttive Property The Distributive Property The Associtive Property Ti -6.4 / Chpter Covolutio y ] x ] ] x ]* ] x ] ] y] y ( t ) + x( τ ) h( t τ ) dτ x( t) * h(

More information

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

DEPARTMENT OF ELECTRICAL &ELECTRONICS ENGINEERING SIGNALS AND SYSTEMS. Assoc. Prof. Dr. Burak Kelleci. Spring 2018 DEPARTMENT OF ELECTRICAL &ELECTRONICS ENGINEERING SIGNALS AND SYSTEMS Assoc. Prof. Dr. Bur Kelleci Sprig 8 OUTLINE The Z-Trsform The Regio of covergece for the Z-trsform The Iverse Z-Trsform Geometric

More information

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

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 Z-Trsforms. INTRODUCTION TO Z-TRANSFORM The Z-trsform is coveiet d vluble tool for represetig, lyig d desigig discrete-time sigls d systems. It plys similr role i discrete-time systems to tht which Lplce

More information

Frequency-domain Characteristics of Discrete-time LTI Systems

Frequency-domain Characteristics of Discrete-time LTI Systems requecy-domi Chrcteristics of Discrete-time LTI Systems Prof. Siripog Potisuk LTI System descriptio Previous bsis fuctio: uit smple or DT impulse The iput sequece is represeted s lier combitio of shifted

More information

Linear Programming. Preliminaries

Linear Programming. Preliminaries Lier Progrmmig Prelimiries Optimiztio ethods: 3L Objectives To itroduce lier progrmmig problems (LPP To discuss the stdrd d coicl form of LPP To discuss elemetry opertio for lier set of equtios Optimiztio

More information

DIGITAL SIGNAL PROCESSING LECTURE 5

DIGITAL SIGNAL PROCESSING LECTURE 5 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

More information

ECE 308 Discrete-Time Signals and Systems

ECE 308 Discrete-Time Signals and Systems ECE 38-5 ECE 38 Discrete-Time Sigals ad Systems Z. Aliyazicioglu Electrical ad Computer Egieerig Departmet Cal Poly Pomoa ECE 38-5 1 Additio, Multiplicatio, ad Scalig of Sequeces Amplitude Scalig: (A Costat

More information

Review of the Riemann Integral

Review of the Riemann Integral Chpter 1 Review of the Riem Itegrl This chpter provides quick review of the bsic properties of the Riem itegrl. 1.0 Itegrls d Riem Sums Defiitio 1.0.1. Let [, b] be fiite, closed itervl. A prtitio P of

More information

Digital Signal Processing, Fall 2006

Digital Signal Processing, Fall 2006 Digitl Sigl Processig, Fll 6 Lecture 6: Sstem structures for implemettio Zeg-u T Deprtmet of Electroic Sstems Alorg Uiversit, Demr t@om.u.d Digitl Sigl Processig, VI, Zeg-u T, 6 Course t glce Discrete-time

More information

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

Chapter 10: The Z-Transform Adapted from: Lecture notes from MIT, Binghamton University Dr. Hamid R. Rabiee Fall 2013 Sigls & Systems Chpter 0: The Z-Trsform Adpted from: Lecture otes from MIT, Bighmto Uiversity Dr. Hmid R. Rbiee Fll 03 Lecture 5 Chpter 0 Lecture 6 Chpter 0 Outlie Itroductio to the -Trsform Properties

More information

Chapter Real Numbers

Chapter Real Numbers Chpter. - Rel Numbers Itegers: coutig umbers, zero, d the egtive of the coutig umbers. ex: {,-3, -, -,,,, 3, } Rtiol Numbers: quotiets of two itegers with ozero deomitor; termitig or repetig decimls. ex:

More information

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

1. (25 points) Use the limit definition of the definite integral and the sum formulas to compute. [1 x + x2 Mth 3, Clculus II Fil Exm Solutios. (5 poits) Use the limit defiitio of the defiite itegrl d the sum formuls to compute 3 x + x. Check your swer by usig the Fudmetl Theorem of Clculus. Solutio: The limit

More information

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

0 otherwise. sin( nx)sin( kx) 0 otherwise. cos( nx) sin( kx) dx 0 for all integers n, k. . Computtio of Fourier Series I this sectio, we compute the Fourier coefficiets, f ( x) cos( x) b si( x) d b, i the Fourier series To do this, we eed the followig result o the orthogolity of the trigoometric

More information

Remarks: (a) The Dirac delta is the function zero on the domain R {0}.

Remarks: (a) The Dirac delta is the function zero on the domain R {0}. Sectio Objective(s): The Dirc s Delt. Mi Properties. Applictios. The Impulse Respose Fuctio. 4.4.. The Dirc Delt. 4.4. Geerlized Sources Defiitio 4.4.. The Dirc delt geerlized fuctio is the limit δ(t)

More information

INFINITE SERIES. ,... having infinite number of terms is called infinite sequence and its indicated sum, i.e., a 1

INFINITE SERIES. ,... having infinite number of terms is called infinite sequence and its indicated sum, i.e., a 1 Appedix A.. Itroductio As discussed i the Chpter 9 o Sequeces d Series, sequece,,...,,... hvig ifiite umber of terms is clled ifiite sequece d its idicted sum, i.e., + + +... + +... is clled ifite series

More information

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

ELEG 5173L Digital Signal Processing Ch. 2 The Z-Transform Deprtmet of Electricl Egieerig Uiversity of Arkss ELEG 573L Digitl Sigl Processig Ch. The Z-Trsform Dr. Jigxi Wu wuj@urk.edu OUTLINE The Z-Trsform Properties Iverse Z-Trsform Z-Trsform of LTI system Z-TRANSFORM

More information

Statistics for Financial Engineering Session 1: Linear Algebra Review March 18 th, 2006

Statistics for Financial Engineering Session 1: Linear Algebra Review March 18 th, 2006 Sttistics for Ficil Egieerig Sessio : Lier Algebr Review rch 8 th, 6 Topics Itroductio to trices trix opertios Determits d Crmer s rule Eigevlues d Eigevectors Quiz The cotet of Sessio my be fmilir to

More information

We will begin by supplying the proof to (a).

We will begin by supplying the proof to (a). (The solutios of problem re mostly from Jeffrey Mudrock s HWs) Problem 1. There re three sttemet from Exmple 5.4 i the textbook for which we will supply proofs. The sttemets re the followig: () The spce

More information

SUTCLIFFE S NOTES: CALCULUS 2 SWOKOWSKI S CHAPTER 11

SUTCLIFFE S NOTES: CALCULUS 2 SWOKOWSKI S CHAPTER 11 SUTCLIFFE S NOTES: CALCULUS SWOKOWSKI S CHAPTER Ifiite Series.5 Altertig Series d Absolute Covergece Next, let us cosider series with both positive d egtive terms. The simplest d most useful is ltertig

More information

DETERMINANT. = 0. The expression a 1. is called a determinant of the second order, and is denoted by : y + c 1

DETERMINANT. = 0. The expression a 1. is called a determinant of the second order, and is denoted by : y + c 1 NOD6 (\Dt\04\Kot\J-Advced\SMP\Mths\Uit#0\NG\Prt-\0.Determits\0.Theory.p65. INTRODUCTION : If the equtios x + b 0, x + b 0 re stisfied by the sme vlue of x, the b b 0. The expressio b b is clled determit

More information

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

Unit 1. Extending the Number System. 2 Jordan School District Uit Etedig the Number System Jord School District Uit Cluster (N.RN. & N.RN.): Etedig Properties of Epoets Cluster : Etedig properties of epoets.. Defie rtiol epoets d eted the properties of iteger epoets

More information

POWER SERIES R. E. SHOWALTER

POWER SERIES R. E. SHOWALTER POWER SERIES R. E. SHOWALTER. sequeces We deote by lim = tht the limit of the sequece { } is the umber. By this we me tht for y ε > 0 there is iteger N such tht < ε for ll itegers N. This mkes precise

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

Review of Sections

Review of Sections Review of Sectios.-.6 Mrch 24, 204 Abstrct This is the set of otes tht reviews the mi ides from Chpter coverig sequeces d series. The specific sectios tht we covered re s follows:.: Sequces..2: Series,

More information

Chapter 5. The Riemann Integral. 5.1 The Riemann integral Partitions and lower and upper integrals. Note: 1.5 lectures

Chapter 5. The Riemann Integral. 5.1 The Riemann integral Partitions and lower and upper integrals. Note: 1.5 lectures Chpter 5 The Riem Itegrl 5.1 The Riem itegrl Note: 1.5 lectures We ow get to the fudmetl cocept of itegrtio. There is ofte cofusio mog studets of clculus betwee itegrl d tiderivtive. The itegrl is (iformlly)

More information

Vectors. Vectors in Plane ( 2

Vectors. Vectors in Plane ( 2 Vectors Vectors i Ple ( ) The ide bout vector is to represet directiol force Tht mes tht every vector should hve two compoets directio (directiol slope) d mgitude (the legth) I the ple we preset vector

More information

CALCULATION OF CONVOLUTION PRODUCTS OF PIECEWISE DEFINED FUNCTIONS AND SOME APPLICATIONS

CALCULATION OF CONVOLUTION PRODUCTS OF PIECEWISE DEFINED FUNCTIONS AND SOME APPLICATIONS CALCULATION OF CONVOLUTION PRODUCTS OF PIECEWISE DEFINED FUNCTIONS AND SOME APPLICATIONS Abstrct Mirce I Cîru We preset elemetry proofs to some formuls ive without proofs by K A West d J McClell i 99 B

More information

The total number of permutations of S is n!. We denote the set of all permutations of S by

The total number of permutations of S is n!. We denote the set of all permutations of S by DETERMINNTS. DEFINITIONS Def: Let S {,,, } e the set of itegers from to, rrged i scedig order. rerrgemet jjj j of the elemets of S is clled permuttio of S. S. The totl umer of permuttios of S is!. We deote

More information

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

Infinite Series Sequences: terms nth term Listing Terms of a Sequence 2 n recursively defined n+1 Pattern Recognition for Sequences Ex: Ifiite Series Sequeces: A sequece i defied s fuctio whose domi is the set of positive itegers. Usully it s esier to deote sequece i subscript form rther th fuctio ottio.,, 3, re the terms of the sequece

More information

Chapter System of Equations

Chapter System of Equations hpter 4.5 System of Equtios After redig th chpter, you should be ble to:. setup simulteous lier equtios i mtrix form d vice-vers,. uderstd the cocept of the iverse of mtrix, 3. kow the differece betwee

More information

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

Chapter 10: The Z-Transform Adapted from: Lecture notes from MIT, Binghamton University Hamid R. Rabiee Arman Sepehr Fall 2010 Sigls & Systems Chpter 0: The Z-Trsform Adpted from: Lecture otes from MIT, Bighmto Uiversity Hmid R. Riee Arm Sepehr Fll 00 Lecture 5 Chpter 0 Outlie Itroductio to the -Trsform Properties of the ROC of

More information

THE NATIONAL UNIVERSITY OF IRELAND, CORK COLÁISTE NA hollscoile, CORCAIGH UNIVERSITY COLLEGE, CORK SUMMER EXAMINATION 2005 FIRST ENGINEERING

THE NATIONAL UNIVERSITY OF IRELAND, CORK COLÁISTE NA hollscoile, CORCAIGH UNIVERSITY COLLEGE, CORK SUMMER EXAMINATION 2005 FIRST ENGINEERING OLLSCOIL NA héireann, CORCAIGH THE NATIONAL UNIVERSITY OF IRELAND, CORK COLÁISTE NA hollscoile, CORCAIGH UNIVERSITY COLLEGE, CORK SUMMER EXAMINATION 2005 FIRST ENGINEERING MATHEMATICS MA008 Clculus d Lier

More information

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:

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: Week 1 Notes: 1) Riem Sum Aim: Compute Are Uder Grph Suppose we wt to fid out the re of grph, like the oe o the right: We wt to kow the re of the red re. Here re some wys to pproximte the re: We cut the

More information

MTH 146 Class 16 Notes

MTH 146 Class 16 Notes MTH 46 Clss 6 Notes 0.4- Cotiued Motivtio: We ow cosider the rc legth of polr curve. Suppose we wish to fid the legth of polr curve curve i terms of prmetric equtios s: r f where b. We c view the cos si

More information

MAS160: Signals, Systems & Information for Media Technology. Problem Set 5. DUE: November 3, (a) Plot of u[n] (b) Plot of x[n]=(0.

MAS160: Signals, Systems & Information for Media Technology. Problem Set 5. DUE: November 3, (a) Plot of u[n] (b) Plot of x[n]=(0. MAS6: Sigals, Systems & Iformatio for Media Techology Problem Set 5 DUE: November 3, 3 Istructors: V. Michael Bove, Jr. ad Rosalid Picard T.A. Jim McBride Problem : Uit-step ad ruig average (DSP First

More information

SUTCLIFFE S NOTES: CALCULUS 2 SWOKOWSKI S CHAPTER 11

SUTCLIFFE S NOTES: CALCULUS 2 SWOKOWSKI S CHAPTER 11 UTCLIFFE NOTE: CALCULU WOKOWKI CHAPTER Ifiite eries Coverget or Diverget eries Cosider the sequece If we form the ifiite sum 0, 00, 000, 0 00 000, we hve wht is clled ifiite series We wt to fid the sum

More information

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

Certain sufficient conditions on N, p n, q n k summability of orthogonal series Avilble olie t www.tjs.com J. Nolier Sci. Appl. 7 014, 7 77 Reserch Article Certi sufficiet coditios o N, p, k summbility of orthogol series Xhevt Z. Krsiqi Deprtmet of Mthemtics d Iformtics, Fculty of

More information

Chapter 7 Infinite Series

Chapter 7 Infinite Series MA Ifiite Series Asst.Prof.Dr.Supree Liswdi Chpter 7 Ifiite Series Sectio 7. Sequece A sequece c be thought of s list of umbers writte i defiite order:,,...,,... 2 The umber is clled the first term, 2

More information

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

The z Transform. The Discrete LTI System Response to a Complex Exponential The Trsform The trsform geerlies the Discrete-time Forier Trsform for the etire complex ple. For the complex vrible is sed the ottio: jω x+ j y r e ; x, y Ω rg r x + y {} The Discrete LTI System Respose

More information

Lesson 4 Linear Algebra

Lesson 4 Linear Algebra Lesso Lier Algebr A fmily of vectors is lierly idepedet if oe of them c be writte s lier combitio of fiitely my other vectors i the collectio. Cosider m lierly idepedet equtios i ukows:, +, +... +, +,

More information

MA123, Chapter 9: Computing some integrals (pp )

MA123, Chapter 9: Computing some integrals (pp ) MA13, Chpter 9: Computig some itegrls (pp. 189-05) Dte: Chpter Gols: Uderstd how to use bsic summtio formuls to evlute more complex sums. Uderstd how to compute its of rtiol fuctios t ifiity. Uderstd how

More information

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

Content: Essential Calculus, Early Transcendentals, James Stewart, 2007 Chapter 1: Functions and Limits., in a set B. Review Sheet: Chpter Cotet: Essetil Clculus, Erly Trscedetls, Jmes Stewrt, 007 Chpter : Fuctios d Limits Cocepts, Defiitios, Lws, Theorems: A fuctio, f, is rule tht ssigs to ech elemet i set A ectly oe

More information

In an algebraic expression of the form (1), like terms are terms with the same power of the variables (in this case

In an algebraic expression of the form (1), like terms are terms with the same power of the variables (in this case Chpter : Algebr: A. Bckgroud lgebr: A. Like ters: I lgebric expressio of the for: () x b y c z x y o z d x... p x.. we cosider x, y, z to be vribles d, b, c, d,,, o,.. to be costts. I lgebric expressio

More information

A GENERALIZATION OF GAUSS THEOREM ON QUADRATIC FORMS

A GENERALIZATION OF GAUSS THEOREM ON QUADRATIC FORMS A GENERALIZATION OF GAU THEOREM ON QUADRATIC FORM Nicole I Brtu d Adi N Cret Deprtmet of Mth - Criov Uiversity, Romi ABTRACT A origil result cocerig the extesio of Guss s theorem from the theory of biry

More information

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

Review of Discrete-time Signals. ELEC 635 Prof. Siripong Potisuk Review of Discrete-time Sigals ELEC 635 Prof. Siripog Potisuk 1 Discrete-time Sigals Discrete-time, cotiuous-valued amplitude (sampled-data sigal) Discrete-time, discrete-valued amplitude (digital sigal)

More information

Lecture 2: Matrix Algebra

Lecture 2: Matrix Algebra Lecture 2: Mtrix lgebr Geerl. mtrix, for our purpose, is rectgulr rry of objects or elemets. We will tke these elemets s beig rel umbers d idicte elemet by its row d colum positio. mtrix is the ordered

More information

The Definite Integral

The Definite Integral The Defiite Itegrl A Riem sum R S (f) is pproximtio to the re uder fuctio f. The true re uder the fuctio is obtied by tkig the it of better d better pproximtios to the re uder f. Here is the forml defiitio,

More information

ECE4270 Fundamentals of DSP. Lecture 2 Discrete-Time Signals and Systems & Difference Equations. Overview of Lecture 2. More Discrete-Time Systems

ECE4270 Fundamentals of DSP. Lecture 2 Discrete-Time Signals and Systems & Difference Equations. Overview of Lecture 2. More Discrete-Time Systems ECE4270 Fudametals of DSP Lecture 2 Discrete-Time Sigals ad Systems & Differece Equatios School of ECE Ceter for Sigal ad Iformatio Processig Georgia Istitute of Techology Overview of Lecture 2 Aoucemet

More information

lecture 16: Introduction to Least Squares Approximation

lecture 16: Introduction to Least Squares Approximation 97 lecture 16: Itroductio to Lest Squres Approximtio.4 Lest squres pproximtio The miimx criterio is ituitive objective for pproximtig fuctio. However, i my cses it is more ppelig (for both computtio d

More information

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),

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), FOURIER SERIES PART I: DEFINITIONS AND EXAMPLES To -periodic fuctio f() we will ssocite trigoometric series + cos() + b si(), or i terms of the epoetil e i, series of the form c e i. Z For most of the

More information

The Elementary Arithmetic Operators of Continued Fraction

The Elementary Arithmetic Operators of Continued Fraction Americ-Eursi Jourl of Scietific Reserch 0 (5: 5-63, 05 ISSN 88-6785 IDOSI Pulictios, 05 DOI: 0.589/idosi.ejsr.05.0.5.697 The Elemetry Arithmetic Opertors of Cotiued Frctio S. Mugssi d F. Mistiri Deprtmet

More information

A GENERAL METHOD FOR SOLVING ORDINARY DIFFERENTIAL EQUATIONS: THE FROBENIUS (OR SERIES) METHOD

A GENERAL METHOD FOR SOLVING ORDINARY DIFFERENTIAL EQUATIONS: THE FROBENIUS (OR SERIES) METHOD Diol Bgoo () A GENERAL METHOD FOR SOLVING ORDINARY DIFFERENTIAL EQUATIONS: THE FROBENIUS (OR SERIES) METHOD I. Itroductio The first seprtio of vribles (see pplictios to Newto s equtios) is ver useful method

More information

Signal Processing. Lecture 02: Discrete Time Signals and Systems. Ahmet Taha Koru, Ph. D. Yildiz Technical University.

Signal Processing. Lecture 02: Discrete Time Signals and Systems. Ahmet Taha Koru, Ph. D. Yildiz Technical University. Sigal Processig Lecture 02: Discrete Time Sigals ad Systems Ahmet Taha Koru, Ph. D. Yildiz Techical Uiversity 2017-2018 Fall ATK (YTU) Sigal Processig 2017-2018 Fall 1 / 51 Discrete Time Sigals Discrete

More information

Filter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and

Filter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and Filter bas Separately, the lowpass ad highpass filters are ot ivertible T removes the highest frequecy / ad removes the lowest frequecy Together these filters separate the sigal ito low-frequecy ad high-frequecy

More information

{ } { S n } is monotonically decreasing if Sn

{ } { S n } is monotonically decreasing if Sn Sequece A sequece is fuctio whose domi of defiitio is the set of turl umers. Or it c lso e defied s ordered set. Nottio: A ifiite sequece is deoted s { } S or { S : N } or { S, S, S,...} or simply s {

More information

Olli Simula T / Chapter 1 3. Olli Simula T / Chapter 1 5

Olli Simula T / Chapter 1 3. Olli Simula T / Chapter 1 5 Sigals ad Systems Sigals ad Systems Sigals are variables that carry iformatio Systemstake sigals as iputs ad produce sigals as outputs The course deals with the passage of sigals through systems T-6.4

More information

ANALYSIS HW 3. f(x + y) = f(x) + f(y) for all real x, y. Demonstration: Let f be such a function. Since f is smooth, f exists.

ANALYSIS HW 3. f(x + y) = f(x) + f(y) for all real x, y. Demonstration: Let f be such a function. Since f is smooth, f exists. ANALYSIS HW 3 CLAY SHONKWILER () Fid ll smooth fuctios f : R R with the property f(x + y) = f(x) + f(y) for ll rel x, y. Demostrtio: Let f be such fuctio. Sice f is smooth, f exists. The The f f(x + h)

More information

sin m a d F m d F m h F dy a dy a D h m h m, D a D a c1cosh c3cos 0

sin m a d F m d F m h F dy a dy a D h m h m, D a D a c1cosh c3cos 0 Q1. The free vibrtio of the plte is give by By ssumig h w w D t, si cos w W x y t B t Substitutig the deflectio ito the goverig equtio yields For the plte give, the mode shpe W hs the form h D W W W si

More information

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

Probability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J. Probbility d Stochstic Processes: A Friedly Itroductio for Electricl d Computer Egieers Roy D. Ytes d Dvid J. Goodm Problem Solutios : Ytes d Goodm,4..4 4..4 4..7 4.4. 4.4. 4..6 4.6.8 4.6.9 4.7.4 4.7.

More information

Definite Integral. The Left and Right Sums

Definite Integral. The Left and Right Sums Clculus Li Vs Defiite Itegrl. The Left d Right Sums The defiite itegrl rises from the questio of fidig the re betwee give curve d x-xis o itervl. The re uder curve c be esily clculted if the curve is give

More information

MAS221 Analysis, Semester 2 Exercises

MAS221 Analysis, Semester 2 Exercises MAS22 Alysis, Semester 2 Exercises Srh Whitehouse (Exercises lbelled * my be more demdig.) Chpter Problems: Revisio Questio () Stte the defiitio of covergece of sequece of rel umbers, ( ), to limit. (b)

More information

Similar idea to multiplication in N, C. Divide and conquer approach provides unexpected improvements. Naïve matrix multiplication

Similar idea to multiplication in N, C. Divide and conquer approach provides unexpected improvements. Naïve matrix multiplication Next. Covered bsics of simple desig techique (Divided-coquer) Ch. of the text.. Next, Strsse s lgorithm. Lter: more desig d coquer lgorithms: MergeSort. Solvig recurreces d the Mster Theorem. Similr ide

More information

Options: Calculus. O C.1 PG #2, 3b, 4, 5ace O C.2 PG.24 #1 O D PG.28 #2, 3, 4, 5, 7 O E PG #1, 3, 4, 5 O F PG.

Options: Calculus. O C.1 PG #2, 3b, 4, 5ace O C.2 PG.24 #1 O D PG.28 #2, 3, 4, 5, 7 O E PG #1, 3, 4, 5 O F PG. O C. PG.-3 #, 3b, 4, 5ce O C. PG.4 # Optios: Clculus O D PG.8 #, 3, 4, 5, 7 O E PG.3-33 #, 3, 4, 5 O F PG.36-37 #, 3 O G. PG.4 #c, 3c O G. PG.43 #, O H PG.49 #, 4, 5, 6, 7, 8, 9, 0 O I. PG.53-54 #5, 8

More information

Particle in a Box. and the state function is. In this case, the Hermitian operator. The b.c. restrict us to 0 x a. x A sin for 0 x a, and 0 otherwise

Particle in a Box. and the state function is. In this case, the Hermitian operator. The b.c. restrict us to 0 x a. x A sin for 0 x a, and 0 otherwise Prticle i Box We must hve me where = 1,,3 Solvig for E, π h E = = where = 1,,3, m 8m d the stte fuctio is x A si for 0 x, d 0 otherwise x ˆ d KE V. m dx I this cse, the Hermiti opertor 0iside the box The

More information

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

f(bx) dx = f dx = dx l dx f(0) log b x a + l log b a 2ɛ log b a. Eercise 5 For y < A < B, we hve B A f fb B d = = A B A f d f d For y ɛ >, there re N > δ >, such tht d The for y < A < δ d B > N, we hve ba f d f A bb f d l By ba A A B A bb ba fb d f d = ba < m{, b}δ

More information

Computing the output response of LTI Systems.

Computing the output response of LTI Systems. Computig the output respose of LTI Systems. By breaig or decomposig ad represetig the iput sigal to the LTI system ito terms of a liear combiatio of a set of basic sigals. Usig the superpositio property

More information

ADVANCED DIGITAL SIGNAL PROCESSING

ADVANCED DIGITAL SIGNAL PROCESSING ADVANCED DIGITAL SIGNAL PROCESSING PROF. S. C. CHAN (email : sccha@eee.hku.hk, Rm. CYC-702) DISCRETE-TIME SIGNALS AND SYSTEMS MULTI-DIMENSIONAL SIGNALS AND SYSTEMS RANDOM PROCESSES AND APPLICATIONS ADAPTIVE

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

Basic Limit Theorems

Basic Limit Theorems Bsic Limit Theorems The very "cle" proof of L9 usig L8 ws provided to me by Joh Gci d it ws this result which ispired me to write up these otes. Absolute Vlue Properties: For rel umbers x, d y x x if x

More information

Introduction to Digital Signal Processing(DSP)

Introduction to Digital Signal Processing(DSP) Forth Clss Commictio II Electricl Dept Nd Nsih Itrodctio to Digitl Sigl ProcessigDSP Recet developmets i digitl compters ope the wy to this sject The geerl lock digrm of DSP system is show elow: Bd limited

More information

Math 104: Final exam solutions

Math 104: Final exam solutions Mth 14: Fil exm solutios 1. Suppose tht (s ) is icresig sequece with coverget subsequece. Prove tht (s ) is coverget sequece. Aswer: Let the coverget subsequece be (s k ) tht coverges to limit s. The there

More information

Discrete Mathematics I Tutorial 12

Discrete Mathematics I Tutorial 12 Discrete Mthemtics I Tutoril Refer to Chpter 4., 4., 4.4. For ech of these sequeces fid recurrece reltio stisfied by this sequece. (The swers re ot uique becuse there re ifiitely my differet recurrece

More information

Sequence and Series of Functions

Sequence and Series of Functions 6 Sequece d Series of Fuctios 6. Sequece of Fuctios 6.. Poitwise Covergece d Uiform Covergece Let J be itervl i R. Defiitio 6. For ech N, suppose fuctio f : J R is give. The we sy tht sequece (f ) of fuctios

More information

1.3 Continuous Functions and Riemann Sums

1.3 Continuous Functions and Riemann Sums mth riem sums, prt 0 Cotiuous Fuctios d Riem Sums I Exmple we sw tht lim Lower() = lim Upper() for the fuctio!! f (x) = + x o [0, ] This is o ccidet It is exmple of the followig theorem THEOREM Let f be

More information

RULES FOR MANIPULATING SURDS b. This is the addition law of surds with the same radicals. (ii)

RULES FOR MANIPULATING SURDS b. This is the addition law of surds with the same radicals. (ii) SURDS Defiitio : Ay umer which c e expressed s quotiet m of two itegers ( 0 ), is clled rtiol umer. Ay rel umer which is ot rtiol is clled irrtiol. Irrtiol umers which re i the form of roots re clled surds.

More information

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

UNIVERSITY OF BRISTOL. Examination for the Degrees of B.Sc. and M.Sci. (Level C/4) ANALYSIS 1B, SOLUTIONS MATH (Paper Code MATH-10006) UNIVERSITY OF BRISTOL Exmitio for the Degrees of B.Sc. d M.Sci. (Level C/4) ANALYSIS B, SOLUTIONS MATH 6 (Pper Code MATH-6) My/Jue 25, hours 3 miutes This pper cotis two sectios, A d B. Plese use seprte

More information

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

2. Infinite Series 3. Power Series 4. Taylor Series 5. Review Questions and Exercises 6. Sequences and Series with Maple Chpter II CALCULUS II.4 Sequeces d Series II.4 SEQUENCES AND SERIES Objectives: After the completio of this sectio the studet - should recll the defiitios of the covergece of sequece, d some limits; -

More information

Schrödinger Equation Via Laplace-Beltrami Operator

Schrödinger Equation Via Laplace-Beltrami Operator IOSR Jourl of Mthemtics (IOSR-JM) e-issn: 78-578, p-issn: 39-765X. Volume 3, Issue 6 Ver. III (Nov. - Dec. 7), PP 9-95 www.iosrjourls.org Schrödiger Equtio Vi Lplce-Beltrmi Opertor Esi İ Eskitşçioğlu,

More information

ALGEBRA II CHAPTER 7 NOTES. Name

ALGEBRA II CHAPTER 7 NOTES. Name ALGEBRA II CHAPTER 7 NOTES Ne Algebr II 7. th Roots d Rtiol Expoets Tody I evlutig th roots of rel ubers usig both rdicl d rtiol expoet ottio. I successful tody whe I c evlute th roots. It is iportt for

More information

M3P14 EXAMPLE SHEET 1 SOLUTIONS

M3P14 EXAMPLE SHEET 1 SOLUTIONS M3P14 EXAMPLE SHEET 1 SOLUTIONS 1. Show tht for, b, d itegers, we hve (d, db) = d(, b). Sice (, b) divides both d b, d(, b) divides both d d db, d hece divides (d, db). O the other hd, there exist m d

More information

Convergence rates of approximate sums of Riemann integrals

Convergence rates of approximate sums of Riemann integrals Jourl of Approximtio Theory 6 (9 477 49 www.elsevier.com/locte/jt Covergece rtes of pproximte sums of Riem itegrls Hiroyuki Tski Grdute School of Pure d Applied Sciece, Uiversity of Tsukub, Tsukub Ibrki

More information

( ) dx ; f ( x ) is height and Δx is

( ) dx ; f ( x ) is height and Δx is Mth : 6.3 Defiite Itegrls from Riem Sums We just sw tht the exct re ouded y cotiuous fuctio f d the x xis o the itervl x, ws give s A = lim A exct RAM, where is the umer of rectgles i the Rectgulr Approximtio

More information

Discrete-Time Signals and Systems. Signals and Systems. Digital Signals. Discrete-Time Signals. Operations on Sequences: Basic Operations

Discrete-Time Signals and Systems. Signals and Systems. Digital Signals. Discrete-Time Signals. Operations on Sequences: Basic Operations -6.3 Digital Sigal Processig ad Filterig..8 Discrete-ime Sigals ad Systems ime-domai Represetatios of Discrete-ime Sigals ad Systems ime-domai represetatio of a discrete-time sigal as a sequece of umbers

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

PROGRESSIONS AND SERIES

PROGRESSIONS AND SERIES PROGRESSIONS AND SERIES A sequece is lso clled progressio. We ow study three importt types of sequeces: () The Arithmetic Progressio, () The Geometric Progressio, () The Hrmoic Progressio. Arithmetic Progressio.

More information

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

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 Tylor Polyomils Let f () = e d let p() = 1 + + 1 + 1 6 3 Without usig clcultor, evlute f (1) d p(1) Ok, I m still witig With little effort it is possible to evlute p(1) = 1 + 1 + 1 (144) + 6 1 (178) =

More information

LEVEL I. ,... if it is known that a 1

LEVEL I. ,... if it is known that a 1 LEVEL I Fid the sum of first terms of the AP, if it is kow tht + 5 + 0 + 5 + 0 + = 5 The iterior gles of polygo re i rithmetic progressio The smllest gle is 0 d the commo differece is 5 Fid the umber of

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

Chapter #2 EEE Subsea Control and Communication Systems

Chapter #2 EEE Subsea Control and Communication Systems EEE 87 Chpter # EEE 87 Sube Cotrol d Commuictio Sytem Trfer fuctio Pole loctio d -ple Time domi chrcteritic Extr pole d zero Chpter /8 EEE 87 Trfer fuctio Lplce Trform Ued oly o LTI ytem Differetil expreio

More information

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

Fast Fourier Transform 1) Legendre s Interpolation 2) Vandermonde Matrix 3) Roots of Unity 4) Polynomial Evaluation Algorithm Desig d Alsis Victor Admchi CS 5-45 Sprig 4 Lecture 3 J 7, 4 Cregie Mello Uiversit Outlie Fst Fourier Trsform ) Legedre s Iterpoltio ) Vdermode Mtri 3) Roots of Uit 4) Polomil Evlutio Guss (777

More information

Solution of the exam in TMA4212 Monday 23rd May 2013 Time: 9:00 13:00

Solution of the exam in TMA4212 Monday 23rd May 2013 Time: 9:00 13:00 Norwegi Uiversity of Sciece d Techology Deprtmet of Mthemticl Scieces Cotct durig the exm: Ele Celledoi, tlf. 735 93541 Pge 1 of 7 of the exm i TMA4212 Mody 23rd My 2013 Time: 9:00 13:00 Allowed ids: Approved

More information

Section 7.3, Systems of Linear Algebraic Equations; Linear Independence, Eigenvalues, Eigenvectors (the variable vector of the system) and

Section 7.3, Systems of Linear Algebraic Equations; Linear Independence, Eigenvalues, Eigenvectors (the variable vector of the system) and Sec. 7., Boyce & DiPrim, p. Sectio 7., Systems of Lier Algeric Equtios; Lier Idepedece, Eigevlues, Eigevectors I. Systems of Lier Algeric Equtios.. We c represet the system...... usig mtrices d vectors

More information

Time-Domain Representations of LTI Systems

Time-Domain Representations of LTI Systems 2.1 Itroductio Objectives: 1. Impulse resposes of LTI systems 2. Liear costat-coefficiets differetial or differece equatios of LTI systems 3. Bloc diagram represetatios of LTI systems 4. State-variable

More information

Error-free compression

Error-free compression Error-free compressio Useful i pplictio where o loss of iformtio is tolerble. This mybe due to ccurcy requiremets, legl requiremets, or less th perfect qulity of origil imge. Compressio c be chieved by

More information

Chapter Real Numbers

Chapter Real Numbers Chpter. - Rel Numbers Itegers: coutig umbers, zero, d the egtive of the coutig umbers. ex: {,-3, -, -, 0,,, 3, } Rtiol Numbers: quotiets of two itegers with ozero deomitor; termitig or repetig decimls.

More information

MATH 104 FINAL SOLUTIONS. 1. (2 points each) Mark each of the following as True or False. No justification is required. y n = x 1 + x x n n

MATH 104 FINAL SOLUTIONS. 1. (2 points each) Mark each of the following as True or False. No justification is required. y n = x 1 + x x n n MATH 04 FINAL SOLUTIONS. ( poits ech) Mrk ech of the followig s True or Flse. No justifictio is required. ) A ubouded sequece c hve o Cuchy subsequece. Flse b) A ifiite uio of Dedekid cuts is Dedekid cut.

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

Recurrece reltio & Recursio 9 Chpter 3 Recurrece reltio & Recursio Recurrece reltio : A recurrece is equtio or iequlity tht describes fuctio i term of itself with its smller iputs. T T The problem of size

More information

THEORY OF EQUATIONS SYNOPSIS. Polyomil Fuctio: If,, re rel d is positive iteger, the f)x) = + x + x +.. + x is clled polyomil fuctio.. Degree of the Polyomil: The highest power of x for which the coefficiet

More information

Canonical Form and Separability of PPT States on Multiple Quantum Spaces

Canonical Form and Separability of PPT States on Multiple Quantum Spaces Coicl Form d Seprbility of PPT Sttes o Multiple Qutum Spces Xio-Hog Wg d Sho-Mig Fei, 2 rxiv:qut-ph/050445v 20 Apr 2005 Deprtmet of Mthemtics, Cpitl Norml Uiversity, Beijig, Chi 2 Istitute of Applied Mthemtics,

More information