6.003: Signal Processing
|
|
- Buck Skinner
- 5 years ago
- Views:
Transcription
1 6.003: Sigal Processig Discrete-Time Fourier Series orthogoality of harmoically related DT siusoids DT Fourier series relatios differeces betwee CT ad DT Fourier series properties of DT Fourier series September 20, 2018
2 Last Time: Cotiuous-Time Fourier Series Express a periodic sigal as a sum of harmoically related siusoids ( x(t) = ck cos kω o t + d k si kω o t ) k=0 where ω o represets the fudametal frequecy. Basis fuctios: cos 0t t 2π ωo si 0t t 2π ωo cos ωot t 2π ωo si ωot t 2π ωo cos 2ωot. t 2π ωo si 2ωot. t 2π ωo
3 Cotiuous-Time Fourier Series Separatig harmoic compoets relies o two key observatios. 1. Multiplyig two harmoics produces a ew harmoic with the same fudametal frequecy: e jkωot e jlωot = e j(k+l)ωot. 2. The itegral of a harmoic over ay time iterval with legth equal to the period T is zero uless the harmoic is at DC: t0 +T { T if k = 0 e jkωot dt e jkωot dt = t 0 T 0 if k 0 = T δ[k]. Fourier compoets are orthogoal.
4 Cotiuous-Time Fourier Series Assume that x(t) is periodic i T ad is composed of a weighted sum of harmoics of ω o = 2π/T. x(t) = x(t + T ) = a k e jωokt k= The sift out oe compoet: x(t)e jωolt dt = a k e jωokt e jωolt dt T T k= = a k e jωo(k l)t dt k= T = a k T δ[k l] = a l T k= Solvig for a l provides a explicit formula for the coefficiets: a k = 1 x(t)e jωokt dt = 1 T T T T j 2π x(t)e T kt dt where ω o = 2π T.
5 Cotiuous-Time Fourier Series Represetig a periodic sigal as a sum of harmoic siusoids. a k = 1 x(t)e jkωot dt T T x(t)= x(t + T ) = a k e jkωot k= aalysis equatio sythesis equatio where ω o = 2π T
6 Today: Discrete Time Fourier Series Same high-level idea. Express a periodic sigal as a sum of harmoically related siusoids ( x[] = ck cos kω o + d k si kω o ) k=0 where Ω o represets the fudametal frequecy (radias/sample). Basis fuctios: cos 0Ωo 2π Ω o si 0Ωo 2π Ω o cos Ωo cos 2Ωo. 2π Ωo 2π Ωo si Ωo si 2Ωo. 2π Ωo 2π Ωo
7 Discrete-Time Fourier Series Separatig harmoic compoets relies o the same two key poits. 1. Multiplyig two DT harmoics produces a ew DT harmoic with the same fudametal frequecy: e jkωo e jlωo = e j(k+l)ωo. 2. The sum of a harmoic over ay time iterval with legth equal to the period N is zero uless the harmoic is at DC: 0 +N e jkωo { N if k = 0 e jkωo = = 0 0 if k 0 = Nδ[k]. DT Fourier compoets are orthogoal.
8 Discrete-Time Fourier Series Assume that x[] is periodic i N ad is composed of a weighted sum of harmoics of Ω o = 2π/N. x[] = x[ + N] = a k e jωok k The sift out oe compoet: x[]e jωol = a k e jωok e jωol k = a k e jωo(k l) k = a k Nδ[k l] = a l N k Solvig for a l provides a explicit formula for the coefficiets: a k = 1 N x[]e jωok = 1 N x[]e j 2π N k where Ω o = 2π N.
9 Discrete-Time Fourier Series Represetig a DT periodic sigal as a sum of harmoic siusoids. a k = 1 N x[]e jkωo aalysis equatio x[]= x[ + N] = k a k e jkωo sythesis equatio where Ω o = 2π N
10 Discrete-Time Fourier Series Represetig a DT periodic sigal as a sum of harmoic siusoids. a k = 1 N x[]e jkωo aalysis equatio x[]= x[ + N] = k a k e jkωo sythesis equatio where Ω o = 2π N DT Fourier series are similar to CT Fourier series... but DT siusoids differ from CT siusoids i importat ways! How do CT/DT differeces affect Fourier series?
11 Check Yourself What is the fudametal (shortest) period of each of the followig sigals? 1. x 1 [] = cos π x 2 [] = cos π π + 3 cos x 3 [] = cos + cos 2 + cos 3
12 Check Yourself x 1 [] = cos π ( π ) 12 = cos π π( + 24) = cos = x 1 [ + 24] 12 x 2 [] = cos π 12 = cos π ( π ) ( π ) + 3 cos 15 = cos π + 3 cos π π( + 120) cos π( + 120) 15 x 3 [] = cos + cos 2 + cos 3 is ot periodic. = x 2 [ + 120] cos cos 2 cos 3
13 Check Yourself What is the fudametal (shortest) period of each of the followig sigals? 1. x 1 [] = cos π x 2 [] = cos π cos π x 3 [] = cos + cos 2 + cos 3
14 Check Yourself What is the fudametal (shortest) period of each of the followig sigals? 1. x 1 [] = cos π x 2 [] = cos π cos π x 3 [] = cos + cos 2 + cos 3 The period of a periodic DT sigal must be a iteger. Therefore the fudametal frequecy of a periodic DT sigal must be a iteger submultiple of 2π. No such costraits o fudametal frequecies i CT.
15 Discrete-Time Siusoids The frequecies of discrete-time siusoids alias. Ω = 0.25 x[] = cos(0.25)
16 Discrete-Time Siusoids The frequecies of discrete-time siusoids alias. Ω = 0.5 x[] = cos(0.5)
17 Discrete-Time Siusoids The frequecies of discrete-time siusoids alias. Ω = 1 x[] = cos()
18 Discrete-Time Siusoids The frequecies of discrete-time siusoids alias. Ω = 2 x[] = cos(2)
19 Discrete-Time Siusoids The frequecies of discrete-time siusoids alias. Ω = 3 x[] = cos(3)
20 Discrete-Time Siusoids The frequecies of discrete-time siusoids alias. Ω = 4 x[] = cos(4) = cos(2π 4) cos(2.283)
21 Discrete-Time Siusoids The frequecies of discrete-time siusoids alias. Ω = 5 x[] = cos(5) = cos(2π 5) cos(1.283)
22 Discrete-Time Siusoids The frequecies of discrete-time siusoids alias. Ω = 6 x[] = cos(6) = cos(2π 6) cos(0.283) There are multiple frequecies associated with every DT siusoid. The frequecies of discrete-time siusoids alias.
23 Discrete-Time Siusoids If Ω o is a submultiple of 2π, ad the harmoic frequecies alias, the there are (oly) N distict complex expoetials with period N. (There were a ifiite umber i CT!) If y[] = e jω is periodic i N the y[] = e jω = y[ + N] = e jω(+n) = e jω e jωn ad e jωn must be 1 e jω must be oe of the N th roots of 1. Example: N = 8 Im Re
24 Discrete-Time Siusoids There are N distict complex expoetials with period N. If a DT sigal is periodic with period N, the its Fourier series cotais just N terms. Example: periodic i N=3 3 samples repeated i time 3 complex expoetials Example: periodic i N=4 4 samples repeated i time 4 complex expoetials
25 Discrete-Time Fourier Series DT Fourier series comprise a weighted sum of just N harmoics. x[] = x[ + N] = k=<n> a k e jωok
26 Discrete-Time Fourier Series DT Fourier series comprise a weighted sum of just N harmoics. x[] = x[ + N] = k=<n> a k e jωok The sift out oe compoet: x[]e jωol = a k e jωok e jωol k=<n> = a k e jωo(k l) k=<n> = a k Nδ[k l] = a l N k=<n> Solvig for a l provides a explicit formula for the coefficiets: a k = 1 N x[]e jωok = 1 N x[]e j 2π N k where Ω o = 2π N. Both x[] ad e j 2π N k are periodic i N, a k is periodic i N.
27 Discrete-Time Fourier Series A periodic DT sigal with N samples produces a periodic sequece of N Fourier series coefficiets. a k = a k+n = 1 x[]e jkωo N x[]= x[ + N] = a k e jkωo k=<n> aalysis equatio sythesis equatio where Ω o = 2π N
28 Fourier Series Summary CT ad DT Fourier Series are similar, but DT Fourier Series have just N coefficiets while CT Fourier Series have a ifiite umber. Cotiuous-Time Fourier Series a k = 1 x(t)e jkωot dt T T x(t)= x(t + T ) = a k e jkωot k= Discrete-Time Fourier Series a k = a k+n = 1 x[]e jkωo N = N x[]= x[ + N] = a k e jkωo k= N aalysis equatio sythesis equatio where ω o = 2π T aalysis equatio sythesis equatio where Ω o = 2π N
29 Properties of Discrete-Time Fourier Series Operatios o the time represetatio of a sigal ca ofte be iterpreted as equivalet operatios o the series coefficiets. Example: Fourier series of a liear combiatio of sigals Proof: Let x[] = ax 1 []+bx 2 [] where x 1 [] = x 1 [+N] ad x 2 [] = x 2 [+N] the the Fourier series coefficets for x[] are give by X[k] = 1 x[]e jk 2π N = 1 ( ax1 [] + bx 2 [] ) e jk 2π N N N = a 1 x 1 []e jk 2π N + b 1 x 2 []e jk 2π N N N = ax 1 [k] + bx 2 [k] where X 1 [k] ad X 2 [k] are Fourier series coefficiets for x 1 ad x 2.
30 Properties of Discrete-Time Fourier Series Operatios o the time represetatio of a sigal ca ofte be iterpreted as equivalet operatios o the series coefficiets. Example: Shiftig time chages the phases of Fourier compoets. Proof: Let y[] = x[ 0 ] where x[] = x[ + N] If X[k] = 1 x[]e jk 2π N N the Y [k] = 1 y[]e jk 2π N = 1 x[ 0 ]e jk 2π N N N = 1 x[m]e jk 2π N (m+ 0) where m = 0 N m=<n> = e jk 2π N 0 1 x[m]e jk 2π N m = e jk 2π N 0 X[k] N m=<n>
31 Properties of Discrete-Time Fourier Series Operatios o the time represetatio of a sigal ca ofte be iterpreted as equivalet operatios o the series coefficiets. Example: Flippig time flips frequecy. Proof: Let y[] = x[ ] where x[] = x[ + N] If X[k] = 1 x[]e jk 2π N N the Y [k] = 1 y[]e jk 2π N = 1 x[ ]e jk 2π N N N = 1 x[m]e jk 2π N m where m = N m=<n> = X[ k]
32 Properties of Discrete-Time Fourier Series Operatios o the time represetatio of a sigal ca ofte be iterpreted as equivalet operatios o the series coefficiets. Example: If x[] is a real-valued sequece, the X[ k] = X[k]. X[k] = 1 N X[ k] = 1 N x[]e jk 2π N x[]e jk 2π N = X[k]
33 Properties of Discrete-Time Fourier Series Operatios o the time represetatio of a sigal ca ofte be iterpreted as equivalet operatios o the series coefficiets. Example: Eve ad Odd Decompositio Fid the Fourier series for the eve ad odd parts of a sigal. x[] fs X[k] x[ ] fs X[ k] Eve ( x[] ) = 1 ( ) 2 x[] + x[ ] fs 1 ( ) 2 X[k] + X[ k] If x[] is real, the X[ k] = X[k]. Eve ( x[] ) = 1 ( ) 2 x[] + x[ ] fs 1 2( X[k] + X[k] ) = Re (X[k]) Eve ( x[] ) fs Re ( X[k] ) Similarly Odd ( x[] ) fs jim ( X[k] )
34 Summary Discrete-Time Fourier Series orthogoality of harmoically related DT siusoids DT Fourier series relatios differeces betwee CT ad DT Fourier series properties of DT Fourier series Today s Lab: Use DT Fourier Series to Uderstad a Auditory Perceptio. For today oly: stay here istead. Studets who ormally have lab i should
Signal Processing in Mechatronics. Lecture 3, Convolution, Fourier Series and Fourier Transform
Sigal Processig i Mechatroics Summer semester, 1 Lecture 3, Covolutio, Fourier Series ad Fourier rasform Dr. Zhu K.P. AIS, UM 1 1. Covolutio Covolutio Descriptio of LI Systems he mai premise is that the
More informationMathematical Description of Discrete-Time Signals. 9/10/16 M. J. Roberts - All Rights Reserved 1
Mathematical Descriptio of Discrete-Time Sigals 9/10/16 M. J. Roberts - All Rights Reserved 1 Samplig ad Discrete Time Samplig is the acquisitio of the values of a cotiuous-time sigal at discrete poits
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 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 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 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 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 informationy[ n] = sin(2" # 3 # n) 50
Period of a Discrete Siusoid y[ ] si( ) 5 T5 samples y[ ] y[ + 5] si() si() [ ] si( 3 ) 5 y[ ] y[ + T] T?? samples [iteger] 5/3 iteger y irratioal frequecy ysi(pisqrt()/5) - - TextEd si( t) T sec cotiuous
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 informationReview of Discrete-time Signals. ELEC 635 Prof. Siripong Potisuk
Review of Discrete-time Sigals ELEC 635 Prof. Siripog Potisuk 1 Discrete-time Sigals Discrete-time, cotiuous-valued amplitude (sampled-data sigal) Discrete-time, discrete-valued amplitude (digital sigal)
More information1.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 informationModule 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 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 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 informationChapter 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 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 information5.1. Periodic Signals: A signal f(t) is periodic iff for some T 0 > 0,
5. Periodic Sigals: A sigal f(t) is periodic iff for some >, f () t = f ( t + ) i t he smallest value that satisfies the above coditios is called the period of f(t). Cosider a sigal examied over to 5 secods
More informationObjective Mathematics
. If sum of '' terms of a sequece is give by S Tr ( )( ), the 4 5 67 r (d) 4 9 r is equal to : T. Let a, b, c be distict o-zero real umbers such that a, b, c are i harmoic progressio ad a, b, c are i arithmetic
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 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 informationSolution of EECS 315 Final Examination F09
Solutio of EECS 315 Fial Examiatio F9 1. Fid the umerical value of δ ( t + 4ramp( tdt. δ ( t + 4ramp( tdt. Fid the umerical sigal eergy of x E x = x[ ] = δ 3 = 11 = ( = ramp( ( 4 = ramp( 8 = 8 [ ] = (
More 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 informationPractical 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 informationSUMMARY OF SEQUENCES AND SERIES
SUMMARY OF SEQUENCES AND SERIES Importat Defiitios, Results ad Theorems for Sequeces ad Series Defiitio. A sequece {a } has a limit L ad we write lim a = L if for every ɛ > 0, there is a correspodig iteger
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 information( a) ( ) 1 ( ) 2 ( ) ( ) 3 3 ( ) =!
.8,.9: Taylor ad Maclauri Series.8. Although we were able to fid power series represetatios for a limited group of fuctios i the previous sectio, it is ot immediately obvious whether ay give fuctio has
More information} is said to be a Cauchy sequence provided the following condition is true.
Math 4200, Fial Exam Review I. Itroductio to Proofs 1. Prove the Pythagorea theorem. 2. Show that 43 is a irratioal umber. II. Itroductio to Logic 1. Costruct a truth table for the statemet ( p ad ~ r
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 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 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 informationMa 4121: Introduction to Lebesgue Integration Solutions to Homework Assignment 5
Ma 42: Itroductio to Lebesgue Itegratio Solutios to Homework Assigmet 5 Prof. Wickerhauser Due Thursday, April th, 23 Please retur your solutios to the istructor by the ed of class o the due date. You
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 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 informationGeneralizing the DTFT. The z Transform. Complex Exponential Excitation. The Transfer Function. Systems Described by Difference Equations
Geeraliig the DTFT The Trasform M. J. Roberts - All Rights Reserved. Edited by Dr. Robert Akl 1 The forward DTFT is defied by X e jω = x e jω i which = Ω is discrete-time radia frequecy, a real variable.
More informationChapter 4 : Laplace Transform
4. Itroductio Laplace trasform is a alterative to solve the differetial equatio by the complex frequecy domai ( s = σ + jω), istead of the usual time domai. The DE ca be easily trasformed ito a algebraic
More 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 informationSignal 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 informationIntroduction 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 informationFFTs in Graphics and Vision. The Fast Fourier Transform
FFTs i Graphics ad Visio The Fast Fourier Trasform 1 Outlie The FFT Algorithm Applicatios i 1D Multi-Dimesioal FFTs More Applicatios Real FFTs 2 Computatioal Complexity To compute the movig dot-product
More 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 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 informationGenerating Functions. 1 Operations on generating functions
Geeratig Fuctios The geeratig fuctio for a sequece a 0, a,..., a,... is defied to be the power series fx a x. 0 We say that a 0, a,... is the sequece geerated by fx ad a is the coefficiet of x. Example
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More 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 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 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 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 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 informationCEMTool Tutorial. Fourier Analysis
CEMTool Tutorial Fourier Aalysis Overview This tutorial is part of the CEMWARE series. Each tutorial i this series will teach you a specific topic of commo applicatios by explaiig theoretical cocepts ad
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 informationStat 421-SP2012 Interval Estimation Section
Stat 41-SP01 Iterval Estimatio Sectio 11.1-11. We ow uderstad (Chapter 10) how to fid poit estimators of a ukow parameter. o However, a poit estimate does ot provide ay iformatio about the ucertaity (possible
More informationDigital Signal Processing
Digital Sigal Processig Z-trasform dftwave -Trasform Backgroud-Defiitio - Fourier trasform j ω j ω e x e extracts the essece of x but is limited i the sese that it ca hadle stable systems oly. jω e coverges
More 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 informationVibratory Motion. Prof. Zheng-yi Feng NCHU SWC. National CHung Hsing University, Department of Soil and Water Conservation
Vibratory Motio Prof. Zheg-yi Feg NCHU SWC 1 Types of vibratory motio Periodic motio Noperiodic motio See Fig. A1, p.58 Harmoic motio Periodic motio Trasiet motio impact Trasiet motio earthquake A powerful
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 informationLet A(x) and B(x) be two polynomials of degree n 1:
MI-EVY (2011/2012) J. Holub: 4. DFT, FFT ad Patter Matchig p. 2/42 Operatios o polyomials MI-EVY (2011/2012) J. Holub: 4. DFT, FFT ad Patter Matchig p. 4/42 Efficiet Patter Matchig (MI-EVY) 4. DFT, FFT
More informationECE-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 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 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 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 informationDigital signal processing: Lecture 5. z-transformation - I. Produced by Qiangfu Zhao (Since 1995), All rights reserved
Digital sigal processig: Lecture 5 -trasformatio - I Produced by Qiagfu Zhao Sice 995, All rights reserved DSP-Lec5/ Review of last lecture Fourier trasform & iverse Fourier trasform: Time domai & Frequecy
More informationCOMPUTING SUMS AND THE AVERAGE VALUE OF THE DIVISOR FUNCTION (x 1) + x = n = n.
COMPUTING SUMS AND THE AVERAGE VALUE OF THE DIVISOR FUNCTION Abstract. We itroduce a method for computig sums of the form f( where f( is ice. We apply this method to study the average value of d(, where
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 informationQuestion 1: The magnetic case
September 6, 018 Corell Uiversity, Departmet of Physics PHYS 337, Advace E&M, HW # 4, due: 9/19/018, 11:15 AM Questio 1: The magetic case I class, we skipped over some details, so here you are asked to
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 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 informationradians A function f ( x ) is called periodic if it is defined for all real x and if there is some positive number P such that:
Fourier Series. Graph of y Asix ad y Acos x Amplitude A ; period 36 radias. Harmoics y y six is the first harmoic y y six is the th harmoics 3. Periodic fuctio A fuctio f ( x ) is called periodic if it
More information1. Nature of Impulse Response - Pole on Real Axis. z y(n) = r n. z r
. Nature of Impulse Respose - Pole o Real Axis Causal system trasfer fuctio: Hz) = z yz) = z r z z r y) = r r > : the respose grows mootoically > r > : y decays to zero mootoically r > : oscillatory, decayig
More informationMechatronics. Time Response & Frequency Response 2 nd -Order Dynamic System 2-Pole, Low-Pass, Active Filter
Time Respose & Frequecy Respose d -Order Dyamic System -Pole, Low-Pass, Active Filter R 4 R 7 C 5 e i R 1 C R 3 - + R 6 - + e out Assigmet: Perform a Complete Dyamic System Ivestigatio of the Two-Pole,
More informationCHAPTER 10 INFINITE SEQUENCES AND SERIES
CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece
More informationCALCULATION OF FIBONACCI VECTORS
CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College
More informationUnit 4: Polynomial and Rational Functions
48 Uit 4: Polyomial ad Ratioal Fuctios Polyomial Fuctios A polyomial fuctio y px ( ) is a fuctio of the form p( x) ax + a x + a x +... + ax + ax+ a 1 1 1 0 where a, a 1,..., a, a1, a0are real costats ad
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 information2. Fourier Series, Fourier Integrals and Fourier Transforms
Mathematics IV -. Fourier Series, Fourier Itegrals ad Fourier Trasforms The Fourier series are used for the aalysis of the periodic pheomea, which ofte appear i physics ad egieerig. The Fourier itegrals
More informationEE123 Digital Signal Processing
Today EE123 Digital Sigal Processig Lecture 2 Last time: Admiistratio Overview Today: Aother demo Ch. 2 - Discrete-Time Sigals ad Systems 1 2 Discrete Time Sigals Samples of a CT sigal: x[] =X a (T ) =1,
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 information2D DSP Basics: Systems Stability, 2D Sampling
- Digital Iage Processig ad Copressio D DSP Basics: Systes Stability D Saplig Stability ty Syste is stable if a bouded iput always results i a bouded output BIBO For LSI syste a sufficiet coditio for stability:
More informationDifference Equation Construction (1) ENGG 1203 Tutorial. Difference Equation Construction (2) Grow, baby, grow (1)
ENGG 03 Tutorial Differece Equatio Costructio () Systems ad Cotrol April Learig Objectives Differece Equatios Z-trasform Poles Ack.: MIT OCW 6.0, 6.003 Newto s law of coolig states that: The chage i a
More informationThe 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 informationLecture 7: Fourier Series and Complex Power Series
Math 1d Istructor: Padraic Bartlett Lecture 7: Fourier Series ad Complex Power Series Week 7 Caltech 013 1 Fourier Series 1.1 Defiitios ad Motivatio Defiitio 1.1. A Fourier series is a series of fuctios
More informationQ.11 If S be the sum, P the product & R the sum of the reciprocals of a GP, find the value of
Brai Teasures Progressio ad Series By Abhijit kumar Jha EXERCISE I Q If the 0th term of a HP is & st term of the same HP is 0, the fid the 0 th term Q ( ) Show that l (4 36 08 up to terms) = l + l 3 Q3
More informationChapter 6 Infinite Series
Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat
More informationThe structure of Fourier series
The structure of Fourier series Valery P Dmitriyev Lomoosov Uiversity, Russia Date: February 3, 2011) Fourier series is costructe basig o the iea to moel the elemetary oscillatio 1, +1) by the expoetial
More informationClassification of DT signals
Comlex exoetial A discrete time sigal may be comlex valued I digital commuicatios comlex sigals arise aturally A comlex sigal may be rereseted i two forms: jarg { z( ) } { } z ( ) = Re { z ( )} + jim {
More 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 information6.003: Signals and Systems. Feedback, Poles, and Fundamental Modes
6.003: Sigals ad Systems Feedback, Poles, ad Fudametal Modes February 9, 2010 Last Time: Multiple Represetatios of DT Systems Verbal descriptios: preserve the ratioale. To reduce the umber of bits eeded
More informationLecture 3: Divide and Conquer: Fast Fourier Transform
Lecture 3: Divide ad Coquer: Fast Fourier Trasform Polyomial Operatios vs. Represetatios Divide ad Coquer Algorithm Collapsig Samples / Roots of Uity FFT, IFFT, ad Polyomial Multiplicatio Polyomial operatios
More informationIt is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.
Taylor Polyomials ad Taylor Series It is ofte useful to approximate complicated fuctios usig simpler oes We cosider the task of approximatig a fuctio by a polyomial If f is at least -times differetiable
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 informationWe are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n
Review of Power Series, Power Series Solutios A power series i x - a is a ifiite series of the form c (x a) =c +c (x a)+(x a) +... We also call this a power series cetered at a. Ex. (x+) is cetered at
More informationMATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and
MATH01 Real Aalysis (2008 Fall) Tutorial Note #7 Sequece ad Series of fuctio 1: Poitwise Covergece ad Uiform Covergece Part I: Poitwise Covergece Defiitio of poitwise covergece: A sequece of fuctios f
More informationLecture #5: Begin Quantum Mechanics: Free Particle and Particle in a 1D Box
561 Fall 013 Lecture #5 page 1 Last time: Lecture #5: Begi Quatum Mechaics: Free Particle ad Particle i a 1D Box u 1 u 1-D Wave equatio = x v t * u(x,t): displacemets as fuctio of x,t * d -order: solutio
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 informationAlgorithms and Data Structures 2014 Exercises and Solutions Week 13
Algorithms ad Data Structures 204 Exercises ad Solutios Week 3 Toom-Cook (cotiued) Durig the last lecture, two polyomials A(x) a 0 + a x ad B(x) b 0 + b x both of degree were multiplied, first by evaluatig
More informationAbstract 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 informationMath 113 Exam 3 Practice
Math Exam Practice Exam 4 will cover.-., 0. ad 0.. Note that eve though. was tested i exam, questios from that sectios may also be o this exam. For practice problems o., refer to the last review. This
More information1 of 7 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 6. Order Statistics Defiitios Suppose agai that we have a basic radom experimet, ad that X is a real-valued radom variable
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 informationPolynomial Functions. New Section 1 Page 1. A Polynomial function of degree n is written is the form:
New Sectio 1 Page 1 A Polyomial fuctio of degree is writte is the form: 1 P x a x a x a x a x a x a 1 1 0 where is a o-egative iteger expoet ad a 0 ca oly take o values where a, a, a,..., a, a. 0 1 1.
More informationMath 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