The Discrete-Time Fourier Transform (DTFT)
|
|
- Kerry Alexander
- 6 years ago
- Views:
Transcription
1 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 explore some o its properties.. Discrete-Time Fourier Trasorm (DTFT) A. Itroductio Previously, we have deied the cotiuous-time Fourier trasorm (CTFT) as, X () xt ()e jπt dt () where xt () is a cotiuous-time sigal, X () is the CTFT o the cotiuous-time sigal, t deotes the time variable (i secods), ad deotes the requecy variable (i Hertz). The discrete-time Fourier trasorm (DTFT) is deied by, Xe ( j ) e j where is a discrete-time sigal, Xe ( j ) is the DTFT o the discrete-time sigal, deotes the time idex, ad deotes the requecy variable. Comparig the deiitios or the CTFT ad the DTFT, we observe the ollowig diereces. For the DTFT, the itegratio over time t has bee replaced by a summatio over the time idex ; also, the requecy variable is uitless. I order to relate the requecy variable to a real requecy, we eed to kow the samplig requecy s. That is, i the discrete-time sequece represets a sampled cotiuous-time sigal, sampled at requecy s, the ad the correspodig real requecy are related as ollows: () s π , () π s B. Aalytic example We begi our study o the DTFT by lookig at the DTFT o a simple discrete-time sigal, amely a pulse o width M + cetered at : M > M () While i geeral it is much more diicult to derive a aalytic expressio or the DTFT tha or the CTFT, or the example sigal i () it is possible to derive a closed-orm expressio. Applyig deiitio (), M Xe ( j ) e j M M Xe ( j ) e j( M) M Xe ( j ) e jm e j () () (7) - -
2 EEL: Discrete-Time Sigals ad Systems The Discrete-Time Fourier Trasorm (DTFT) Xe ( j ) ejm e j M ( + ) e j From (7) to (8) above, we used the ollowig iite geometric sum idetity: (8) N α α ( N + ), α. (9) α where, or our case, α e j ad N M. () Equatio (8) ca be urther simpliied by symmetrizig the powers o the expoetials i the umerator ad deomiator: Xe ( j ) ejm e j ( M + ) ( e j( M + ) e j( M + ) ) e j ( e j e j ) Xe ( j ) ejm e j M ( + ) e j( M + ) e j( M + ) e j e j e j Note that, ejm e j ( M ) e j () () () so that equatio () reduces to: Xe ( j ) e j( M + ) e j( M + ) e j e j e j( M + ) e j( M + ) j j e j e j () Xe ( j ) si -- ( M + ) si -- () I Figure below, we plot Xe ( j ) or a pulse with M. Note that this DTFT appears to be periodic i the requecy variable with period T π. This is ot oly the case or this example, but or the DTFT o ay discrete-time sigal. The periodic property o the DTFT is easily show by goig back to the deiitio i equatio (): Xe ( j( + π) ) e j ( + π ) e jπ e j Note that or iteger, so that: e jπ e jπ Xe ( j ) () (7) Xe ( j( + π) ) Xe ( j ). (8). Strictly speakig, equatio (9) is ot valid or ± π, {,,, }, sice α or those values o. For these values o, Xe ( j ) M +. Usig L Hopital s Rule, this is, however, precisely the limitig value o the ial expressio or Xe ( j ) i equatio (). Thereore, we do ot treat this case separately. - -
3 EEL: Discrete-Time Sigals ad Systems The Discrete-Time Fourier Trasorm (DTFT) M 8 Xe ( j ) Xe ( j ) 8 Xe j ( ) Figure Hece, the DTFT o ay discrete-time sigal is periodic i wit period T π. This result is closely related to our previous discussio o samplig ad aliasig as we shall see shortly. Now, let us see how the DTFT i equatio () chages as a uctio o the pulse width parameter M. I Figure, we plot ad Xe ( j ) or M 8,,,,. Note the strog similarity o Figure below, ad Figure o page 7 o the Fourier Series to Fourier Trasorm otes. For the arrowest pulse ( M, δ[ ] ), the requecy cotet is uiormly distributed or π π, while or the wider pulses, the requecy cotet becomes more ad more cocetrated aroud. This is the same pheomeo as or the CTFT (Figure, Fourier Series to Fourier Trasorm otes).. Some additioal DTFT illustratios Below, we explore additioal examples o the DTFT. A. Fiite-legth cosie wave Here we cosider the DTFT o a discrete-time sigal, sampled rom the cotiuous-time sigal x c () t, x c () t cos( πt) (9) with samplig requecy s Hz or a total o samples, such that, x c ( s ) {,,, 8, 9}. () elsewhere Applyig deiitio (), 9 Xe ( j ) x c ( s )e j () I Figure, we plot Xe ( j ) ad Xe ( j ) or the discrete-time sequece i () as a uctio o the dimesioless requecy variable, ad as a uctio o the real requecy variable (i Hertz), where we make - -
4 EEL: Discrete-Time Sigals ad Systems The Discrete-Time Fourier Trasorm (DTFT) M Xe ( j ) M Xe ( j ) M Xe ( j ) M 8 Xe ( j ) M 8 Xe ( j ) Figure - -
5 EEL: Discrete-Time Sigals ad Systems The Discrete-Time Fourier Trasorm (DTFT) Xe ( j ) Xe ( j ) Xe ( j ) π s Figure Xe ( j ) π s - - the substitutio i equatio (). That is, the bottom two plots i Figure correspod to the two expressios below: Xe ( j ) π s ad Xe ( j ) π () s These plots are more meaigul to us, sice they clearly shows two spikes i the DTFT cetered at ±Hz. Now, let us make a ew observatios. First, ote that whe plotted as a uctio o, oe period o the DTFT covers the requecy rage [ s, s ] [ Hz, Hz] ( s Hz ). Sice the DTFT is periodic, this same requecy spectrum will be repeated outside this requecy rage. Recall rom our discussio o samplig, this is exactly what we said would occur amely, that the requecy spectrum o the origial cotiuous-time waveorm will be repeated at osets o ± k s, k {,,, }. I Figure, or example, we plot Xe ( j ) π s or Hz < < Hz, correspodig to π < < π. At this poit, the reader might object to the above discussio o the grouds that we have previously said that the cotiuous-time spectrum o the cosie wave x c () t i equatio (9) is give by, X c () --δ ( + ) + --δ ( ) () - -
6 EEL: Discrete-Time Sigals ad Systems The Discrete-Time Fourier Trasorm (DTFT) Xe ( j ) π s - - Figure That is, the CTFT has two distict spikes at ±Hz, ad is zero everywhere else. The CTFT i () is, however, correct oly or a cosie wave that is ot time-limited. Note that by restrictig our samplig o the cosie wave to periods o the Hz cosie wave ( samples), we implicitly assumed that the discrete-time sigal is zero everywhere else. That is, the DTFTs i Figures ad represet the discrete-time requecy spectrum o a time-limited cosie wave. For compariso, we ca compute the CTFT or the ollowig time-limited cotiuous-time uctio, xt () cos( πt) [ ut () ut ( ) ] () by applyig deiitio (): X () xt ()e jπt dt cos( πt)e jπt dt () Usig the iverse Euler relatios or the cosie uctio: X () X () --e jπt + --e jπt e jπtdt -- e [ jπt( ) + e jπt( + ) ] dt () (7) X () e jπt( ) jπ( ) + e jπt( + ) jπ( + ) t t (8) X () -- e jπ( ) e jπ( + ) jπ( ) jπ( ) jπ( ) jπ( ) (9) X () j -- e jπ( ) e jπ( + ) π( ) π( ) () Figure below plots the time-limited, cotiuous-time sigal i () ad its CTFT magitude spectrum X (). Note that except or a scalig dierece, the CTFT ad the DTFT appear very similar over the requecy rage [ s, s ]. Thus, the act that the DTFT spectral represetatio o the sampled, time-limited cosie wave is ot etirely localized at ±Hz (as might have bee expected) is ot a cosequece o the DTFT itsel, but rather a cosequece o the iite-legth samplig process. We reer to this pheomeo, amely, the spreadig o requecy cotet rom the idealized peaks to the etire requecy rage due to iite-legth samplig, as spectral leakage. The loger the sequece legth, the more cocetrated the requecy cotet o that discrete-time sigal will be i the eighborhood o its domiat requecies. Below, we cosider the DTFT or the discrete-time sigal, - -
7 EEL: Discrete-Time Sigals ad Systems The Discrete-Time Fourier Trasorm (DTFT) xt () t - X () Figure x c ( s ) {,,, 98, 99} elsewhere () where x c () t is agai a Hz cosie wave, ad the samplig requecy is agai give by s Hz. Note that the dierece betwee the discrete-time sigals i equatios () ad () is that ow cosists o samples ( cycles o the cosie wave), istead o samples ( cycles o the cosie wave). I Figure, we plot the DTFT as a uctio o requecy or i equatio (). Comparig the plots i Figure to those i Figure ( samples), ote how much more tightly ocused the requecy cotet is about the requecies ±Hz. B. Fiite-legth sum o cosies Here we cosider the DTFT o a discrete-time sigal, sampled rom the cotiuous-time sigal x c () t, x c () t + cos( πt) + cos( πt) () with samplig requecy s Hz or a total o samples, such that, x c ( s ) {,,, 8, 9}. () elsewhere Applyig deiitio (), 9 Xe ( j ) x c ( s )e j () I Figure 7, we plot Xe ( j ) ad Xe ( j ) or the discrete-time sequece i () as a uctio o the dimesioless requecy variable, ad as a uctio o the real requecy variable (i Hertz), where we agai - 7 -
8 EEL: Discrete-Time Sigals ad Systems The Discrete-Time Fourier Trasorm (DTFT) Xe ( j ) π s - Xe ( j X )() π s - make the substitutio i equatio (). That is, the bottom two plots i Figure 7 correspod to the two expressios below: Xe ( j ) π s ad Xe ( j ) π () s Note the peaks i the requecy spectrum at Hz, ± Hz ad ± Hz, correspodig to the three terms i equatio (). I Figure 8, we plot Xe ( j ) π s or Hz < < Hz, correspodig to π < < π. Note agai that the requecy spectrum o the time-limited cotiuous-time waveorm is replicated at osets o ± k s, k {,,, } or the time-limited sampled waveorm. Note the similarity o the spectrum i Figure 8 to that o the idealized, iiite-time sampled waveorm, plotted i Figure 9 below. I the examples above, the samplig requecy s was larger tha the Nyquist requecy o max. I the ext sectio, we will look at the DTFT whe the samplig requecy is less tha the Nyquist requecy.. Aliasig ad the Discrete-Time Fourier Trasorm (DTFT) A. Itroductio I the previous sectio, we saw a example o the discrete-time Fourier Trasorm (DTFT) or iite-legth sequeces, - Figure x c ( s ) {,,, 8, 9} elsewhere () where, x c () t + cos( πt) + cos( πt) (7) ad the samplig requecy is give as s Hz, which is greater tha the Nyquist requecy, max Hz Hz. (8) - 8 -
9 EEL: Discrete-Time Sigals ad Systems The Discrete-Time Fourier Trasorm (DTFT) - 8 Xe ( j ) Xe ( j ) Below, we explore the DTFT or the same cotiuous-time sigal, but or two samplig requecies below the Nyquist requecy. B. Udersampled examples - - Here we look at the DTFT o the ollowig iite-legth sequece: Xe ( j ) π s Figure 7 Xe ( j ) π s - - x c ( s ) {,,,, } elsewhere (9) where s Hz ad x c () t is give by equatio (7) above. That is, we sample the cotiuous-time sigal x c () t or the same legth o time, oly at a lower samplig requecy (below the Nyquist requecy o Hz) tha beore. I order to relate our preset discussio to our previous discussio o samplig ad aliasig, we plot the ollowig uctios i Figure below: () the origial sigal x c () t ; () the sampled sigal ; () the iiite-legth, cotiuous-time requecy spectrum X c () (CTFT) o the cotiuous-time sigal x c () t ; () the sampled req. spectrum X s () (CTFT) or the iiite-legth, cotiuous-time sigal x s () t, x s () t x' [ ]δ t -- s () - 9 -
10 EEL: Discrete-Time Sigals ad Systems The Discrete-Time Fourier Trasorm (DTFT) 8 Xe ( j ) π s - - Figure Figure 9: Sampled spectrum o iiite-legth sampled sum o cosies. where x' [ ] x c ( s ), ; ad () the magitude DTFT Xe ( j ) π s o the iite-legth, discretetime sigal as a uctio o requecy. Note that except or the spectral leakage (deied previously) caused by the iite-legth o, the DTFT has peaks o the same relative magitude ad at the same requecies as X s (). I Figure, we plot the same uctios as i Figure, except that ow the iite-legth sequece is give by: x c ( s ) {,,,, 7} elsewhere () where s.hz ad x c () t is agai give by equatio (7) above. Agai, ote the similarity betwee the DTFT ad X s (). C. Oversampled example Fially or compariso, we geerate the same ive plots as above or the oversampled case rom the previous sectio (Figure ). The iite-legth sequece is ow the same as last time [equatio ()] with s Hz. I all three o these examples, the DTFT or the iite-legth sampled sequeces geerates a similar requecy distributio as the CTFT or the iiite-legth sampled sequeces (represeted i the cotiuoustime domai as x s () t ), with two mai diereces: () scalig ad () spectral leakage caused by the iitelegth samplig processes i equatios (), (9) ad ().. Coclusio The Mathematica otebook dtt.b was used to geerate the examples i this set o otes. Next time, we will itroduce the discrete Fourier trasorm (DFT) ad show how it is related to the DTFT. - -
11 EEL: Discrete-Time Sigals ad Systems The Discrete-Time Fourier Trasorm (DTFT) s Hz x c () t - - t 8. X c (). X s () DTFT Xe ( j ) π s Figure - -
12 EEL: Discrete-Time Sigals ad Systems The Discrete-Time Fourier Trasorm (DTFT) x c () t s.hz - - t X c (). X s () DTFT Xe ( j ) π s Figure - -
13 EEL: Discrete-Time Sigals ad Systems The Discrete-Time Fourier Trasorm (DTFT) s Hz x c () t - - t. X c (). X s () DTFT - - Xe ( j ) π s - - Figure - -
FIR 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 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 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 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 informationDiscrete-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 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 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 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 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 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 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 informationSTAT 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 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 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 informationPhys. 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 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 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 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 informationCHAPTER 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 informationIntroduction to Extreme Value Theory Laurens de Haan, ISM Japan, Erasmus University Rotterdam, NL University of Lisbon, PT
Itroductio to Extreme Value Theory Laures de Haa, ISM Japa, 202 Itroductio to Extreme Value Theory Laures de Haa Erasmus Uiversity Rotterdam, NL Uiversity of Lisbo, PT Itroductio to Extreme Value Theory
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 informationsubcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016
subcaptiofot+=small,labelformat=pares,labelsep=space,skip=6pt,list=0,hypcap=0 subcaptio ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, /6/06. Self-cojugate Partitios Recall that, give a partitio λ, we may
More informationDefinition of z-transform.
- Trasforms Frequecy domai represetatios of discretetime sigals ad LTI discrete-time systems are made possible with the use of DTFT. However ot all discrete-time sigals e.g. uit step sequece are guarateed
More informationStatistics 511 Additional Materials
Cofidece Itervals o mu Statistics 511 Additioal Materials This topic officially moves us from probability to statistics. We begi to discuss makig ifereces about the populatio. Oe way to differetiate probability
More informationChapter 8. Euler s Gamma function
Chapter 8 Euler s Gamma fuctio The Gamma fuctio plays a importat role i the fuctioal equatio for ζ(s that we will derive i the ext chapter. I the preset chapter we have collected some properties of the
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 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 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 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 informationThe Riemann Zeta Function
Physics 6A Witer 6 The Riema Zeta Fuctio I this ote, I will sketch some of the mai properties of the Riema zeta fuctio, ζ(x). For x >, we defie ζ(x) =, x >. () x = For x, this sum diverges. However, we
More informationDiscrete-time Fourier transform (DTFT) of aperiodic and periodic signals
5 Discrete-time Fourier trasform (DTFT) of aperiodic ad periodic sigals We started with Fourier series which ca represet a periodic sigal usig siusoids. Fourier Trasform, a extesio of the Fourier series
More informationAdditional Notes on Power Series
Additioal Notes o Power Series Mauela Girotti MATH 37-0 Advaced Calculus of oe variable Cotets Quick recall 2 Abel s Theorem 2 3 Differetiatio ad Itegratio of Power series 4 Quick recall We recall here
More informationPolynomial Generalizations and Combinatorial Interpretations for Sequences Including the Fibonacci and Pell Numbers
Ope Joural o Discrete Mathematics,,, - http://dxdoiorg/46/odm6 Published Olie Jauary (http://wwwscirporg/oural/odm) Polyomial Geeralizatios ad Combiatorial Iterpretatios or Seueces Icludig the Fiboacci
More informationINFINITE SEQUENCES AND SERIES
11 INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES 11.4 The Compariso Tests I this sectio, we will lear: How to fid the value of a series by comparig it with a kow series. COMPARISON TESTS
More informationSection 11.8: Power Series
Sectio 11.8: Power Series 1. Power Series I this sectio, we cosider geeralizig the cocept of a series. Recall that a series is a ifiite sum of umbers a. We ca talk about whether or ot it coverges ad i
More 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 informationLecture 11. Solution of Nonlinear Equations - III
Eiciecy o a ethod Lecture Solutio o Noliear Equatios - III The eiciecy ide o a iterative ethod is deied by / E r r: rate o covergece o the ethod : total uber o uctios ad derivative evaluatios at each step
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 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 informationMcGill 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 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 informationDirichlet s Theorem on Arithmetic Progressions
Dirichlet s Theorem o Arithmetic Progressios Athoy Várilly Harvard Uiversity, Cambridge, MA 0238 Itroductio Dirichlet s theorem o arithmetic progressios is a gem of umber theory. A great part of its beauty
More informationA NUMERICAL METHOD OF SOLVING CAUCHY PROBLEM FOR DIFFERENTIAL EQUATIONS BASED ON A LINEAR APPROXIMATION
U.P.B. Sci. Bull., Series A, Vol. 79, Iss. 4, 7 ISSN -77 A NUMERICAL METHOD OF SOLVING CAUCHY PROBLEM FOR DIFFERENTIAL EQUATIONS BASED ON A LINEAR APPROXIMATION Cristia ŞERBĂNESCU, Marius BREBENEL A alterate
More informationECEN 644 HOMEWORK #5 SOLUTION SET
ECE 644 HOMEWORK #5 SOUTIO SET 7. x is a real valued sequece. The first five poits of its 8-poit DFT are: {0.5, 0.5 - j 0.308, 0, 0.5 - j 0.058, 0} To compute the 3 remaiig poits, we ca use the followig
More informationChapter 8. Euler s Gamma function
Chapter 8 Euler s Gamma fuctio The Gamma fuctio plays a importat role i the fuctioal equatio for ζ(s) that we will derive i the ext chapter. I the preset chapter we have collected some properties of the
More informationlim za n n = z lim a n n.
Lecture 6 Sequeces ad Series Defiitio 1 By a sequece i a set A, we mea a mappig f : N A. It is customary to deote a sequece f by {s } where, s := f(). A sequece {z } of (complex) umbers is said to be coverget
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 informationTopic 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 informationRepresenting 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(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationMATH 31B: MIDTERM 2 REVIEW
MATH 3B: MIDTERM REVIEW JOE HUGHES. Evaluate x (x ) (x 3).. Partial Fractios Solutio: The umerator has degree less tha the deomiator, so we ca use partial fractios. Write x (x ) (x 3) = A x + A (x ) +
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 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 informationEuler-MacLaurin using the ZETA-matrix
Idetities ivolvig biomial-coeiciets, Beroulli- ad Stirligumbers Gottried Helms - Uiv Kassel 2' 26-23 Euler-MacLauri usig the ZETA-matrix Abstract: The represetatio o the Euler-MacLauri-summatio ormula
More informationComplex Numbers Solutions
Complex Numbers Solutios Joseph Zoller February 7, 06 Solutios. (009 AIME I Problem ) There is a complex umber with imagiary part 64 ad a positive iteger such that Fid. [Solutio: 697] 4i + + 4i. 4i 4i
More informationComparison Study of Series Approximation. and Convergence between Chebyshev. and Legendre Series
Applied Mathematical Scieces, Vol. 7, 03, o. 6, 3-337 HIKARI Ltd, www.m-hikari.com http://d.doi.org/0.988/ams.03.3430 Compariso Study of Series Approimatio ad Covergece betwee Chebyshev ad Legedre Series
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 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 information2.4 Sequences, Sequences of Sets
72 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.4 Sequeces, Sequeces of Sets 2.4.1 Sequeces Defiitio 2.4.1 (sequece Let S R. 1. A sequece i S is a fuctio f : K S where K = { N : 0 for some 0 N}. 2. For each
More information4x 2. (n+1) x 3 n+1. = lim. 4x 2 n+1 n3 n. n 4x 2 = lim = 3
Exam Problems (x. Give the series (, fid the values of x for which this power series coverges. Also =0 state clearly what the radius of covergece is. We start by settig up the Ratio Test: x ( x x ( x x
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 informationENGI 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 informationMAT1026 Calculus II Basic Convergence Tests for Series
MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real
More informationThe natural exponential function
The atural expoetial fuctio Attila Máté Brookly College of the City Uiversity of New York December, 205 Cotets The atural expoetial fuctio for real x. Beroulli s iequality.....................................2
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 information7 Sequences of real numbers
40 7 Sequeces of real umbers 7. Defiitios ad examples Defiitio 7... A sequece of real umbers is a real fuctio whose domai is the set N of atural umbers. Let s : N R be a sequece. The the values of s are
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 informationSequences 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 informationA 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 informationZ ß cos x + si x R du We start with the substitutio u = si(x), so du = cos(x). The itegral becomes but +u we should chage the limits to go with the ew
Problem ( poits) Evaluate the itegrals Z p x 9 x We ca draw a right triagle labeled this way x p x 9 From this we ca read off x = sec, so = sec ta, ad p x 9 = R ta. Puttig those pieces ito the itegralrwe
More informationSpectral 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 informationMeasure and Measurable Functions
3 Measure ad Measurable Fuctios 3.1 Measure o a Arbitrary σ-algebra Recall from Chapter 2 that the set M of all Lebesgue measurable sets has the followig properties: R M, E M implies E c M, E M for N implies
More informationThis chapter describes different methods to discretize the diffusion equation. f z 2 = 0. y ) x f
Chapter 8 Diusio Equatio This chapter describes dieret methods to discretize the diusio equatio 2 t α x 2 + 2 y 2 + 2 z 2 = 0 which represets a combied boudary ad iitial value problem, i.e., requires to
More informationCHAPTER 6c. NUMERICAL INTERPOLATION
CHAPTER 6c. NUMERICAL INTERPOLATION A. J. Clark School o Egieerig Departmet o Civil ad Evirometal Egieerig y Dr. Irahim A. Assakka Sprig ENCE - Computatio Methods i Civil Egieerig II Departmet o Civil
More informationA PROOF OF THE TWIN PRIME CONJECTURE AND OTHER POSSIBLE APPLICATIONS
A PROOF OF THE TWI PRIME COJECTURE AD OTHER POSSIBLE APPLICATIOS by PAUL S. BRUCKMA 38 Frot Street, #3 aaimo, BC V9R B8 (Caada) e-mail : pbruckma@hotmail.com ABSTRACT : A elemetary proof of the Twi Prime
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 informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS
MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak
More informationPLEASE MARK YOUR ANSWERS WITH AN X, not a circle! 1. (a) (b) (c) (d) (e) 3. (a) (b) (c) (d) (e) 5. (a) (b) (c) (d) (e) 7. (a) (b) (c) (d) (e)
Math 0560, Exam 3 November 6, 07 The Hoor Code is i effect for this examiatio. All work is to be your ow. No calculators. The exam lasts for hour ad 5 mi. Be sure that your ame is o every page i case pages
More informationHonors Calculus Homework 13 Solutions, due 12/8/5
Hoors Calculus Homework Solutios, due /8/5 Questio Let a regio R i the plae be bouded by the curves y = 5 ad = 5y y. Sketch the regio R. The two curves meet where both equatios hold at oce, so where: y
More informationMachine Learning for Data Science (CS 4786)
Machie Learig for Data Sciece CS 4786) Lecture & 3: Pricipal Compoet Aalysis The text i black outlies high level ideas. The text i blue provides simple mathematical details to derive or get to the algorithm
More informationAn Introduction to Randomized Algorithms
A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis
More informationMath 113, Calculus II Winter 2007 Final Exam Solutions
Math, Calculus II Witer 7 Fial Exam Solutios (5 poits) Use the limit defiitio of the defiite itegral ad the sum formulas to compute x x + dx The check your aswer usig the Evaluatio Theorem Solutio: I this
More 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 informationFundamental 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 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 informationWhere 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 informationSequences. Notation. Convergence of a Sequence
Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it
More informationfrom 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 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 informationANSWERS SOLUTIONS iiii i. and 1. Thus, we have. i i i. i, A.
013 ΜΑΘ Natioal Covetio ANSWERS (1) C A A A B (6) B D D A B (11) C D D A A (16) D B A A C (1) D B C B C (6) D C B C C 1. We have SOLUTIONS 1 3 11 61 iiii 131161 i 013 013, C.. The powers of i cycle betwee
More informationOnce we have a sequence of numbers, the next thing to do is to sum them up. Given a sequence (a n ) n=1
. Ifiite Series Oce we have a sequece of umbers, the ext thig to do is to sum them up. Give a sequece a be a sequece: ca we give a sesible meaig to the followig expressio? a = a a a a While summig ifiitely
More 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 informationRandom Variables, Sampling and Estimation
Chapter 1 Radom Variables, Samplig ad Estimatio 1.1 Itroductio This chapter will cover the most importat basic statistical theory you eed i order to uderstad the ecoometric material that will be comig
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 informationA PROCEDURE TO MODIFY THE FREQUENCY AND ENVELOPE CHARACTERISTICS OF EMPIRICAL GREEN'S FUNCTION. Lin LU 1 SUMMARY
A POCEDUE TO MODIFY THE FEQUENCY AND ENVELOPE CHAACTEISTICS OF EMPIICAL GEEN'S FUNCTION Li LU SUMMAY Semi-empirical method, which divides the fault plae of large earthquake ito mets ad uses small groud
More informationTaylor Polynomials and Approximations - Classwork
Taylor Polyomials ad Approimatios - Classwork Suppose you were asked to id si 37 o. You have o calculator other tha oe that ca do simple additio, subtractio, multiplicatio, or divisio. Fareched\ Not really.
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 informationAppendix to Quicksort Asymptotics
Appedix to Quicksort Asymptotics James Alle Fill Departmet of Mathematical Scieces The Johs Hopkis Uiversity jimfill@jhu.edu ad http://www.mts.jhu.edu/~fill/ ad Svate Jaso Departmet of Mathematics Uppsala
More informationProblem 4: Evaluate ( k ) by negating (actually un-negating) its upper index. Binomial coefficient
Problem 4: Evaluate by egatig actually u-egatig its upper idex We ow that Biomial coefficiet r { where r is a real umber, is a iteger The above defiitio ca be recast i terms of factorials i the commo case
More information