FIR Filter Design: Part I

Size: px
Start display at page:

Download "FIR Filter Design: Part I"

Transcription

1 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 ituitive examples o low-pass ad high-pass FIR ilters; we had previously cosidered these examples i our course itroductio (see /6 lecture otes. Secod, we cosider the desig o FIR ilters with more desirable requecy respose characteristics. We cosider two approaches. I the irst approach, we derive low-pass FIR ilters rom the impulse respose o ad ideal low-pass ilter; that is, a ilter with sharp cut-o requecies betwee the passbad (requecy rage or which requecies are allowed through the system, ad the rejectiobad (requecy rage or which requecies are zeroed. As we will see, this approach leads to FIR ilters with overshoot characteristics ear the cuto requecy. To mitigate this problem, we the cosider a secod approach, where we allow a iite-legth trasitio betwee the passbad ad rejectio-bad, ad observe that the resultig FIR ilters more closely approximate a idealized requecy respose.. Simple low-pass FIR ilters A. Itroductio Previously (/6 lecture otes, we had cosidered low-pass FIR ilters o the ollowig orm: y [ ] L --x[ k] L k or which the output y [ ] is a average o the curret iput x [ ] ad the ( L previous iputs x [ k], k {,,, L }. This type o FIR ilter is kow as a ruig-average ilter, ad teds to atteuate high requecies i a iput sigal, while leavig lower requecies relatively utouched (hece, the label lowpass ilter. For these ilters, the requecy respose uctio He ( j is give by, ( He ( j L --e. ( L j B. Examples Here we cosider the requecy respose o ilters o type (, or L, L 3 ad L. Figure below plots the magitude ad phase part o the requecy respose or each o these ilters as a uctio o the requecy variable [ π, π]. Note that the larger the value o L, the more arrow the cetral peak about ; that is, loger ruig averages will ted to suppress requecy compoets i the iput sigal o lower ad lower requecy. The zero-requecy compoet (, however, remais uaected o matter how large the value o L, sice averagig a costat iput sequece will ot chage that costat value. To veriy the requecy respose characteristics o these ilters, we ow coduct the ollowig experimet. We sample a cotiuous-time, oisy 4Hz cosie wave at s Hz ad the pass the resultig discretetime sequece x [ ] through the three ilters above. That is, xt ( cos( 8πt (3 x [ ] x ( s + oise, < <, (4 where, or each sample, the oise compoet o the sigal cosists o a uiormly distributed radom umber i the iterval [, ]. I Figures, 3 ad 4, or each o the three ilters, we plot a -legth (secod part o the iput sequece x [ ] ad a -legth part o the output sequece y [ ]. Moreover, we plot the magitude FFT o each -legth discrete-time sequece as a uctio o requecy. Note that or. You may wat to review the /6 lecture otes to complemet the materials i this sectio. - -

2 EEL3: Discrete-Time Sigals ad Systems FIR Filter Desig: Part I L He ( j He ( j L 3 He ( j 3 He ( j L He ( j 3 He ( j Figure this samplig process, the relatioship betwee the requecy variable i Figure ad the real requecy (i Hertz is give by, π s ( so that the requecy variable rage, [ π, π] (6 correspods to the requecy rage, [ s, s ] [ Hz, Hz]. (7 A ew observatios: irst, ote that the uiorm oise added to the 4Hz cosie waveorm at the iput shows up as o-zero requecies throughout the requecy rage [ s, s ] ; secod, ote that each ilter teds to smooth out the oisy cosie waveorm by suppressig most o the oise-iduced requecy compoets the loger the ilter, the more the oise-iduced requecies are suppressed, ad, cosequetly, the smoother the resultig output waveorm y [ ]. I the ollowig sectio, we recosider some high-pass ilters that we derived ituitively i a earlier lecture (/6. - -

3 EEL3: Discrete-Time Sigals ad Systems FIR Filter Desig: Part I x [ ] L y [ ] FFT ( x[ ] 4 3 FFT ( y[ ] x [ ] Figure L y [ ] FFT ( x[ ] 4 3 FFT ( y[ ] Figure 3 3. Simple high-pass FIR ilters A. Itroductio Previously (/6 lecture otes, we had cosidered the ollowig high-pass FIR ilters:. You may wat to review the /6 lecture otes to complemet the materials i this sectio

4 EEL3: Discrete-Time Sigals ad Systems FIR Filter Desig: Part I x [ ] L y [ ] FFT ( x[ ] 4 3 FFT ( y[ ] Figure 4 y [ ] 4x [ ] x [ ] + 4x [ ] (secod-order (8 y [ ] 8x [ ] 3 8x [ ] + 3 8x [ ] 8x [ 3] (third-order (9 y 3 [ ] 6x [ ] 4x [ ] + 3 8x [ ] 4x [ 3] + 6x [ 4] (ourth-order ( which we derived by takig cosecutive discrete-time derivatives o the irst-order high-pass ilter: y [ ] x [ ] x [ ]. ( These ilters will ted to atteuate low requecies (zeroig ay DC or zero-requecy compoet, while passig through higher requecies relatively utouched (hece, the label high-pass ilter. For these ilters, the requecy respose uctios are straightorward to compute: H ( e j e j + --e 4 j ( H ( e j e 8 j e 8 j --e 8 j3 (3 H 3 e j ( e. (4 6 4 j 3 --e 8 j --e 4 j e 6 j4 Figure below plots the magitude ad phase part o the requecy respose or each o these ilters as a uctio o the requecy variable [ π, π]. Note that as the legth o the ilter is icreased, more ad more low requecies are virtually zeroed out etirely, while the highest requecies remai utouched. B. Experimets To veriy the requecy respose characteristics o the high-pass ilters i equatios ( through (4, we ow coduct the same experimet as or the low-pass ilters i the previous sectio. We sample a cotiuoustime, oisy 4Hz cosie wave at s Hz ad the pass the resultig discrete-time sequece x [ ] through the three high-pass ilters above. That is, - 4 -

5 EEL3: Discrete-Time Sigals ad Systems FIR Filter Desig: Part I H e j H 3 e j H ( e j H ( e j ( H ( e j ( H 3 ( e j - - Figure xt ( cos( 8πt ( x [ ] x ( s + oise, < <, (6 where, or each sample, the oise compoet o the sigal cosists o a uiormly distributed radom umber i the iterval [, ]. I Figures 6, 7 ad 8, or each o the three high-pass ilters, we plot a - legth (secod part o the iput sequece x [ ] ad a -legth part o the output sequece y [ ]. Moreover, we plot the magitude FFT o each -legth discrete-time sequece as a uctio o requecy. Note that or this samplig process, the relatioship betwee the requecy variable i Figure ad the real requecy (i Hertz is agai give by, π s (7 so that the requecy variable rage, [ π, π] (8 correspods to the requecy rage, [ s, s ] [ Hz, Hz]. (9 - -

6 EEL3: Discrete-Time Sigals ad Systems FIR Filter Desig: Part I x [ ] y [ ] FFT ( x[ ] 4 3 FFT ( y [ ] Figure x [ ] y [ ] FFT ( x[ ] 4 3 FFT ( y [ ] - - Figure Note that each ilter removes the low-requecy cosie wave rom the sigal ad preserves oly high-requecy compoets (to varyig degrees. Also ote that these experimetal results closely match the magitude requecy respose uctios i Figure. The Mathematica otebook ir_ilter_desig_parta.b was used to geerate the examples i the previous two sectios. Additioal speech ad image processig examples or the low-pass ad high-pass ilters discussed so ar ca be oud i the otes correspodig to the /6 lecture. I the ext two sectios, we illustrate how oe might go about desigig low-pass FIR ilters, where you, as the desiger, have much more cotrol over the ilter s resultig requecy respose

7 EEL3: Discrete-Time Sigals ad Systems FIR Filter Desig: Part I x [ ] y 3 [ ] FFT ( x[ ] 4 3 FFT ( y 3 [ ] Figure 8 4. Desig o a low-pass FIR ilter: approach # A. Itroductio I the previous two sectios, we saw examples o two types o simple FIR ilters: ( low-pass ad ( highpass. Although these ilters were relatively simple to derive, we had little cotrol over the precise shape o the requecy respose uctio correspodig to each ilter. Here, we cosider the desig o a low-pass ilter, begiig with a ideal low-pass ilter with zero-width trasitios betwee the passbad ad rejectio-bad. B. Ideal low-pass ilter Figure 9 illustrates the requecy respose o a ideal low-pass ilter with ormalized cuto requecy at c. Note that a ilter with these characteristics will ot chage the magitude o ay requecies i the iput sigal or the rage [ c, c ], but will zero out all requecies outside that rage. Moreover, the liear-phase property o such a ilter will shit iput requecies i the rage [ c, c ] by a amout proportioal to each requecy ad, thereore, will ot itroduce ay phase distortio ito the output o the system. The slope o the lie ( a i the phase plot will determie the extet o the shit; a slope o zero will correspod to o phase shit (i.e. o delay. Below, we will use the iverse DTFT to determie the time-domai impulse respose with a (i.e. o delay. Recall that the iverse DTFT is give by, h [ ] o a ideal ilter He ( j He ( j π c c π Figure 9 slope a π c c π - 7 -

8 EEL3: Discrete-Time Sigals ad Systems FIR Filter Desig: Part I π h [ ] ( π He ( j e j d π For the ideal ilter i Figure 9 (with o delay, equatio ( reduces to, h [ ] c e π j d c ( h [ ] c ej ej c e j c ej c e j c π j π j j π j c si( c π ( si( c h ideal [ ] , < <. (3 π Note that the impulse respose or a ideal ilter with o delay is iiite i legth, both orwards ad backwards i time. For example, i Figure, we plot h [ ],, or c Figure h ideal [ ] C. Approximatig a ideal ilter with a FIR ilter Now, we will try to approximate the ideal ilter with a causal FIR ilter usig the ollowig procedure: First we will retai values or h ideal [ ] oly or a limited rage o, max max (4 sice values o h [ ] approach zero as. Let us deote this iite impulse respose as h [ ], such that, h [ ] h ideal [ ] max max elsewhere ( Secod, we will shit h [ ] to be causal; let us deote the resultig impulse respose as h [ ] such that, h [ ] h [ max ]. (6 Note that this shit will ot chage the steady-state requecy respose o the resultig system, except to itroduce a delay at the output. Thus, the dierece equatio correspodig to h [ ] ca be writte as: y [ ] b k x [ k] where, max k (7-8 -

9 EEL3: Discrete-Time Sigals ad Systems FIR Filter Desig: Part I b k h ideal [ max + k] si( ( max + k c ( max + kπ (8 I Figure, we plot the impulse respose h [ ] ad the correspodig magitude requecy respose H ( e j or various values o max (, ad ad a umeric cuto requecy o c. For each requecy respose plot, the blue lie idicates the ideal magitude requecy respose. Note that as we icrease the legth o the FIR ilter (i.e. max the trasitio regio at the cuto requecy becomes more well-deied; however, also ote the overshoot pheomeo (Gibbs pheomeo at the cuto requecy, which is similar to what we observed earlier i the course or the iite-sum Fourier series approximatio o periodic waveorms with discotiuities (such as a square wave. While icreasig the FIR ilter legth will make the trasitio regio i the requecy respose uctio icreasigly arrow, the overshoot at the cuto requecy will remai. Thereore, this approach or desigig low-pass FIR ilters will yield ilters that approximate the ideal ilter characteristic arbitrarily well, except ear ± c, where the overshoot problem will remai. This problem motivates our secod approach to ilter desig i the ollowig sectio, where we explicitly allow some arrow, ozero trasitio regio betwee the passbad ad rejectio bad o the ilter max max max h [ ] h [ ] h [ ] H ( e j H ( e j H ( e j Figure - 9 -

10 EEL3: Discrete-Time Sigals ad Systems FIR Filter Desig: Part I. Desig o a low-pass FIR ilter: approach # A. Itroductio I this sectio, we will ollow exactly the same approach to desigig a low-pass FIR ilter as i the previous sectio, except that we will start o with a slightly dieret magitude requecy respose, as illustrated i Figure below. Note that ulike beore, we ow allow a iite-width trasitio regio o width rom oe to zero i the magitude requecy respose. He ( j π ( c c + c c + π Figure Below, we will use the iverse DTFT to determie the time-domai impulse respose assumig o delay. For this ilter, the iverse DTFT is give by, h [ ] o this ilter, h [ ] Note that, π π c -- ( + c + e j d e ( c + π j d c ( c + -- ( c + e j d c c (9 He ( j -- ( +, (3 c + [ ( c +, c ] He j ( -- (, (3 c + [ c, ( c + ] are the equatios o the two lies i the trasitio regios. We solve the itegratio i equatio (9 usig Mathematica (see ir_ilter_desig_partb.b ad arrive at the ollowig solutio or h [ ]: cos( c cos( ( c + h [ ] ,. (3 < < π Usig L Hopital s rule, we ca show that this result is, i act, idetical to the oe previously derived or the ideal ilter [equatio (3], as : lim h [ ] lim cos( c cos( ( c π (33 lim h [ ] lim d { cos( d c cos( ( c + } d { d π } (34 si( ( c + si( lim h [ ] c lim π π. ( - -

11 EEL3: Discrete-Time Sigals ad Systems FIR Filter Desig: Part I As or the case o the ideal ilter, the impulse respose h [ ] i equatio (3 is iiite i legth, both orwards ad backwards i time. For example, i Figure 3, we plot h [ ],, or c ad.however, whe comparig Figures ad 3, we otice that the impulse respose or o-zero trasitio regios (i.e., Figure 3, decays to zero values much quicker tha or (Figure as. This is due to the act that the h [ ] values vary as or the ideal ilter i the previous sectio, while they vary as or the ilter with ozero-width trasitio regios i this sectio. Thereore, the eects o approximatig the iiite impulse respose i Figure 3 by retaiig oly values o h [ ] or max max should be less severe..3 h [ ] Figure 3 B. Approximatio with a FIR ilter Here we will approximate the iiite impulse respose i Figure 3, correspodig to the requecy respose i Figure (with o delay, with a causal FIR ilter, ollowig the same procedure as or the ideal ilter i the previous sectio. First we will retai values or h [ ] [see equatio (3] oly or a limited rage o, max max (36 sice values o h [ ] approach zero as. Let us deote this iite impulse respose as h [ ], such that, h [ ] h [ ] max max elsewhere (37 Secod, we will shit h [ ] to be causal; let us deote the resultig impulse respose as h [ ] such that, h [ ] h [ max ]. (38 Note that this shit will ot chage the steady-state requecy respose o the resultig system, except to itroduce a delay at the output. Thus, the dierece equatio correspodig to h [ ] ca be writte as: y [ ] b k x [ k] where, max k (39 b k h[ max + k] cos( ( max + k c cos( ( max + k ( c ( max + k π (4 I Figure 4, we plot the impulse respose h [ ] ad the correspodig magitude requecy respose H ( e j or various values o max (, ad ad umeric values, c ad. For each - -

12 EEL3: Discrete-Time Sigals ad Systems FIR Filter Desig: Part I.3 max h [ ] H ( e j max h [ ]. H ( e j max h [ ]. H ( e j Figure 4 requecy respose plot, the blue lie idicates the iiite impulse magitude requecy respose.note that ulike the previous examples i Figure, we o loger have the same overshoot problem. I act, or max, we see that the FIR ilter is a very good approximatio o the IIR ilter. Agai, this is due to the act that we o loger require the trasitio rom oe to zero i the requecy respose to occur istataeously, but rather that we allow or that trasitio regio to be o some small, o-zero width (i.e.. C. Filterig examples I this sectio, we illustrate the output y [ ] or a FIR ilter o type (4 o some sample iput sigals x [ ]. For these examples, we assume a samplig rate o s Hz, a desired cuto requecy c Hz, ad a trasitio width o Hz. We also, limit our FIR ilter to a legth ( max +, where max. Usig the coversio rule betwee ad, π s (4 we ca compute our ormalized cuto requecy c ad trasitio-regio width : c π( c s π( π (4 π( s π( π. (43 - -

13 EEL3: Discrete-Time Sigals ad Systems FIR Filter Desig: Part I Usig equatios (3, (37 ad (38, we ca ow compute the impulse respose h [ ] or the values o c ad i (4 ad (43 above. I Figure below, we plot that impulse respose ad the correspodig magitude requecy respose as a uctio o requecy. Note how well the FIR requecy respose approximates our desired cuto requecy ad trasitio width..4 h [ ] H ( e j π s Figure We ow apply the ollowig our test iputs to this system: x [ ] π cos s cos(.π (i.e. sampled Hz cosie wave (44 x [ ] x 3 [ ] x 4 [ ] π π 7 cos s cos s cos(.π + 3cos(.3π π π cos s cos s cos(.π + 3cos(.6π π π cos s cos s cos(.π + 3cos(.4π (4 (46 (47 For each test iput, we compute the output as the covolutio betwee x i [ ] ad h [ ] : y i [ ] x i [ ] * h [ ], i { 34,,, }, (48 ad compute the magitude FFT o -legth segmets o the steady-state iput ad correspodig output (see Mathematica otebook ir_ilter_desig_partb.b or time-domai plots with trasiet resposes as well.these FFTs are plotted i Figures 6 through 9 below. Note that or the irst three test sigals, the ilter leaves the magitude o the iput requecies less tha Hz uchaged, while zeroig out requecies above Hz. For the ourth sigal, we see that the Hz requecy compoet is approximately halved, sice it lies exactly halway iside the trasitio regio rom Hz to Hz. Thus, this low-pass FIR ilter appears to perorm exactly as desiged

14 EEL3: Discrete-Time Sigals ad Systems FIR Filter Desig: Part I FFT ( x [ ] - - FFT ( y [ ] - - Figure FFT ( x [ ] FFT ( y [ ] - - Figure 7-4 -

15 EEL3: Discrete-Time Sigals ad Systems FIR Filter Desig: Part I FFT ( x 3 [ ] FFT ( y 3 [ ] - - Figure FFT ( x 4 [ ] FFT ( y 4 [ ] - - Figure 9 - -

16 EEL3: Discrete-Time Sigals ad Systems FIR Filter Desig: Part I 6. Coclusio The Mathematica otebooks ir_ilter_desig_parta.b ad ir_ilter_desig_partb.b were used to geerate all the examples i this set o otes. I a compaio set o otes, we coclude our discussio o FIR-ilter desig

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

STAT 516 Answers Homework 6 April 2, 2008 Solutions by Mark Daniel Ward PROBLEMS

STAT 516 Answers Homework 6 April 2, 2008 Solutions by Mark Daniel Ward PROBLEMS STAT 56 Aswers Homework 6 April 2, 28 Solutios by Mark Daiel Ward PROBLEMS Chapter 6 Problems 2a. The mass p(, correspods to either o the irst two balls beig white, so p(, 8 7 4/39. The mass p(, correspods

More information

Ch3 Discrete Time Fourier Transform

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

More information

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

5. Fast NLMS-OCF Algorithm

5. Fast NLMS-OCF Algorithm 5. Fast LMS-OCF Algorithm The LMS-OCF algorithm preseted i Chapter, which relies o Gram-Schmidt orthogoalizatio, has a compleity O ( M ). The square-law depedece o computatioal requiremets o the umber

More information

Topic 9 - Taylor and MacLaurin Series

Topic 9 - Taylor and MacLaurin Series Topic 9 - Taylor ad MacLauri Series A. Taylors Theorem. The use o power series is very commo i uctioal aalysis i act may useul ad commoly used uctios ca be writte as a power series ad this remarkable result

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

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

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

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

More information

1 Introduction to reducing variance in Monte Carlo simulations

1 Introduction to reducing variance in Monte Carlo simulations Copyright c 010 by Karl Sigma 1 Itroductio to reducig variace i Mote Carlo simulatios 11 Review of cofidece itervals for estimatig a mea I statistics, we estimate a ukow mea µ = E(X) of a distributio by

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

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.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

ADVANCED TOPICS ON VIDEO PROCESSING

ADVANCED TOPICS ON VIDEO PROCESSING ADVANCED TOPICS ON VIDEO PROCESSING Image Spatial Processig FILTERING EXAMPLES FOURIER INTERPRETATION FILTERING EXAMPLES FOURIER INTERPRETATION FILTERING EXAMPLES FILTERING EXAMPLES FOURIER INTERPRETATION

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

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

Chapter 13, Part A Analysis of Variance and Experimental Design

Chapter 13, Part A Analysis of Variance and Experimental Design Slides Prepared by JOHN S. LOUCKS St. Edward s Uiversity Slide 1 Chapter 13, Part A Aalysis of Variace ad Eperimetal Desig Itroductio to Aalysis of Variace Aalysis of Variace: Testig for the Equality of

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

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

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

Signals, Instruments, and Systems W4 An Introduction to Signal Processing

Signals, Instruments, and Systems W4 An Introduction to Signal Processing Sigals, Istrumets, ad Systems W4 A Itroductio to Sigal Processig Logitude Height y [Pixel] [m] [m] Sigal Amplitude Temperature [ C] Sigal Deiitio A sigal is ay time-varyig or spatial-varyig quatity 0 8

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

Phys. 201 Mathematical Physics 1 Dr. Nidal M. Ershaidat Doc. 12

Phys. 201 Mathematical Physics 1 Dr. Nidal M. Ershaidat Doc. 12 Physics Departmet, Yarmouk Uiversity, Irbid Jorda Phys. Mathematical Physics Dr. Nidal M. Ershaidat Doc. Fourier Series Deiitio A Fourier series is a expasio o a periodic uctio (x) i terms o a iiite sum

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

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

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

Run-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE

Run-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 information

Frequentist Inference

Frequentist Inference Frequetist Iferece The topics of the ext three sectios are useful applicatios of the Cetral Limit Theorem. Without kowig aythig about the uderlyig distributio of a sequece of radom variables {X i }, for

More information

Continuous Functions

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

More information

Principle Of Superposition

Principle 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 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

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

Lecture 2: Monte Carlo Simulation

Lecture 2: Monte Carlo Simulation STAT/Q SCI 43: Itroductio to Resamplig ethods Sprig 27 Istructor: Ye-Chi Che Lecture 2: ote Carlo Simulatio 2 ote Carlo Itegratio Assume we wat to evaluate the followig itegratio: e x3 dx What ca we do?

More information

Fundamental Concepts: Surfaces and Curves

Fundamental Concepts: Surfaces and Curves UNDAMENTAL CONCEPTS: SURACES AND CURVES CHAPTER udametal Cocepts: Surfaces ad Curves. INTRODUCTION This chapter describes two geometrical objects, vi., surfaces ad curves because the pla a ver importat

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

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

Orthogonal Gaussian Filters for Signal Processing

Orthogonal Gaussian Filters for Signal Processing Orthogoal Gaussia Filters for Sigal Processig Mark Mackezie ad Kiet Tieu Mechaical Egieerig Uiversity of Wollogog.S.W. Australia Abstract A Gaussia filter usig the Hermite orthoormal series of fuctios

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

Abstract Vector Spaces. Abstract Vector Spaces

Abstract Vector Spaces. Abstract Vector Spaces Astract Vector Spaces The process of astractio is critical i egieerig! Physical Device Data Storage Vector Space MRI machie Optical receiver 0 0 1 0 1 0 0 1 Icreasig astractio 6.1 Astract Vector Spaces

More information

Where do eigenvalues/eigenvectors/eigenfunctions come from, and why are they important anyway?

Where do eigenvalues/eigenvectors/eigenfunctions come from, and why are they important anyway? Where do eigevalues/eigevectors/eigeuctios come rom, ad why are they importat ayway? I. Bacgroud (rom Ordiary Dieretial Equatios} Cosider the simplest example o a harmoic oscillator (thi o a vibratig strig)

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

Vector Quantization: a Limiting Case of EM

Vector Quantization: a Limiting Case of EM . Itroductio & defiitios Assume that you are give a data set X = { x j }, j { 2,,, }, of d -dimesioal vectors. The vector quatizatio (VQ) problem requires that we fid a set of prototype vectors Z = { z

More information

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING

GEORGIA 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 information

Problem Set 4 Due Oct, 12

Problem Set 4 Due Oct, 12 EE226: Radom Processes i Systems Lecturer: Jea C. Walrad Problem Set 4 Due Oct, 12 Fall 06 GSI: Assae Gueye This problem set essetially reviews detectio theory ad hypothesis testig ad some basic otios

More information

4.3 Growth Rates of Solutions to Recurrences

4.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 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

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

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

Chapter 2 The Monte Carlo Method

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

More information

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

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

1 Inferential Methods for Correlation and Regression Analysis

1 Inferential Methods for Correlation and Regression Analysis 1 Iferetial Methods for Correlatio ad Regressio Aalysis I the chapter o Correlatio ad Regressio Aalysis tools for describig bivariate cotiuous data were itroduced. The sample Pearso Correlatio Coefficiet

More information

Spectral Analysis. This week in lab. Next classes: 3/26 and 3/28. Your next experiment Homework is to prepare

Spectral Analysis. This week in lab. Next classes: 3/26 and 3/28. Your next experiment Homework is to prepare Spectral Aalysis This week i lab Your ext experimet Homework is to prepare Next classes: 3/26 ad 3/28 Aero Testig, Fracture Toughess Testig Read the Experimets 5 ad 7 sectios of the course maual Spectral

More information

Math 176 Calculus Sec. 5.1: Areas and Distances (Using Finite Sums)

Math 176 Calculus Sec. 5.1: Areas and Distances (Using Finite Sums) Math 176 Calculus Sec. 5.1: Areas ad Distaces (Usig Fiite Sums) I. Area A. Cosider the problem of fidig the area uder the curve o the f y=-x 2 +5 over the domai [0, 2]. We ca approximate this area by usig

More information

FIR Filter Design by Windowing

FIR Filter Design by Windowing FIR Filter Desig by Widowig Take the low-pass filter as a eample of filter desig. FIR filters are almost etirely restricted to discretetime implemetatios. Passbad ad stopbad Magitude respose of a ideal

More information

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

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

More information

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

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

More information

CS537. Numerical Analysis and Computing

CS537. Numerical Analysis and Computing CS57 Numerical Aalysis ad Computig Lecture Locatig Roots o Equatios Proessor Ju Zhag Departmet o Computer Sciece Uiversity o Ketucky Leigto KY 456-6 Jauary 9 9 What is the Root May physical system ca be

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

Monte Carlo Integration

Monte Carlo Integration Mote Carlo Itegratio I these otes we first review basic umerical itegratio methods (usig Riema approximatio ad the trapezoidal rule) ad their limitatios for evaluatig multidimesioal itegrals. Next we itroduce

More information

CS321. Numerical Analysis and Computing

CS321. Numerical Analysis and Computing CS Numerical Aalysis ad Computig Lecture Locatig Roots o Equatios Proessor Ju Zhag Departmet o Computer Sciece Uiversity o Ketucky Leigto KY 456-6 September 8 5 What is the Root May physical system ca

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

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

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

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

More information

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

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

For example suppose we divide the interval [0,2] into 5 equal subintervals of length

For example suppose we divide the interval [0,2] into 5 equal subintervals of length Math 1206 Calculus Sec 1: Estimatig with Fiite Sums Abbreviatios: wrt with respect to! for all! there exists! therefore Def defiitio Th m Theorem sol solutio! perpedicular iff or! if ad oly if pt poit

More information

Representing Functions as Power Series. 3 n ...

Representing Functions as Power Series. 3 n ... Math Fall 7 Lab Represetig Fuctios as Power Series I. Itrouctio I sectio.8 we leare the series c c c c c... () is calle a power series. It is a uctio o whose omai is the set o all or which it coverges.

More information

2.004 Dynamics and Control II Spring 2008

2.004 Dynamics and Control II Spring 2008 MIT OpeCourseWare http://ocw.mit.edu 2.004 Dyamics ad Cotrol II Sprig 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. Massachusetts Istitute of Techology

More information

Probability, Expectation Value and Uncertainty

Probability, Expectation Value and Uncertainty Chapter 1 Probability, Expectatio Value ad Ucertaity We have see that the physically observable properties of a quatum system are represeted by Hermitea operators (also referred to as observables ) such

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

CHAPTER 5: FOURIER SERIES PROPERTIES OF EVEN & ODD FUNCTION PLOT PERIODIC GRAPH

CHAPTER 5: FOURIER SERIES PROPERTIES OF EVEN & ODD FUNCTION PLOT PERIODIC GRAPH CHAPTER : FOURIER SERIES PROPERTIES OF EVEN & ODD FUNCTION POT PERIODIC GRAPH PROPERTIES OF EVEN AND ODD FUNCTION Fuctio is said to be a eve uctio i: Fuctio is said to be a odd uctio i: Fuctio is said

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

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

1 Approximating Integrals using Taylor Polynomials

1 Approximating Integrals using Taylor Polynomials Seughee Ye Ma 8: Week 7 Nov Week 7 Summary This week, we will lear how we ca approximate itegrals usig Taylor series ad umerical methods. Topics Page Approximatig Itegrals usig Taylor Polyomials. Defiitios................................................

More information

Introduction to Digital Signal Processing

Introduction to Digital Signal Processing Fakultät Iformatik Istitut für Systemarchitektur Professur Recheretze Itroductio to Digital Sigal Processig Walteegus Dargie Walteegus Dargie TU Dresde Chair of Computer Networks I 45 Miutes Refereces

More information

Signal Processing in Mechatronics

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

More information

McGill University Math 354: Honors Analysis 3 Fall 2012 Solutions to selected problems. x y

McGill University Math 354: Honors Analysis 3 Fall 2012 Solutions to selected problems. x y McGill Uiversity Math 354: Hoors Aalysis 3 Fall 212 Assigmet 3 Solutios to selected problems Problem 1. Lipschitz uctios. Let M K be the set o all uctios cotiuous uctios o [, 1] satisyig a Lipschitz coditio

More information

An Improved Algorithm and It s Application to Sinusoid Wave Frequency Estimation

An Improved Algorithm and It s Application to Sinusoid Wave Frequency Estimation Iteratioal Coerece o Iormatio ad Itelliget Computig IPCSI vol.8 () () IACSI Press, Sigapore A Improved Algorithm ad It s Applicatio to Siusoid Wave Frequecy Estimatio iaohog Huag ad Li Zhag College o Iormatio

More information

Data Analysis and Statistical Methods Statistics 651

Data Analysis and Statistical Methods Statistics 651 Data Aalysis ad Statistical Methods Statistics 651 http://www.stat.tamu.edu/~suhasii/teachig.html Suhasii Subba Rao Review of testig: Example The admistrator of a ursig home wats to do a time ad motio

More information

Section 13.3 Area and the Definite Integral

Section 13.3 Area and the Definite Integral Sectio 3.3 Area ad the Defiite Itegral We ca easily fid areas of certai geometric figures usig well-kow formulas: However, it is t easy to fid the area of a regio with curved sides: METHOD: To evaluate

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

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

DIGITAL SIGNAL PROCESSING LECTURE 3

DIGITAL 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 information

Course Outline. Designing Control Systems. Proportional Controller. Amme 3500 : System Dynamics and Control. Root Locus. Dr. Stefan B.

Course Outline. Designing Control Systems. Proportional Controller. Amme 3500 : System Dynamics and Control. Root Locus. Dr. Stefan B. Amme 3500 : System Dyamics ad Cotrol Root Locus Course Outlie Week Date Cotet Assigmet Notes Mar Itroductio 8 Mar Frequecy Domai Modellig 3 5 Mar Trasiet Performace ad the s-plae 4 Mar Block Diagrams Assig

More information

( ) (( ) ) ANSWERS TO EXERCISES IN APPENDIX B. Section B.1 VECTORS AND SETS. Exercise B.1-1: Convex sets. are convex, , hence. and. (a) Let.

( ) (( ) ) ANSWERS TO EXERCISES IN APPENDIX B. Section B.1 VECTORS AND SETS. Exercise B.1-1: Convex sets. are convex, , hence. and. (a) Let. Joh Riley 8 Jue 03 ANSWERS TO EXERCISES IN APPENDIX B Sectio B VECTORS AND SETS Exercise B-: Covex sets (a) Let 0 x, x X, X, hece 0 x, x X ad 0 x, x X Sice X ad X are covex, x X ad x X The x X X, which

More information