Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution
|
|
- Gabriel Stewart
- 5 years ago
- Views:
Transcription
1 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 [ ] to produce a output sequece y [ ]. Examples of such s iclude audio filters ad feedback cotrol s. Ulike the off-lie filterig example i the previous set of otes, these s produce a output i real-time (o-lie as iput is fed ito the. I their most geeral form, discrete-time s produce a output y [ ] at time idex that is a fuctio of previous output values, as well as past, curret ad future values of the iput: y [ ] fy ( [ ],, y [ N], x [ + ],, x [ + ], x [ ], x [ ],, x [ ], N, > 0. ( Below, we first classify discrete-time s by three importat properties: ( causality, (2 time-ivariace ad ( liearity. We the defie a importat class of discrete-time s amely, Liear, Time-Ivariat (LTI s. Next, we defie the cocept of the uit-impulse respose of a, ad classify LTI s ito Fiite Impulse Respose (FIR ad Ifiite Impulse Respose (IIR s. Fially, we itroduce the discrete-time covolutio operatio, ad show that a discrete-time is completely characterized by its uitimpulse respose. 2. Importat characterizatios A. Causality Defiitio: A is said to be causal if ad oly if its output depeds oly o previous values of the output ad curret ad/or previous values of the iput. If a is ot causal, it is said to be ocausal. Examples: Cosider the below: y [ ] -- ( x [ ] + x [ + ] + x [ + 2] The i equatio (2 is ocausal because the output y [ ] depeds o future values of the iput x [ ]. For example, the output at 0 is depedet o the iput for { 02,, }. I Figure 2, we plot a sample output sequece correspodig to a sample iput sequece for (2. Note that for this ocausal, the output precedes the iput. To compute the value of y [ ] for ay specific for the plotted iput sequece, we simply apply equatio (2 above. For example, y[ ] is give by, y[ ] -- ( x[ ] + x[ 0] + x[ ] -- ( ( Now, cosider a secod below: y [ ] -- ( x [ ] + x [ ] + x [ 2] x [ ] y [ ] discrete-time (DT Figure The i equatio (4 is causal because the output y [ ] depeds oly o preset ad past values of the iput x [ ]. For example, the output at 0 is depedet o the iput for { 0,, 2}. I Figure, we plot a sample output sequece correspodig to a sample iput sequece for (4. Note that for this causal, the output follows the iput. To compute the value of y [ ] for ay specific for the plotted iput sequece, we simply apply equatio (4 above. For example, y[ 2] is give by, (2 (4 - -
2 EEL5: Discrete-Time Sigals ad Systems Nocausal x [ ] y [ ] Figure 2 Causal x [ ] y [ ] Figure y[ 2] -- ( x[ 2] + x[ ] + x[ 0] -- ( (5 I geeral, the class of causal discrete-time s is give by, y [ ] fy ( [ ],, y [ N], x [ ], x [ ],, x [ ], N, > 0. (6 B. Time ivariace Defiitio: A is said to be time-ivariat if ad oly if, x [ ] y [ ] implies x [ 0 ] y [ 0 ]. (7 That is, if a produces output y [ ] for iput x [ ], a time-ivariat will produce the timedelayed output y [ 0 ] for the time-delayed iput x [ 0 ]. If a is ot time-ivariat, it is said to be time-variat. Aother way to look at time-ivariace is depicted i Figure 4 below. A time-ivariat will produce the same output regardless of whether a time delay precedes or follows the. I Figure 4, that meas that for a time-ivariat, w [ ] y [ 0 ]. (8 Examples: Cosider the below: y [ ] x [ ] 2 The i equatio (9 is time-ivariat. We will show this by applyig the procedure depicted i Figure 4. First, we follow the top path i the diagram: (9-2 -
3 EEL5: Discrete-Time Sigals ad Systems time delay x [ 0 ] w [ ] x [ ] y [ ] time delay y [ 0 ] Figure 4 w [ ] x [ 0 ] 2 (0 Note that we simply replaced x [ ] with x [ 0 ] i equatio (9 to produce w [ ]. Next, we follow the bottom path i the diagram: y [ 0 ] x [ 0 ] 2 ( Note that i this case, we first compute y [ ] [equatio (9] ad the replace with 0. Sice (0 ad ( are equivalet, (9 is time-ivariat. Next, cosider the below: y [ ] x[ ] (2 Let us agai compute w [ ] ad y [ 0 ]: w [ ] x[ 0 ] y [ 0 ] ( 0 x [ 0 ] ( (4 To geerate w [ ], we substituted x [ 0 ] for x [ ] i equatio (2; to geerate y [ 0 ] we substituted 0 for. Note that sice w [ ] ad y [ 0 ] produce differet results, (2 is time-variat. Next, cosider the below: y [ ] x[ ] (5 Let us agai compute w [ ] ad y [ 0 ]: w [ ] x[ 0 ] y [ 0 ] x[ ( 0 ] x[ + 0 ] (6 (7 To geerate w [ ], we substituted x[ 0 ] for x[ ] i equatio (5; to geerate y [ 0 ] we substituted 0 for. Note that sice w [ ] ad y [ 0 ] produce differet results, (5 is time-variat. Fially, cosider the below: y [ ] b k x [ Let us agai compute w [ ] ad y [ 0 ]: w [ ] b k x [ 0 (8 (9 - -
4 EEL5: Discrete-Time Sigals ad Systems y [ 0 ] b k x [ 0 To geerate w [ ], we substituted x [ 0 for x [ i equatio (8; to geerate y [ 0 ] we substituted 0 for. Note that sice w [ ] ad y [ 0 ] produce the same outcome, (8 is timeivariat. The table below summarizes the above results ad gives two more examples. (20 y [ ] x [ ] 2 y [ ] x[ ] y [ ] x[ ] y [ ] b k x [ y [ ] cos( x [ ] x [ ] y [ ] 2 x [ ] time ivariat? yes o o yes yes o C. Liearity Defiitio: A is said to be liear if ad oly if, x [ ] y [ ] ad x 2 [ ] y 2 [ ] implies αx [ ] + βx 2 [ ] αy [ ] + βy 2 [ ] (2 for arbitrary scalars α ad β. That is, if a produces output y [ ] for iput x [ ], ad output y 2 [ ] for iput x 2 [ ], a liear will produce the output αy [ ] + βy 2 [ ] for the iput αx [ ] + βx 2 [ ]. If a is ot liear, it is said to be oliear. Aother way to look at liearity is depicted i Figure 5 below. A liear will produce the same output regardless of whether the iputs or outputs are summed ad scaled. I Figure 5, that meas that for a liear, w [ ] y [ ]. (22 Examples: Below, we first cosider the same s as we did for time ivariace ad the show two additioal examples. First, let us cosider: y [ ] x [ ] 2 The i equatio (2 is oliear. We will show this by applyig the procedure depicted i Figure 5. First, we apply the top diagram i Figure 5: y [ ] x [ ] 2, y 2 [ ] x 2 [ ] 2 (24 (2 w [ ] αy [ ] + βy 2 [ ] αx [ ] 2 + βx 2 [ ] 2 (25 Next, we follow the bottom diagram i Figure 5: x [ ] αx [ ] + βx 2 [ ] y [ ] x [ ] 2 ( αx [ ] + βx 2 [ ] 2 α 2 x [ ] 2 + 2αβx [ ]x 2 [ ] + βx 2 [ ] 2 (26 (27 Sice the results i equatios (25 ad (27 are differet, (2 is oliear
5 EEL5: Discrete-Time Sigals ad Systems x [ ] y [ ] α x 2 [ ] y 2 [ ] β w [ ] α x [ ] β x [ ] y [ ] x 2 [ ] Figure 5 Next, cosider the below: y [ ] x[ ] (28 Let us follow the same procedures as i the previous example: y [ ] x [ ], y 2 [ ] x 2 [ ] (29 w [ ] αy [ ] + βy 2 [ ] αx [ ] + βx 2 [ ] (0 Next: x [ ] αx [ ] + βx 2 [ ] y [ ] x[ ] ( αx [ ] + βx 2 [ ] αx [ ] + βx 2 [ ] ( (2 Sice the results i equatios (0 ad (2 are the same, (28 is liear. Next, cosider the below: y [ ] x[ ] ( Let us follow the same procedures as i the previous example: y [ ] x [ ], y 2 [ ] x 2 [ ] (4 w [ ] αy [ ] + βy 2 [ ] αx [ ] + βx 2 [ ] (5 Next: x [ ] αx [ ] + βx 2 [ ] y [ ] x[ ] αx [ ] + βx 2 [ ] (6 (7 Sice the results i equatios (5 ad (7 are the same, ( is liear
6 EEL5: Discrete-Time Sigals ad Systems Next, cosider the below: y [ ] b k x [ Let us follow the same procedures as i the previous example: (8 y [ ] b k x [, y 2 [ ] b k x 2 [ (9 w [ ] αy [ ] + βy 2 [ ] α b k x [ k ] + β b k x 2 [ b k ( αx [ + βx 2 [ Next: x [ ] αx [ ] + βx 2 [ ] y [ ] b k ( αx [ + βx 2 [ Sice the results i equatios (40 ad (42 are the same, (8 is liear. (40 (4 (42 Below, we cosider two additioal s. First, let us cosider: y [ ] 2x[ ] + ( 2 x [ ] + x[ 5] Agai, we follow the same procedure as before: y [ ] 2x [ ] + ( 2 x [ ] + x [ 5] y 2 [ ] 2x 2 [ ] + ( 2 x 2 [ ] + x 2 [ 5] w [ ] αy [ ] + βy 2 [ ] α( 2x [ ] + ( 2 x [ ] + x [ 5] + β( 2x 2 [ ] + ( 2 x 2 [ ] + x 2 [ 5] (4 (44 (45 (46 Next: x [ ] αx [ ] + βx 2 [ ] y [ ] 2x[ ] + ( 2 x [ ] + x[ 5] 2( αx [ ] + βx 2 [ ] + ( 2 ( αx [ ] + βx 2 [ ] + ( αx [ 5] + βx 2 [ 5] α( 2x [ ] + ( 2 x [ ] + x [ 5] + β( 2x 2 [ ] + ( 2 x 2 [ ] + x 2 [ 5] (47 (48 Sice the results i equatios (46 ad (48 are the same, (4 is liear. Fially, we cosider the below: y [ ] x[ ] + Agai, we follow the same procedure as before: y [ ] x [ ] + (49 (50-6 -
7 EEL5: Discrete-Time Sigals ad Systems y 2 [ ] x 2 [ ] + w [ ] αy [ ] + βy 2 [ ] α( x [ ] + + β( x 2 [ ] + αx [ ] + βx 2 [ ] +( α+ β (5 (52 Next: x [ ] αx [ ] + βx 2 [ ] y [ ] x[ ] + ( αx [ ] + βx 2 [ ] + αx [ ] + βx 2 [ ] + (5 (54 Sice the results i equatios (52 ad (54 are differet, (49 is oliear. Note that i this case, although the looks liear, the costat term makes the oliear. The table below summarizes the above examples. liear? y [ ] x [ ] 2 y [ ] x[ ] y [ ] x[ ] y [ ] b k x [ y [ ] 2x[ ] + ( 2 x [ ] + x[ 5] y [ ] x[ ] + o yes yes yes yes o. Liear, Time-Ivariat s The class of causal discrete-time Liear, Time-Ivariat (LTI s ca be described by the followig differece equatio: N y [ ] a l y l + b k x [ l for costat coefficiets a l ad b k. I this course, we will cofie our study to LTI s. There are at least two importat reasos for this. First, LTI s led themselves to aalysis that more geeral s do ot. We will see a extremely importat case of this i the ext sectio, where we will characterize a LTI etirely by its impulse respose; this same aalysis is ot possible, i geeral, for more geeral discrete-time s. Secod, all discrete-time s ca be approximated as LTI s over short time costats. Nevertheless, it is importat to realize that may s i real life may ot be, strictly speakig, LTI s, but ca oly be approximated as such. (55-7 -
8 EEL5: Discrete-Time Sigals ad Systems 4. Impulse respose ad discrete-time covolutio A. Impulse respose The uit impulse respose of a is defied as the output h [ ] of a i respose to a uit impulse δ[ ], where, δ[ ] (56 is plotted i Figure 6 below. δ[ ] δ[ ] h [ ] discrete-time (DT Figure 6 Note that for causal s, h [ ] 0, < 0. (57 That is, a causal is at rest prior to the arrival of a impulse at 0. B. Classificatio of LTI s by impulse respose Previously, we have classified causal discrete-time LTI s ito two broad categories: ( o-recursive ad (2 recursive. Recall that o-recursive s are give by the followig differece equatio: y [ ] b k x [. (58 Note that o-recursive s do ot refer to previous values of the output, while recursive s, N y [ ] a l y l + b k x [ l are ot oly a fuctio of the iput to the, but previous outputs as well. Give our defiitio of the uit-impulse respose h [ ] above, we will ow label these two categories of LTI s by their impulse respose characteristics. No-recursive s i (58 are also kow as Fiite Impulse Respose (FIR s, while recursive s i (59 are also kow as Ifiite Impulse Respose (IIR s. These ames idicate that o-recursive s have a impulse respose that is fiite i legth, while recursive s have a impulse respose that is ifiite i legth. Let us cosider oe specific example of each type of. I Figure 7, we plot the impulse resposes of the followig two s: (59 y [ ] --x[ ] + --x[ ] + --x[ 2] (FIR example (60 y [ ] ( 9 0y [ ] + x [ ] (IIR example. (6-8 -
9 EEL5: Discrete-Time Sigals ad Systems FIR example δ[ ] h [ ] IIR example δ[ ] h [ ] Note that the FIR s impulse respose h [ ] is limited i time, while the IIR s impulse respose h [ ] oly goes to zero as ; that is the IIR s impulse respose is ifiite i legth. C. Discrete-time covolutio Figure 7 A truly remarkable fact that applies to LTI s is that such s ca be completely characterized by their impulse respose. That is, oce we kow h [ ] for a give, we ca compute the output y [ ] for that for ay iput sequece x [ ]. This extremely importat fact follows from the fact that we ca express ay iput sequece x [ ] as the sum of weighted ad time-shifted impulse fuctios: x [ ] xk [ ]δ[ k For example, the discrete-time sigal x [ ] i Figure 8 below ca be writte as: x [ ] δ[ + ] + 2δ[ ] + 2δ[ ] δ[ 2]. (6 δ[ ] ( Figure 8 Now, let us assume that the respose of a LTI to a uit impulse δ[ ] is give by h [ ]: δ[ ] h [ ] By time-ivariace of a LTI, we kow that: δ[ h [. (65 That is, a time-shifted impulse δ[ at the iput will result i a time-shifted impulse respose h [. By liearity of a LTI, we kow that: xk [ ]δ[ xk [ ]h [ That is, a weighted, time-shifted impulse results i a weighted, time-shifted impulse respose. Fially, the sum of weighted, time-shifted impulses results i the sum of weighted, time-shifted impulse resposes: (64 (66-9 -
10 EEL5: Discrete-Time Sigals ad Systems k xk [ ]δ[ k xk [ ]h [ (67 Hece, the output y [ ] correspodig to a iput x [ ] for a LTI ca be writte as: x [ ] xk [ ]δ[ k y [ ] xk [ ]h [ k (68 (69 Equatio (69 represets the discrete-time covolutio of the iput sequece x [ ] with the impulse respose h [ ]. Note that the discrete-time covolutio is etirely defied by the impulse respose of the ad the iput sequece to the. The cocept of discrete-time covolutio is so importat that we have a special otatio for it: y [ ] x [ ] * h[ ] (70 where the * operator deotes the covolutio of x [ ] ad h [ ]. Note that equatio (70 is short-had otatio for equatio ( Importat covolutio properties I this sectio, we list ad prove some of the importat properties of the covolutio operator. A. Commutative property For ay two discrete-time sequeces x [ ] ad y [ ], the commutative property holds: x [ ] * y[ ] y [ ] * x[ ] (7 Proof: x [ ] * y[ ] xk [ ]y [ k y [ ] * x[ ] yk [ ]x [ k (72 (7 I equatio (7, let us make the substitutio k l ad sum over the ew variable l y [ ] * x[ ] y [ l]xl [] l l xl []y [ l] (74 Chagig the idex i equatio (74 from l back to k : y [ ] * x[ ] xk [ ]y [ k x [ ] * y[ ] (75 ad hece the proof is complete.. Note that here we use x [ ] ad y [ ] to deote ay discrete-time sequeces, ot ecessarily a iput ad output sequece, respectively
11 EEL5: Discrete-Time Sigals ad Systems B. Associative property For ay three discrete-time sequeces x [ ], y [ ] ad z [ ], the associative property holds: ( x [ ] * y[ ] * z[ ] x [ ] * ( y [ ] * z[ ] Proof: ( x [ ] * y[ ] * z[ ] xk [ ]yl [ z [ l] l k x [ ] * ( y [ ] * z[ ] xl [] yk [ ]z [ l l k I equatio (78, let us make the substitutio q l+ k ad sum over the ew variable q : x [ ] * ( y [ ] * z[ ] xl [] yq [ l]z [ q] l q xl []yq [ l]z [ q] l q xl []yq [ l]z [ q] Chagig the idices i equatio (79 from q to l, ad from l to k : q l xl []yq [ l] z [ q] q l (76 (77 (78 (79 x [ ] * ( y [ ] * z[ ] xk [ ]yl [ z [ l] l k ad hece the proof is complete. C. ultiple s ( x [ ] * y[ ] * z[ ] (80 Here we cosider the impulse respose of two LTI s coected i series, as depicted i Figure 9 below: LTI # LTI #2 x [ ] h [ ] w [ ] h 2 [ ] y [ ] Figure 9 Note that the two LTI s are assumed to have the impulse resposes h [ ] ad h 2 [ ], respectively. Usig the associative property of the covolutio operator, w [ ] x [ ] * h [ ] (8 y [ ] w [ ] * h 2 [ ] ( x [ ] * h [ ] * h 2 [ ] x [ ] * ( h [ ] * h 2 [ ] (82 Lettig, h [ ] h [ ] * h 2 [ ], (8 - -
12 EEL5: Discrete-Time Sigals ad Systems we ca express the output y [ ] as, y [ ] x [ ] * h[ ]. (84 Thus, the impulse respose of two LTI s coected i series is give by the covolutio of the idividual impulse resposes. D. Covolutio with a impulse For ay discrete-time sequece x [ ], the followig property holds: x [ ] * δ[ 0 ] x [ 0 ] (85 Proof: x [ ] * δ[ 0 ] xk [ ]δ[ 0 k Note that δ[ 0 is ozero oly for k 0. Therefore, we ca rewrite equatio (86 as: x [ ] * δ[ 0 ] x [ 0 ] (86 (87 ad hece the proof is complete. 6. Simple covolutio example Below we show two approaches to computig the covolutio sum for the sample iput sequece x [ ] ad fiite impulse respose fuctio h [ ] plotted i Figure 0 below x [ ] 2 h [ ] Figure A. Approach # I this first approach, we use equatio (69 to compute the output y [ ]: y [ ] xk [ ]h [ k Let us deote [,, 2, ] as the covolutio mask (vector, cosistig of the ozero terms of the impulse respose. I order to compute y [ ], we first reverse the order of the covolutio mask to give the vector [ 2,,, ]. We the slide this reversed covolutio mask alog the iput sequece x [ ] ad take the dot product of the reversed covolutio mask ad that part of the iput sequece x [ ] overlappig the reversed covolutio mask. This process is illustrated i Table for { 0,,, 78, }.Note that the dot product of two vectors a ad b is give by, (88 a [ a, a 2,, a l ] (89-2 -
13 EEL5: Discrete-Time Sigals ad Systems k xk [ ] h[ y[ 0] [ 0002,,, ] [ 2,,, ] 6 h[ 2 - y[ ] [ 0024,,, ] [ 2,,, ] 0 2 h[ y[ 2] [ 0246,,, ] [ 2,,, ] 8 h[ 2 - y[ ] 6 a 4 h[ 4 y[ 4] 8 b 2-5 h[ 5 y[ 5] [ 6420,,, ] [ 2,,, ] h[ 6 y[ 6] [ 4200,,, ] [ 2,,, ] h[ 7 y[ 7] [ 2000,,, ] [ 2,,, ] h[ 8 y[ 8] [ 0000,,, ] [ 2,,, ] a. Dot product terms ot show for space reasos ([ 2464,,, ] [ 2,,, ]. b. Dot product terms ot show for space reasos ([ 4642,,, ] [ 2,,, ]. Table b [ b, b 2,, b l ] (90 a b [ a, a 2,, a l ] [ b, b 2,, b l ] l k a k b k (9 Figure below plots the covolutio of x [ ] ad h [ ] from Figure 0 above. 20 x [ ] * h[ ] Figure B. Approach #2 I the secod approach, we use the commutative property of covolutio to express the covolutio sum as follows: y [ ] h [ ] * x[ ] hk [ ]x [ k (92 - -
14 EEL5: Discrete-Time Sigals ad Systems Table 2 below illustrates how we ca use equatio (92 to compute the covolutio sum. We first write dow x [ ] ad h [ ]. The, we multiply each ozero elemet of hk [ ] by x [ ], ad shift the resultig vectors to the right by k spaces. For example, correspods to a zero shift, while k 2 correspods to a shift of two time uits to the right. Fially, to compute y [ ], we add the resultig colums. Note that this procedure results i exactly the same result as the previous approach. x [ ] h [ ] h[ 0]x [ 0] h[ ]x [ ] h[ 2]x [ 2] h[ ]x [ ] y [ ] Coclusio Table 2 I this set of otes, we first itroduced importat properties of discrete-time s, icludig causality, timeivariace ad liearity. We the defied the class of Liear, Time-Ivariat (LTI s, ad showed how the impulse respose completely characterized such s through the discrete-time covolutio operator. Next, we showed importat properties of the covolutio operator, such as the commutative ad associative properties, ad illustrated two approaches for computig the covolutio sum by had for fiite-impulse respose s
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 informationFrequency 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 informationSignals 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 informationComputing 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 informationIntroduction 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 informationFIR 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 informationFIR Filters. Lecture #7 Chapter 5. BME 310 Biomedical Computing - J.Schesser
FIR Filters Lecture #7 Chapter 5 8 What Is this Course All About? To Gai a Appreciatio of the Various Types of Sigals ad Systems To Aalyze The Various Types of Systems To Lear the Skills ad Tools eeded
More informationADVANCED 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 informationDIGITAL SIGNAL PROCESSING LECTURE 3
DIGITAL SIGNAL PROCESSING LECTURE 3 Fall 2 2K8-5 th Semester Tahir Muhammad tmuhammad_7@yahoo.com Cotet ad Figures are from Discrete-Time Sigal Processig, 2e by Oppeheim, Shafer, ad Buc, 999-2 Pretice
More informationInfinite 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 informationGEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING
GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING ECE 06 Summer 07 Problem Set #5 Assiged: Jue 3, 07 Due Date: Jue 30, 07 Readig: Chapter 5 o FIR Filters. PROBLEM 5..* (The
More informationSignal 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 informationOlli 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 informationDiscrete-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 informationThe 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 informationx[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 informationECE 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 informationZ - 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 informationFilter 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 informationSignals & 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 informationEE / 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 informationTime-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 informationChapter 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 informationM2.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 informationELEG3503 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 informationLinear 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 informationCHAPTER 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 informationECE4270 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 informationQuestion1 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 informationCh3 Discrete Time Fourier Transform
Ch3 Discrete Time Fourier Trasform 3. Show that the DTFT of [] is give by ( k). e k 3. Determie the DTFT of the two sided sigal y [ ],. 3.3 Determie the DTFT of the causal sequece x[ ] A cos( 0 ) [ ],
More information3. 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 informationSECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES
SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,
More information6.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 informationFIR Filter Design: Part I
EEL3: Discrete-Time Sigals ad Systems FIR Filter Desig: Part I. Itroductio FIR Filter Desig: Part I I this set o otes, we cotiue our exploratio o the requecy respose o FIR ilters. First, we cosider some
More informationChapter 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 information2D 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 informationLecture 2 Linear and Time Invariant Systems
EE3054 Sigals ad Systems Lecture 2 Liear ad Time Ivariat Systems Yao Wag Polytechic Uiversity Most of the slides icluded are extracted from lecture presetatios prepared by McClella ad Schafer Licese Ifo
More informationEEO 401 Digital Signal Processing Prof. Mark Fowler
EEO 40 Digital Sigal Processig Prof. Mark Fowler Note Set #3 Covolutio & Impulse Respose Review Readig Assigmet: Sect. 2.3 of Proakis & Maolakis / Covolutio for LTI D-T systems We are tryig to fid y(t)
More informationPrinciple Of Superposition
ecture 5: PREIMINRY CONCEP O RUCUR NYI Priciple Of uperpositio Mathematically, the priciple of superpositio is stated as ( a ) G( a ) G( ) G a a or for a liear structural system, the respose at a give
More informationFall 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 informationWeb 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 informationAppendix: 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 informationSignal 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 informationPhysics 324, Fall Dirac Notation. These notes were produced by David Kaplan for Phys. 324 in Autumn 2001.
Physics 324, Fall 2002 Dirac Notatio These otes were produced by David Kapla for Phys. 324 i Autum 2001. 1 Vectors 1.1 Ier product Recall from liear algebra: we ca represet a vector V as a colum vector;
More informationEECE 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 informationCHAPTER 5. Theory and Solution Using Matrix Techniques
A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL
More informationDiscrete-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 informationSIGNALS AND SYSTEMS I Computer Assignment 1
SIGNALS AND SYSTEMS I Computer Assigmet I MATLAB, sigals are represeted by colum vectors or as colums i matrices. Row vectors ca be used; however, MATLAB typically prefers colum vectors. Vector or matrices
More informationDiscrete-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 informationELEG 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 information6.867 Machine learning, lecture 7 (Jaakkola) 1
6.867 Machie learig, lecture 7 (Jaakkola) 1 Lecture topics: Kerel form of liear regressio Kerels, examples, costructio, properties Liear regressio ad kerels Cosider a slightly simpler model where we omit
More informationFinite-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 informationIf a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?
2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a
More informationSolutions. 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 informationMost text will write ordinary derivatives using either Leibniz notation 2 3. y + 5y= e and y y. xx tt t
Itroductio to Differetial Equatios Defiitios ad Termiolog Differetial Equatio: A equatio cotaiig the derivatives of oe or more depedet variables, with respect to oe or more idepedet variables, is said
More informationChapter 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 informationThe 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 informationExponential 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 informationAnalog 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 informationExam. Notes: A single A4 sheet of paper (double sided; hand-written or computer typed)
Exam February 8th, 8 Sigals & Systems (5-575-) Prof. R. D Adrea Exam Exam Duratio: 5 Mi Number of Problems: 5 Number of Poits: 5 Permitted aids: Importat: Notes: A sigle A sheet of paper (double sided;
More informationChapter 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 informationA. 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 informationChapter 9 - CD companion 1. A Generic Implementation; The Common-Merge Amplifier. 1 τ is. ω ch. τ io
Chapter 9 - CD compaio CHAPTER NINE CD-9.2 CD-9.2. Stages With Voltage ad Curret Gai A Geeric Implemetatio; The Commo-Merge Amplifier The advaced method preseted i the text for approximatig cutoff frequecies
More information2.4 - Sequences and Series
2.4 - Sequeces ad Series Sequeces A sequece is a ordered list of elemets. Defiitio 1 A sequece is a fuctio from a subset of the set of itegers (usually either the set 80, 1, 2, 3,... < or the set 81, 2,
More informationRademacher Complexity
EECS 598: Statistical Learig Theory, Witer 204 Topic 0 Rademacher Complexity Lecturer: Clayto Scott Scribe: Ya Deg, Kevi Moo Disclaimer: These otes have ot bee subjected to the usual scrutiy reserved for
More informationMASSACHUSETTS 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 informationCEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering
CEE 5 Autum 005 Ucertaity Cocepts for Geotechical Egieerig Basic Termiology Set A set is a collectio of (mutually exclusive) objects or evets. The sample space is the (collectively exhaustive) collectio
More informationFortgeschrittene Datenstrukturen Vorlesung 11
Fortgeschrittee Datestruture Vorlesug 11 Schriftführer: Marti Weider 19.01.2012 1 Succict Data Structures (ctd.) 1.1 Select-Queries A slightly differet approach, compared to ra, is used for select. B represets
More informationELEC1200: 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 informationThe 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 informationMa 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 informationRecurrence Relations
Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The
More informationApply 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 informationRecursive Algorithm for Generating Partitions of an Integer. 1 Preliminary
Recursive Algorithm for Geeratig Partitios of a Iteger Sug-Hyuk Cha Computer Sciece Departmet, Pace Uiversity 1 Pace Plaza, New York, NY 10038 USA scha@pace.edu Abstract. This article first reviews the
More informationThe picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled
1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how
More informationThe Discrete Fourier Transform
The Discrete Fourier Trasform Complex Fourier Series Represetatio Recall that a Fourier series has the form a 0 + a k cos(kt) + k=1 b k si(kt) This represetatio seems a bit awkward, sice it ivolves two
More informationSOME SEQUENCE SPACES DEFINED BY ORLICZ FUNCTIONS
ARCHIVU ATHEATICU BRNO Tomus 40 2004, 33 40 SOE SEQUENCE SPACES DEFINED BY ORLICZ FUNCTIONS E. SAVAŞ AND R. SAVAŞ Abstract. I this paper we itroduce a ew cocept of λ-strog covergece with respect to a Orlicz
More information4.3 Growth Rates of Solutions to Recurrences
4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.
More informationBeurling Integers: Part 2
Beurlig Itegers: Part 2 Isomorphisms Devi Platt July 11, 2015 1 Prime Factorizatio Sequeces I the last article we itroduced the Beurlig geeralized itegers, which ca be represeted as a sequece of real umbers
More informationDeterminants of order 2 and 3 were defined in Chapter 2 by the formulae (5.1)
5. Determiats 5.. Itroductio 5.2. Motivatio for the Choice of Axioms for a Determiat Fuctios 5.3. A Set of Axioms for a Determiat Fuctio 5.4. The Determiat of a Diagoal Matrix 5.5. The Determiat of a Upper
More information6.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 informationSome examples of vector spaces
Roberto s Notes o Liear Algebra Chapter 11: Vector spaces Sectio 2 Some examples of vector spaces What you eed to kow already: The te axioms eeded to idetify a vector space. What you ca lear here: Some
More informationRun-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE
Geeral e Image Coder Structure Motio Video (s 1,s 2,t) or (s 1,s 2 ) Natural Image Samplig A form of data compressio; usually lossless, but ca be lossy Redudacy Removal Lossless compressio: predictive
More informationThe multiplicative structure of finite field and a construction of LRC
IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the
More informationMachine Learning Theory Tübingen University, WS 2016/2017 Lecture 11
Machie Learig Theory Tübige Uiversity, WS 06/07 Lecture Tolstikhi Ilya Abstract We will itroduce the otio of reproducig kerels ad associated Reproducig Kerel Hilbert Spaces (RKHS). We will cosider couple
More informationMa 530 Infinite Series I
Ma 50 Ifiite Series I Please ote that i additio to the material below this lecture icorporated material from the Visual Calculus web site. The material o sequeces is at Visual Sequeces. (To use this li
More information6 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 informationCOMM 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 informationA Proof of Birkhoff s Ergodic Theorem
A Proof of Birkhoff s Ergodic Theorem Joseph Hora September 2, 205 Itroductio I Fall 203, I was learig the basics of ergodic theory, ad I came across this theorem. Oe of my supervisors, Athoy Quas, showed
More information, then cv V. Differential Equations Elements of Lineaer Algebra Name: Consider the differential equation. and y2 cos( kx)
Cosider the differetial equatio y '' k y 0 has particular solutios y1 si( kx) ad y cos( kx) I geeral, ay liear combiatio of y1 ad y, cy 1 1 cy where c1, c is also a solutio to the equatio above The reaso
More informationSolution of Linear Constant-Coefficient Difference Equations
ECE 38-9 Solutio of Liear Costat-Coefficiet Differece Equatios Z. Aliyazicioglu Electrical ad Computer Egieerig Departmet Cal Poly Pomoa Solutio of Liear Costat-Coefficiet Differece Equatios Example: Determie
More informationThe Random Walk For Dummies
The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli
More informationFrequency 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 informationChapter 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 informationChapter Vectors
Chapter 4. Vectors fter readig this chapter you should be able to:. defie a vector. add ad subtract vectors. fid liear combiatios of vectors ad their relatioship to a set of equatios 4. explai what it
More informationAssignment 5: Solutions
McGill Uiversity Departmet of Mathematics ad Statistics MATH 54 Aalysis, Fall 05 Assigmet 5: Solutios. Let y be a ubouded sequece of positive umbers satisfyig y + > y for all N. Let x be aother sequece
More informationDefinition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.
4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationMAS160: 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