Discrete Fourier Transform (DFT)

Similar documents
DTFT Properties. Example - Determine the DTFT Y ( e ) of n. Let. We can therefore write. From Table 3.1, the DTFT of x[n] is given by 1

Chapter Discrete Fourier Transform

Discrete Fourier Transform. Discrete Fourier Transform. Discrete Fourier Transform. Discrete Fourier Transform. Discrete Fourier Transform

Worksheet: Taylor Series, Lagrange Error Bound ilearnmath.net

z 1+ 3 z = Π n =1 z f() z = n e - z = ( 1-z) e z e n z z 1- n = ( 1-z/2) 1+ 2n z e 2n e n -1 ( 1-z )/2 e 2n-1 1-2n -1 1 () z

Digital Signal Processing, Fall 2006

Chapter 11.00C Physical Problem for Fast Fourier Transform Civil Engineering

Chapter 4 - The Fourier Series

Frequency Measurement in Noise

Discrete Fourier Transform. Nuno Vasconcelos UCSD

1985 AP Calculus BC: Section I

A Simple Proof that e is Irrational

Technical Support Document Bias of the Minimum Statistic

H2 Mathematics Arithmetic & Geometric Series ( )

APPENDIX: STATISTICAL TOOLS

Problem Value Score Earned No/Wrong Rec -3 Total

Chapter 3 Fourier Series Representation of Periodic Signals

Lectures 9 IIR Systems: First Order System

07 - SEQUENCES AND SERIES Page 1 ( Answers at he end of all questions ) b, z = n

Part B: Transform Methods. Professor E. Ambikairajah UNSW, Australia

Triple Play: From De Morgan to Stirling To Euler to Maclaurin to Stirling

[ ] Review. For a discrete-time periodic signal xn with period N, the Fourier series representation is

ln x = n e = 20 (nearest integer)

DFT: Discrete Fourier Transform

Statistics 3858 : Likelihood Ratio for Exponential Distribution

15/03/1439. Lectures on Signals & systems Engineering

A Review of Complex Arithmetic

STIRLING'S 1 FORMULA AND ITS APPLICATION

10. The Discrete-Time Fourier Transform (DTFT)

Chapter 6: DFT/FFT Transforms and Applications 6.1 DFT and its Inverse

PURE MATHEMATICS A-LEVEL PAPER 1

MONTGOMERY COLLEGE Department of Mathematics Rockville Campus. 6x dx a. b. cos 2x dx ( ) 7. arctan x dx e. cos 2x dx. 2 cos3x dx

Probability & Statistics,

Introduction to Quantum Information Processing. Overview. A classical randomised algorithm. q 3,3 00 0,0. p 0,0. Lecture 10.

UNIT 2: MATHEMATICAL ENVIRONMENT

An Introduction to Asymptotic Expansions

On the approximation of the constant of Napier

Chapter 2 Infinite Series Page 1 of 11. Chapter 2 : Infinite Series

Time : 1 hr. Test Paper 08 Date 04/01/15 Batch - R Marks : 120

Chapter Five. More Dimensions. is simply the set of all ordered n-tuples of real numbers x = ( x 1

Response of LTI Systems to Complex Exponentials

New Sixteenth-Order Derivative-Free Methods for Solving Nonlinear Equations

Fourier Series: main points

Pier Franz Roggero, Michele Nardelli, Francesco Di Noto

Review Exercises. 1. Evaluate using the definition of the definite integral as a Riemann Sum. Does the answer represent an area? 2

A. Basics of Discrete Fourier Transform

LECTURE 13 Filling the bands. Occupancy of Available Energy Levels

NEW APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA

10. Joint Moments and Joint Characteristic Functions

Session : Plasmas in Equilibrium

Option 3. b) xe dx = and therefore the series is convergent. 12 a) Divergent b) Convergent Proof 15 For. p = 1 1so the series diverges.

2.29 Numerical Fluid Mechanics Spring 2015 Lecture 12

Chapter Taylor Theorem Revisited

ECE594I Notes set 6: Thermal Noise

International Journal of Advanced and Applied Sciences

Washington State University

ELEC9721: Digital Signal Processing Theory and Applications

ENGG 1203 Tutorial. Difference Equations. Find the Pole(s) Finding Equations and Poles

Hadamard Exponential Hankel Matrix, Its Eigenvalues and Some Norms

VI. FIR digital filters

How many neutrino species?

EC1305 SIGNALS & SYSTEMS

(looks like a time sequence) i function of ˆ ω (looks like a transform) 2. Interpretations of X ( e ) DFT View OLA implementation

The Discrete-Time Fourier Transform (DTFT)

ω (argument or phase)

Class #24 Monday, April 16, φ φ φ

An Introduction to Asymptotic Expansions

2617 Mark Scheme June 2005 Mark Scheme 2617 June 2005

ASSERTION AND REASON

Ordinary Differential Equations

CHAPTER 6c. NUMERICAL INTERPOLATION

Slide 1. Slide 2. Slide 3 DIGITAL SIGNAL PROCESSING CLASSIFICATION OF SIGNALS

Ordinary Differential Equations

Systems in Transform Domain Frequency Response Transfer Function Introduction to Filters

SIGNALS AND LINEAR SYSTEMS UNIT-1 SIGNALS

Fractional Sampling using the Asynchronous Shah with application to LINEAR PHASE FIR FILTER DESIGN

Section 11.6: Directional Derivatives and the Gradient Vector

Figure 2-18 Thevenin Equivalent Circuit of a Noisy Resistor

EEO 401 Digital Signal Processing Prof. Mark Fowler

COLLECTION OF SUPPLEMENTARY PROBLEMS CALCULUS II

Restricted Factorial And A Remark On The Reduced Residue Classes

(Reference: sections in Silberberg 5 th ed.)

Continuous-Time Fourier Transform. Transform. Transform. Transform. Transform. Transform. Definition The CTFT of a continuoustime

Discrete Fourier Series and Transforms

SECTION where P (cos θ, sin θ) and Q(cos θ, sin θ) are polynomials in cos θ and sin θ, provided Q is never equal to zero.

Part B: Transform Methods. Professor E. Ambikairajah UNSW, Australia

The Matrix Exponential

1973 AP Calculus BC: Section I

Solution to 1223 The Evil Warden.

They must have different numbers of electrons orbiting their nuclei. They must have the same number of neutrons in their nuclei.

Normal Form for Systems with Linear Part N 3(n)

Narayana IIT Academy

g () n = g () n () f, f n = f () n () x ( n =1,2,3, ) j 1 + j 2 + +nj n = n +2j j n = r & j 1 j 1, j 2, j 3, j 4 = ( 4, 0, 0, 0) f 4 f 3 3!

The Matrix Exponential

Law of large numbers

Comparison of Simple Indicator Kriging, DMPE, Full MV Approach for Categorical Random Variable Simulation

CHAPTER 6d. NUMERICAL INTERPOLATION

Calculus & analytic geometry

ENGI 3424 Appendix Formulæ Page A-01

Department of Mathematics and Statistics Indian Institute of Technology Kanpur MSO202A/MSO202 Assignment 3 Solutions Introduction To Complex Analysis

Transcription:

Discrt Fourir Trasorm DFT Major: All Egirig Majors Authors: Duc guy http://umricalmthods.g.us.du umrical Mthods or STEM udrgraduats 8/3/29 http://umricalmthods.g.us.du

Discrt Fourir Trasorm Rcalld th xpotial orm o Fourir sris s Eqs. 26, 28 i h.., o gts: t iw T T t t iw t dt I tim t is discrtizd at th Eq. 26 bcoms: t iw t 26, rpatd 28, rpatd t t, t2 2t, t3 3t,..., t t, 2 http://umricalmthods.g.us.du

Discrt Fourir Trasorm cot. To simpliy th otatio, di: t Th, Eq. 2 ca b writt as: iw ilw Multiplyig both sids o Eq. 3 by, ad prormig th summatio o, o obtais ot: l = itgr umbr ilw iw ilw 2 i l 2 3 4 5 3 http://umricalmthods.g.us.du

Discrt Fourir Trasorm cot. Switchig th ordr o summatios o th right-had-sid o Eq.5, o obtais: 2 2 l i il 6 Di: 2 l i A 7 Thr ar 2 possibilitis or to b cosidrd i Eq. 7 l http://umricalmthods.g.us.du 4

Discrt Fourir Trasorm as as: l is a multipl itgr o, such as: l m ; or m whr m,, 2,... Thus, Eq. 7 bcoms: A Hc: A im2 cos m2 i si m2 8 9 5 http://umricalmthods.g.us.du

Discrt Fourir Trasorm as 2 as2: l is OT a multipl itgr o. I this cas, rom Eq. 7 o has: A Di: a 2 i l i l 2 cos 2 l isi 2 l a ; bcaus l is OT a multipl itgr o Th, Eq. ca b xprssd as: A a 2 6 http://umricalmthods.g.us.du

Discrt Fourir Trasorm as 2 From mathmatical hadboos, th right sid o Eq. 2 rprsts th gomtric sris, ad ca b xprssd as: A a ; i a a ; i a a Bcaus o Eq., hc Eq. 4 should b usd to comput A. Thus: a A a i l2 cos i l a 2 3 4 S Eq. 5 l2 i si l2 6 7 http://umricalmthods.g.us.du

Discrt Fourir Trasorm as 2 Substitutig Eq. 6 ito Eq. 5, o gts A 7 Thus, combiig th rsults o cas ad cas 2, w gt A Substitutig Eq.8 ito Eq.7, ad th rrrig to Eq.6, o gts: ilw 8 8A Rcall l m whr l, m ar itgr umbrs, ad sic must b i th rag, m=. Thus: l m bcoms l 8 http://umricalmthods.g.us.du

Discrt Fourir Trasorm as 2 Eq. 8A ca, thror, b simpliid to l ilw 8B Thus: si cos iw lw i lw 9 whr t ad si cos iw w i w, rpatd http://umricalmthods.g.us.du 9

Aliasig Phomo, yquist sampls, yquist rat Wh a uctio t, which may rprst th sigals rom som ral-li phomo show i Figur, is sampld, it basically covrts that uctio ito a squc at discrt locatios o t. Figur Fuctio to b sampld ad Aliasd sampl problm. http://umricalmthods.g.us.du

Aliasig Phomo, yquist sampls, yquist rat cot. Thus, rprsts th valu o t at t t t, whr t is th locatio o th irst sampl at. I Figur, th sampls hav b ta with a airly larg t. Thus, ths squc o discrt data will ot b abl to rcovr th origial sigal uctio t. For xampl, i all discrt valus o t wr coctd by picwis liar ashio, th a arly horizotal straight li will occur btw through ad through rspctivly S Figur. t 9 t 2 t t 8 http://umricalmthods.g.us.du

Aliasig Phomo, yquist sampls, yquist rat cot. Ths picwis liar itrpolatio or othr itrpolatio schms will OT produc a curv which closly rsmbls th origial uctio t. This is th cas whr th data has b ALIASED. 2 http://umricalmthods.g.us.du

Widowig phomo Aothr pottial diiculty i samplig th uctio is calld widowig problm. As idicatd i Figur 2, whil t is small ough so that a picwis liar itrpolatio or coctig ths discrt valus will adquatly rsmbl th origial uctio t, howvr, oly a portio o th uctio has b sampld rom t through t 7 rathr tha th tir o. I othr words, o has placd a widow ovr th uctio. 3 http://umricalmthods.g.us.du

Widowig phomo cot. Figur 2. Fuctio to b sampld ad widowig sampl problm. 4 http://umricalmthods.g.us.du

Widowig phomo cot. Figur 3. Frqucy o samplig rat w S vrsus maximum rqucy cott w. max I ordr to satisy F w or w wmax th rqucy w should b btw poits A ad B o Figur 3. 5 http://umricalmthods.g.us.du

Hc: Widowig phomo cot. w max w w s w max which implis: w s 2w max Physically, th abov quatio stats that o must hav at last 2 sampls pr cycl o th highst rqucy compot prst yquist sampls, yquist rat. 6 http://umricalmthods.g.us.du

Widowig phomo cot. Figur 4. orrctly rcostructd sigal. 7 http://umricalmthods.g.us.du

Widowig phomo cot. I Figur 4, a siusoidal sigal is sampld at th rat o 6 sampls pr cycl or w s 6w. Sic this samplig rat dos satisy th samplig thorm rquirmt o w s 2w max, th rcostructd sigal dos corrctly rprst th origial sigal. 8 http://umricalmthods.g.us.du

Widowig phomo cot. I Figur 5 a siusoidal sigal is sampld at th rat 6 o 6 sampls pr 4 cycls or w s w Sic this samplig rat dos OT satisy th rquirmt w s 2w max, th rcostructd sigal was wrogly rprst th origial sigal! 4 Figur 5. Wrogly rcostructd sigal. 9 http://umricalmthods.g.us.du

Discrt Fourir Trasorm cot. Equatios 9 ad ca b rwritt as 2 w i 2 2 w i 2 To avoid computatio with complx umbrs, Equatio 2 ca b xprssd as si cos I R I R i i i 2A whr w 2 http://umricalmthods.g.us.du 2

Discrt Fourir Trasorm cot. R I i R I I R cos si i cos si Th abov complx umbr quatio is quivalt to th ollowig 2 ral umbr quatios: R I I R cos cos R I si si 2B 2 2D 2 http://umricalmthods.g.us.du