Notes 20 largely plagiarized by %khc

Size: px
Start display at page:

Download "Notes 20 largely plagiarized by %khc"

Transcription

1 1 Notes 20 largely plagiarized by %khc 1 Warig This set of otes covers discrete time. However, i probably wo t be able to talk about everythig here; istead i will highlight importat properties or give radom examples. 1 You are advised to cosult your lecture otes ad your textbook, sice you are resposible for everythig. 2 Discrete Time We begi our discussio of discrete time by attemptig to draw some aalogies betwee cotiuous time (CT) ad discrete time (DT). I DT, our basic sigal is []. This fuctio is ozero at 0 oly, as you would expect from a compariso with (t). The major differece is that [] has a height of 1 at 0, whereas (t) has ifiite height ad area 1. Our ext most basic sigal is u[], which ca be costructed from [] by takig the ruig sum from k,1 to k : Compare this to CT: u[] X k,1 [k] t u(t) ( )d,1 This leads us to the coclusio that the local equivalet of itegratio i DT is the ruig sum. Differetiatio i CT the becomes a fiite differece, the differece betwee two or more successive samples. 2 Sometimes, CT differetial equatios are approximated by fiite differeces to covert them to DT differece equatios. Oe more thig before we move o: i DT, complex expoetials ad siusoids exhibitig a somewhat weird behavior. Cosider two differet complex expoetials i CT: e j!1t ad e j!2t.if! 1 ad! 2 are ot equal, the there is o way for the two complex expoetials to look the same as a fuctio of time. Now, cosider the same two complex expoetials i DT. We ll do this by takig t T, effectively samplig the CT sigal with samplig period T. 3 For the particular choice of! 2! T : e j!2t e j(!1+ 2 T )T e j!1t e j 2 T )T e j!1t e j2 e j!1t We ca explicitly surpress the depedece o the samplig period T by defiig a ew variable Ω!T. We refer to! as uormalized frequecy ad to Ω as ormalized frequecy. Ayway, i uormalized or ormalized frequecy, we still ed up with the same basic result i uormalized frequecy, you caot tell the differece betwee a DT complex expoetial at frequecy! 1 ad aother DT complex expoetial! 2! T. Exercise Show that i ormalized frequecy, the DT complex expoetial Ω 2 ad Ω 2 Ω are the same value at iteger values of. 1 Oce agai, radomess is good. 2 The most basic fiite differece is first order: x[], x[, 1]. More o this if you take math128a ad math128b, umerical aalysis parts I ad II, which is highly recommeded if you are goig to ed up codig a lot. 3 More o samplig later. For ow, let s thik about samplig as closig a switch at multiples of time t T ad recordig the resultig values.

2 EE120: Sigals ad Systems; v DT Covolutio The DT equivalet of the siftig itegral is: x[] k,1 x[k][, k] This says that the etire sequece x[] ca be obtaied oe sample at a time, by summig a ifiite sequece of uit samples, appropriately scaled. If we have a liear system H, ad we take this x[] as iput ito our system, we ed up with the output y[]: y[] H[x[]] H[ k,1 k,1 x[k][, k]] x[k]h[[, k]] This is oly from assumig liearity. As with cotiuous time, we ca defie the impulse respose g[; k] H[[, k]] as a fuctio of two variables ad k,where ca be iterpreted as the curret idex, ad k ca be thought of as whe the impulse occurred. Now, if the system is time-ivariat, we do t really care too much whe that impulse happes, oly the differece betwee whe that impulse happeed ad whatever idex we re curretly at. So g[; k] reduces from a fuctio of two variables back dow to a sigle variable: g[; k] h[, k]. A more elegat way of gettig to the same result is to cosider the defiitio of shift-ivariace, which is the local equivalet of time ivariace i DT. 4 Shift ivariace says that if i shift a sigal ad put it ito a system, the output is goig to be the same as if i put the ushifted sigal ito the system first ad shifted it later. I math, the delay ad system operators commute: H[D k [x[]]] D k [H[x[]]] Applyig this defiitio of shift ivariace, we ote that: H[[, k]] H[D k [[]]] D k [H[[]]] D k [h[]] h[, k] wherewehavedefiedh[] H[[]], the impulse respose. Note that i m goig to refer to shift ivariace ad time ivariace iterchageably. 5 The fial form of the covolutio sum becomes: y[] k,1 x[k]h[, k] What are we actually doig here? Well, we ca iterpret our iput as the sum of a buch of scaled ad shifted uit samples. If we kow that our system is LTI ad that it has some impulse respose h[], the if we put i a fuctio at, k, the respose of the system will be h[, k]. Now, if we put i [, k], scaled by x[k], we will get x[k]h[, P k]. If we have a whole buch of fuctios for various values of k, we ca, by liearity, sum up the whole 1 output as,1 x[k]h[, k]. This process is illustrated i Figure 1. 4 The reaso why the ame is differet is that the idex could represet some other variable such as positio istead of time. For a cocrete example, thik of the positio of a pixel i a image. Now, to warp yourbrai, cosidera 3D image chagigas a fuctio of time 5 Sorry, premature seility. Maybe i should take up skydivig ow before i forget to pull the ripcord.

3 EE120: Sigals ad Systems; v δ [] h[] (a) a impulse ad the correspodig impulse respose x0[] y0[] x1[] y1[] x2[] y2[] (b) scalig ad shiftig the impulse produces a scaled ad shifted impulse respose x[] y[] (c) superpositio of x0[], x1[], ad x2[] from (b) gives x[]; likewise, superpositio of y0[], y1[], ad y2[] gives y[]; so if x[] is iput ito our system with impulse respose h[], the correspodig output is y[] Figure 1: DT covolutio.

4 EE120: Sigals ad Systems; v This covolutio sum is somewhat easier to perform tha the CT versio. Please see OWY sectio 3.2 ad TF sectio 8-4 for examples. 6 Exercise Recocile what you that about CT covolutio with what you kow about DT covolutio. Exercise i claim that you have already see DT covolutio as polyomial multiplicatio. For proof by example, multiply x 2 + 2x + 1by3x 2 + x + 2 ad the covolve x[] [, 2] +2[, 1] +[] ad y[] 3[, 2] + [, 1] +2[]. Compare your results. 4 DT Covolutio Tricks DT covolutio is commutative, associative, ad distributive over additio. Exercise Prove this. Covolutio with a impulse gives back the origial sigal: [] x[] k,1 x[] x[k][, k] where we have used the fact that [, k] is ozero oly at k, ad that at k it takes o value 1. Covolutio with a uit step gives the ruig sum: u[] x[] k,1 X k,1 x[k]u[, k] x[k] where we have used the fact that u[, k] is ozero oly for, k 0, or k. Covolutio with a shifted impulse shifts the origial sigal: [, 0 ] x[] k,1 x[, 0 ] x[k][, 0, k] where we have used the fact that [, 0, k] is ozero oly at k, 0. 5 Eigefuctios The output y[] of a DT LTI system H is just the covolutio of the iput x[] with the impulse respose h[]. What if we let x[] be of the form e jω,where! is some real costat? y[] x[] h[] k,1 k,1 X 1 e jω x[, k]h[k] e jω(,k) h[k] k,1 e jω H(e jω ) e,jωk h[k] 6 OWY refers to the first editio of your textbook ad TF to textbook used last semester. Be wared the DT sectios i TF preset the material i a sufficietly cofusig fashio that i do t recommed those sectios to you.

5 EE120: Sigals ad Systems; v where H(e jω ) P 1 k,1 e,jωk h[k]. We will see later that H(e jω ) is the discrete-time Fourier trasform (DTFT) of h[]. Note also that e jω is a eigefuctio. What if we let x[] be of the form z,wherez is some complex costat? y[] x[] h[] k,1 k,1 X 1 z k,1 z H(z) x[, k]h[k] z,k h[k] z,k h[k] where H(z) P 1 k,1 z,k h[k]. We will see later that H(z) is the trasform of h[]. Note also that z is a eigefuctio. 6 Siusoidal Steady State What is we put x[] cos Ω 0 ito a DT LTI system H? y[] x[] h[] (cos Ω 0 ) h[] 1 2 (ejω0 + e,jω0 ) h[] 1 2 (H(ejΩ0 )e jω0 + H(e,jW0 )e,jω0 ) If we kow othig about system H, this is all we ca say about the output y[]. However, if we kow that h[] is real, the we ca say somethig about H(e jω ). Cosider H (e jω ): H (e jω ) [ h[]e,jω ],1 h []e jω,1 h[]e,j(,ω),1 H(e,jΩ ) I other words, the DTFT H(e jω ) is cojugate symmetric. If we rewrite this i polar: H(e jω ) jh(e jω )je j 6 H(e jω ) H(e,jΩ ) jh(e,jω )je j 6 H(e,jΩ ) H (e jω ) jh(e jω )je,j 6 H(e jω ) The last two equatios are equivalet, as derived above. So we ca equate their magitudes ad phases. This lets us say that the magitude is goig to be eve ad the phase odd. jh(e,jω )j jh(e jω )j 6 H(e,jΩ ),6 H(e jω )

6 EE120: Sigals ad Systems; v So what? From above, we had the output of a DT system for a siusoidal iput: y[] 1 2 (H(ejΩ0 )e jω0 + H(e,jW0 )e,jω0 ) 1 2 [jh(ejω0 )je jω0+j 6 H(e jω 0) + jh(e,jw 0 )je,jω0+j 6 H(e,jW 0) ] 1 2 [jh(ejω0 )je jω0+j 6 H(e jω 0) + jh(e jw 0 )je,jω0,j 6 H(e jw 0) ] 1 2 jh(ejω0 )j[e jω0+j 6 H(e jω 0) + e,jω 0,j6 H(e jw 0) ] jh(e jω0 )j cos(ω H(e jω0 )) I other words, a siusoid iput gives a siusoid output, phase shifted by the phase of the frequecy respose ad amplitude scaled by the magitude respose. 7 Represetatios We begi our discussio of discrete time by otig that the sequece x[] ad the sequece x(t ) cotai the same iformatio. I fact, we ca defie x s (t) as the cotiuous time represetatio of x(t ) such that: x s (t) x(t )(t, T ),1 which is just a ifiite sum of impulses; this also cotais the same iformatio as the plai old sequece x[] or x(t ), except that it s a cotious fuctio, istead of a discrete oe. This should ot be too surprisig. We saw somethig similar to this whe we represeted the Fourier series coefficiets a k as a fuctio of k [this is just a sequece or list of values, a fuctio of a discrete variable], ad as a fuctio of! [this is just a ifiite sum of impulses, a fuctio of a cotiuous variable]. 8 Discrete-Time Fourier Trasform (DTFT) From the begiig of the semester, we saw the FT. Now, the FT trasforms a cotiuous time sigal x(t) ito a fuctio of cotious!. What happes if we try this o our cotious time represetatio of our sequece x[]? X s (j!) 1 x s (t)e,j!t dt,1 1 [ x(t )(t, T )]e,j!t dt,1,1 1 x(t )[ e,j!t (t, T )]dt,1,1 1 x(t )[ e,j!t (t, T )]dt,1,1 1 x(t )e,j!t [ (t, T )]dt,1,1 x(t )e,j!t,1 I cotious time, we decomposed x(t) ito cotious complex expoetials e j!t. I discrete time, we have decomposed x(t) ito discrete complex expoetials.

7 EE120: Sigals ad Systems; v If we replace x(t ) by x[], this last quatity is the DTFT: X(e j!t ) x[]e,j!t,1 The otatio X(e j!t ) deotes the DTFT. This otatio is more widely used tha the oe i the textbook. Note that the discrete complex expoetial e j!t is periodic with period 2 T : e j(!+ 2 T )T e j!t e 2 e j!t This meas that X(e j!t ) will be periodic with period 2 T. Now a slightly weird thig happes low frequecies show up at multiples of 2 T ad high frequecies ed up at multiples of T. To further supress the time depedece, the otatio Ω!T is itroduced, i which case the trasform X(e jω ) is periodic with period 2; low frequecies the occur at multiples of 2, ad high frequecies at multiples of. Exercise Give that Ω!T, covice yourself that the uits of Ω are radias per cycle. A slightly more ituitive reaso for why the DTFT is periodic: sice you ca t tell the differece betwee e j!t ad e j(!+k 2 T )T, you should t be able to tell what frequecy at which it appears i the frequecy domai either. There is aother iterpretatio of the DTFT, arisig from the fact that you ca thik of the time sigal as the sampled versio of some cotiuous time sigal x(t). To sample i time, you multiply i time by a impulse trai. This meas that you covolve i frequecy with a impulse trai, which makes your spectrum periodic. T ca the be iterpreted as the samplig period. More o this i the last few lectures. Note that multiplyig i time by a impulse trai is a mathematical trick that we use i order to derive the DTFT. What we ca actually do is sample our cotious time x(t) at periodic itervals t T to obtai x(t ). Repeat: multiplyig i time by a impulse trai is a math trick. The DTFT has a umber of properties which are summarized o pages of OWY; commo DTFT trasform pairs are give o OWY pages Persoally, i prefer to work with the trasform, ad the utilize the relatioship betwee the trasform ad the DTFT to fid a give DTFT. O the other had, if you kow that a certai sigal x[] came from samplig x(t) ad you kow X(!), the you ca quickly fid the DTFT by makig copies of X(!), separated by 2 T ad scaled by 1 T. More o this i the ext set of otes. 9 Fourier Series, Revisited Assume that x(t) is periodic with period T 2. Also, assume that x(t) is sufficietly well-behaved such that we ca represet it by a Fourier series: x(t) X e j!0t,1 The Fourier series coefficiets X ca be foud by multiplyig both sides by e,jm!0t ad itegratig over oe period T : x(t)e,jm!0t dt T X e j!0t e,jm!0t dt T,1 X e j!0t e,jm!0t dt,1 T We recall the orthogoality relatioship for complex expoetials: e j!0t e,jm!0t T if m dt 0 otherwise T

8 EE120: Sigals ad Systems; v This lets us reduce the equatio above to: x(t)e,jm!0t dt T X e j!0t e,jm!0t dt,1 T TX m X m 1 T This last equatio is the Fourier series aalysis itegral. If we take the Fourier trasform of x(t): X(!) F [x(t)] x(t)e,jm!0t dt T F [ X e j!0t ],1 X F [e j!0t ],1 2 X (!, ),1 where the X ca be foud by the Fourier series aalysis itegral above. Note that X is just a sequece of values, idexed o. The time sigal to which it correspods i the time domai is periodic i t. 10 DTFT, Revisited Assume that X(e j!t ) is periodic with period 2 T,whereT is the samplig period. We further assume that X(e j!t ) is sufficietly well-behaved such that we ca represet it by a Fourier series: X(e j!t ) x[]e,j!t,1 Note that we choose to use a egative sig, sice we re i the frequecy domai. The Fourier series coefficiet x[] ca be foud by multiplyig both sides by e jm!t ad itegratig over oe period : X(e j!t )e jm!t d! x[]e,j!t e jm!t d!,1 x[],1 We recall the orthogoality relatioship for complex expoetials: e,j!t e jm!t d! This lets us reduce the equatio above to: X(e j!t )e jm!t d!!0 x[],1 x[m] e,j!t e jm!t d! if m 0 otherwise e,j!t e jm!t d!

9 EE120: Sigals ad Systems; v This is the iverse DTFT. Takig the iverse Fourier trasform of X(e j!t ): x[m] 1 X(e j!t )e jm!t d! T 2 x(t) F,1 [X(e j!t )] 2 T X(e j!t )e jm!t d! F,1 [ x[]e,j!t ],1,1 x[]f,1 [e,j!t ] x[](t, T ),1 This is the DTFT. Note that x[] is just a sequece of values, idexed o. Its Fourier trasform is periodic i!. x(t) is just the cotiuous time represetatio of the discrete time sigal x[] as discussed above. NowwehavetheetireDTFTpair: X(e j!t ) x[] T 2 I ormalized frequecy, the DTFT pair becomes: X(e jω ) x[]e,j!t0,1 x[] T X(e j!t )e j!t0 d! x[]e,jω,1 X(e jω )e jω d! 2 I other words, periodic i oe domai implies discrete i the other. Here, periodic i frequecy [X(e jω )] implies discrete i time [the x[]], idexed o. From the previous sectio, periodic i time [x(t)] implies discrete i frequecy [the X ], idexed o. Exercise Does t this look familiar? i lifted it from ps7 solutios. Take aother look ad make sure that you ca see the duality relatioship betwee the FS ad the DTFT. 11 -Trasform (T) As with the DTFT, if we start out i cotiuous time ad the take the Laplace trasform of x s (t): X s (s) 1 x s (t)e,st dt,1 1 [ x(t )(t, T )]e,st dt,1,1 1 x(t )[ e,st (t, T )]dt,1,1

10 EE120: Sigals ad Systems; v x(t )[,1 1 x(t )e,st [,1 x(t )e,st,1 x[]z,,1 e,st (t, T )]dt,1 1 (t, T )]dt,1 where we have made the chage of otatio x(t )x[] ad z e st. This developmet is similar to that of the DTFT. So why do we bother studyig the trasform? For the same reaso as why we study the Laplace trasform there are some sigals for which the DTFT does ot exist. What is z e st? It s a coformal mappig betwee the s-plae ad the z-plae, takig vertical lies i the s-plae ad makig them ito circles i the z-plae [cosider s + j! ad ote that e T is the radius of a circle ad e j!t is the agle]. I particular, the j! axis eds up as the uit circle, the left half plae eds up iside the uit circle, ad the right half plae eds up outside. This also suggests that, for a system to be stable, its trasform should have poles iside the uit circle. Exercise Verify the cotets of this paragraph. For some values of z, the sum will ot coverge. Those values for which the sum does coverge comprise the regio of covergece (ROC) [compare to the ROC of the Laplace trasform]. The ROC is a circle cetered o the origi, with its radius the distace from the origi to the outermost pole. Because we cosider oly the uilateral trasform, the ROCs all go outwards. The properties are summarized o OWY page 654, ad are scattered throughout sectio 8-3 of TF; commo trasforms are available o OWY page 655, TF page Relatioships The relatioships betwee the five trasforms that you have studied ad the DTFS/DFS/DFT that you will see agai i ee123 are summarized i the followig table: R P 1 LT:X(s),1 x(t)e,st ze dt $ st 1 T:X(z) k,1 x[k]z,k s j! # z e j!t # R P 1 FT:X(j!),1 x(t)e,j!t discretize:tt dt! DTFT:X(e j!t 1 ),1 x[]e,j!t periodicize # periodicize # R FS:a k T x(t)e,jk!0t discretize:tt dt! DFS/DFT Give that you have the Laplace trasform of some time sigal x(t), if you evaluate the trasform o the j! axis, you ed up with the Fourier trasform. If you make the time sigal periodic, you ed up with a discrete spectrum [Fourier series]. O the other had, we could start with a cotious time sigal x(t) ad make it discrete. If we take its Laplace trasform ad utilize the coformal mappig z e st,wheret is the samplig period, we ed up with the trasform. Evaluatig the traform o the uit circle gives you the the DTFT. To get from the cotiuous time trasforms to the discrete time trasforms, we ca thik of takig our CT x(t) ad multiplyig it by a impulse trai to get x(t ). This is just a math trick though sice we oly care about the x(t ), we ca get this by samplig x(t) at itervals t T [perhaps by usig a sample-ad-hold, followed by a A/D coverter]. Exercise Follow the liks betwee the six trasforms ad try to get everythig straight i your mid. There s a lot of material summarized i that oe table, so make sure that it makes sese. Drop by durig office hours if ot.

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

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

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

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

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

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

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

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

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

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

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

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

6.3 Testing Series With Positive Terms

6.3 Testing Series With Positive Terms 6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial

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

Chapter 10: Power Series

Chapter 10: Power Series Chapter : Power Series 57 Chapter Overview: Power Series The reaso series are part of a Calculus course is that there are fuctios which caot be itegrated. All power series, though, ca be itegrated because

More information

Chapter 3. z-transform

Chapter 3. z-transform Chapter 3 -Trasform 3.0 Itroductio The -Trasform has the same role as that played by the Laplace Trasform i the cotiuous-time theorem. It is a liear operator that is useful for aalyig LTI systems such

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

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

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

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

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

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

Digital Signal Processing

Digital Signal Processing Digital Sigal Processig Z-trasform dftwave -Trasform Backgroud-Defiitio - Fourier trasform j ω j ω e x e extracts the essece of x but is limited i the sese that it ca hadle stable systems oly. jω e coverges

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

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

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

Statistics 511 Additional Materials

Statistics 511 Additional Materials Cofidece Itervals o mu Statistics 511 Additioal Materials This topic officially moves us from probability to statistics. We begi to discuss makig ifereces about the populatio. Oe way to differetiate probability

More information

Fall 2011, EE123 Digital Signal Processing

Fall 2011, EE123 Digital Signal Processing Lecture 5 Miki Lustig, UCB September 14, 211 Miki Lustig, UCB Motivatios for Discrete Fourier Trasform Sampled represetatio i time ad frequecy umerical Fourier aalysis requires a Fourier represetatio that

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

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

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

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

Math 113 Exam 3 Practice

Math 113 Exam 3 Practice Math Exam Practice Exam will cover.-.9. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for you

More information

Chapter 2 Systems and Signals

Chapter 2 Systems and Signals Chapter 2 Systems ad Sigals 1 Itroductio Discrete-Time Sigals: Sequeces Discrete-Time Systems Properties of Liear Time-Ivariat Systems Liear Costat-Coefficiet Differece Equatios Frequecy-Domai Represetatio

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

2D DSP Basics: 2D Systems

2D DSP Basics: 2D Systems - Digital Image Processig ad Compressio D DSP Basics: D Systems D Systems T[ ] y = T [ ] Liearity Additivity: If T y = T [ ] The + T y = y + y Homogeeity: If The T y = T [ ] a T y = ay = at [ ] Liearity

More information

Question1 Multiple choices (circle the most appropriate one):

Question1 Multiple choices (circle the most appropriate one): Philadelphia Uiversity Studet Name: Faculty of Egieerig Studet Number: Dept. of Computer Egieerig Fial Exam, First Semester: 2014/2015 Course Title: Digital Sigal Aalysis ad Processig Date: 01/02/2015

More information

x a x a Lecture 2 Series (See Chapter 1 in Boas)

x a x a Lecture 2 Series (See Chapter 1 in Boas) Lecture Series (See Chapter i Boas) A basic ad very powerful (if pedestria, recall we are lazy AD smart) way to solve ay differetial (or itegral) equatio is via a series expasio of the correspodig solutio

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

Discrete-time signals and systems See Oppenheim and Schafer, Second Edition pages 8 93, or First Edition pages 8 79.

Discrete-time signals and systems See Oppenheim and Schafer, Second Edition pages 8 93, or First Edition pages 8 79. Discrete-time sigals ad systems See Oppeheim ad Schafer, Secod Editio pages 93, or First Editio pages 79. Discrete-time sigals A discrete-time sigal is represeted as a sequece of umbers: x D fxœg; <

More information

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

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

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

Module 18 Discrete Time Signals and Z-Transforms Objective: Introduction : Description: Discrete Time Signal representation Module 8 Discrete Time Sigals ad Z-Trasforms Objective:To uderstad represetig discrete time sigals, apply z trasform for aalyzigdiscrete time sigals ad to uderstad the relatio to Fourier trasform Itroductio

More information

Math 113 Exam 3 Practice

Math 113 Exam 3 Practice Math Exam Practice Exam 4 will cover.-., 0. ad 0.. Note that eve though. was tested i exam, questios from that sectios may also be o this exam. For practice problems o., refer to the last review. This

More information

x[0] x[1] x[2] Figure 2.1 Graphical representation of a discrete-time signal.

x[0] x[1] x[2] Figure 2.1 Graphical representation of a discrete-time signal. x[ ] x[ ] x[] x[] x[] x[] 9 8 7 6 5 4 3 3 4 5 6 7 8 9 Figure. Graphical represetatio of a discrete-time sigal. From Discrete-Time Sigal Processig, e by Oppeheim, Schafer, ad Buck 999- Pretice Hall, Ic.

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

CHAPTER 10 INFINITE SEQUENCES AND SERIES

CHAPTER 10 INFINITE SEQUENCES AND SERIES CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece

More information

Linear time invariant systems

Linear time invariant systems Liear time ivariat systems Alejadro Ribeiro Dept. of Electrical ad Systems Egieerig Uiversity of Pesylvaia aribeiro@seas.upe.edu http://www.seas.upe.edu/users/~aribeiro/ February 25, 2016 Sigal ad Iformatio

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

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

Practical Spectral Anaysis (continue) (from Boaz Porat s book) Frequency Measurement

Practical Spectral Anaysis (continue) (from Boaz Porat s book) Frequency Measurement Practical Spectral Aaysis (cotiue) (from Boaz Porat s book) Frequecy Measuremet Oe of the most importat applicatios of the DFT is the measuremet of frequecies of periodic sigals (eg., siusoidal sigals),

More information

Once we have a sequence of numbers, the next thing to do is to sum them up. Given a sequence (a n ) n=1

Once we have a sequence of numbers, the next thing to do is to sum them up. Given a sequence (a n ) n=1 . Ifiite Series Oce we have a sequece of umbers, the ext thig to do is to sum them up. Give a sequece a be a sequece: ca we give a sesible meaig to the followig expressio? a = a a a a While summig ifiitely

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

Math 113 Exam 4 Practice

Math 113 Exam 4 Practice Math Exam 4 Practice Exam 4 will cover.-.. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for

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

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

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

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

The z-transform can be used to obtain compact transform-domain representations of signals and systems. It 3 4 5 6 7 8 9 10 CHAPTER 3 11 THE Z-TRANSFORM 31 INTRODUCTION The z-trasform ca be used to obtai compact trasform-domai represetatios of sigals ad systems It provides ituitio particularly i LTI system

More information

Math 2784 (or 2794W) University of Connecticut

Math 2784 (or 2794W) University of Connecticut ORDERS OF GROWTH PAT SMITH Math 2784 (or 2794W) Uiversity of Coecticut Date: Mar. 2, 22. ORDERS OF GROWTH. Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really

More information

MAT1026 Calculus II Basic Convergence Tests for Series

MAT1026 Calculus II Basic Convergence Tests for Series MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real

More information

Math 155 (Lecture 3)

Math 155 (Lecture 3) Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,

More information

Fall 2013 MTH431/531 Real analysis Section Notes

Fall 2013 MTH431/531 Real analysis Section Notes Fall 013 MTH431/531 Real aalysis Sectio 8.1-8. Notes Yi Su 013.11.1 1. Defiitio of uiform covergece. We look at a sequece of fuctios f (x) ad study the coverget property. Notice we have two parameters

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

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

The Growth of Functions. Theoretical Supplement

The Growth of Functions. Theoretical Supplement The Growth of Fuctios Theoretical Supplemet The Triagle Iequality The triagle iequality is a algebraic tool that is ofte useful i maipulatig absolute values of fuctios. The triagle iequality says that

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

MAT 271 Project: Partial Fractions for certain rational functions

MAT 271 Project: Partial Fractions for certain rational functions MAT 7 Project: Partial Fractios for certai ratioal fuctios Prerequisite kowledge: partial fractios from MAT 7, a very good commad of factorig ad complex umbers from Precalculus. To complete this project,

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

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

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

6.003: Signal Processing

6.003: Signal Processing 6.003: Sigal Processig Discrete-Time Fourier Series orthogoality of harmoically related DT siusoids DT Fourier series relatios differeces betwee CT ad DT Fourier series properties of DT Fourier series

More information

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

Analog and Digital Signals. Introduction to Digital Signal Processing. Discrete-time Sinusoids. Analog and Digital Signals Itroductio to Digital Sigal Processig Chapter : Itroductio Aalog ad Digital Sigals aalog = cotiuous-time cotiuous amplitude digital = discrete-time discrete amplitude cotiuous amplitude discrete amplitude

More information

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer. 6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio

More information

The Discrete-Time Fourier Transform (DTFT)

The Discrete-Time Fourier Transform (DTFT) EEL: Discrete-Time Sigals ad Systems The Discrete-Time Fourier Trasorm (DTFT) The Discrete-Time Fourier Trasorm (DTFT). Itroductio I these otes, we itroduce the discrete-time Fourier trasorm (DTFT) ad

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

Solution of EECS 315 Final Examination F09

Solution of EECS 315 Final Examination F09 Solutio of EECS 315 Fial Examiatio F9 1. Fid the umerical value of δ ( t + 4ramp( tdt. δ ( t + 4ramp( tdt. Fid the umerical sigal eergy of x E x = x[ ] = δ 3 = 11 = ( = ramp( ( 4 = ramp( 8 = 8 [ ] = (

More information

Chapter 8. DFT : The Discrete Fourier Transform

Chapter 8. DFT : The Discrete Fourier Transform Chapter 8 DFT : The Discrete Fourier Trasform Roots of Uity Defiitio: A th root of uity is a complex umber x such that x The th roots of uity are: ω, ω,, ω - where ω e π /. Proof: (ω ) (e π / ) (e π )

More information

FFTs in Graphics and Vision. The Fast Fourier Transform

FFTs in Graphics and Vision. The Fast Fourier Transform FFTs i Graphics ad Visio The Fast Fourier Trasform 1 Outlie The FFT Algorithm Applicatios i 1D Multi-Dimesioal FFTs More Applicatios Real FFTs 2 Computatioal Complexity To compute the movig dot-product

More information

Additional Notes on Power Series

Additional Notes on Power Series Additioal Notes o Power Series Mauela Girotti MATH 37-0 Advaced Calculus of oe variable Cotets Quick recall 2 Abel s Theorem 2 3 Differetiatio ad Itegratio of Power series 4 Quick recall We recall here

More information

The Discrete Fourier Transform

The Discrete Fourier Transform The iscrete Fourier Trasform The discrete-time Fourier trasform (TFT) of a sequece is a cotiuous fuctio of!, ad repeats with period. I practice we usually wat to obtai the Fourier compoets usig digital

More information

MAXIMALLY FLAT FIR FILTERS

MAXIMALLY FLAT FIR FILTERS MAXIMALLY FLAT FIR FILTERS This sectio describes a family of maximally flat symmetric FIR filters first itroduced by Herrma [2]. The desig of these filters is particularly simple due to the availability

More information

PRELIM PROBLEM SOLUTIONS

PRELIM PROBLEM SOLUTIONS PRELIM PROBLEM SOLUTIONS THE GRAD STUDENTS + KEN Cotets. Complex Aalysis Practice Problems 2. 2. Real Aalysis Practice Problems 2. 4 3. Algebra Practice Problems 2. 8. Complex Aalysis Practice Problems

More information

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

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + 62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of

More information

CHAPTER I: Vector Spaces

CHAPTER I: Vector Spaces CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig

More information

Chapter 4. Fourier Series

Chapter 4. Fourier Series Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,

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

Section 1.1. Calculus: Areas And Tangents. Difference Equations to Differential Equations

Section 1.1. Calculus: Areas And Tangents. Difference Equations to Differential Equations Differece Equatios to Differetial Equatios Sectio. Calculus: Areas Ad Tagets The study of calculus begis with questios about chage. What happes to the velocity of a swigig pedulum as its positio chages?

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

ELEC1200: A System View of Communications: from Signals to Packets Lecture 3

ELEC1200: A System View of Communications: from Signals to Packets Lecture 3 ELEC2: A System View of Commuicatios: from Sigals to Packets Lecture 3 Commuicatio chaels Discrete time Chael Modelig the chael Liear Time Ivariat Systems Step Respose Respose to sigle bit Respose to geeral

More information

Sequences. Notation. Convergence of a Sequence

Sequences. Notation. Convergence of a Sequence Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it

More information

Complex Analysis Spring 2001 Homework I Solution

Complex Analysis Spring 2001 Homework I Solution Complex Aalysis Sprig 2001 Homework I Solutio 1. Coway, Chapter 1, sectio 3, problem 3. Describe the set of poits satisfyig the equatio z a z + a = 2c, where c > 0 ad a R. To begi, we see from the triagle

More information

Math 113, Calculus II Winter 2007 Final Exam Solutions

Math 113, Calculus II Winter 2007 Final Exam Solutions Math, Calculus II Witer 7 Fial Exam Solutios (5 poits) Use the limit defiitio of the defiite itegral ad the sum formulas to compute x x + dx The check your aswer usig the Evaluatio Theorem Solutio: I this

More information

Advanced Analysis. Min Yan Department of Mathematics Hong Kong University of Science and Technology

Advanced Analysis. Min Yan Department of Mathematics Hong Kong University of Science and Technology Advaced Aalysis Mi Ya Departmet of Mathematics Hog Kog Uiversity of Sciece ad Techology September 3, 009 Cotets Limit ad Cotiuity 7 Limit of Sequece 8 Defiitio 8 Property 3 3 Ifiity ad Ifiitesimal 8 4

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

Chapter 6 Infinite Series

Chapter 6 Infinite Series Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat

More information

Seunghee Ye Ma 8: Week 5 Oct 28

Seunghee Ye Ma 8: Week 5 Oct 28 Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value

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

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

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science. Fall Problem Set 11 Solutions.

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science. Fall Problem Set 11 Solutions. Massachusetts Istitute of Techology Departmet of Electrical Egieerig ad Computer Sciece Issued: Thursday, December 8, 005 6.341: Discrete-Time Sigal Processig Fall 005 Problem Set 11 Solutios Problem 11.1

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