DFT: Discrete Fourier Transform

Similar documents
[ ] [ ] DFT: Discrete Fourier Transform ( ) ( ) ( ) ( ) Congruence (Integer modulo m) N-point signal

Lectures 9 IIR Systems: First Order System

Digital Signal Processing, Fall 2006

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

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

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

Discrete Fourier Transform (DFT)

Worksheet: Taylor Series, Lagrange Error Bound ilearnmath.net

Hadamard Exponential Hankel Matrix, Its Eigenvalues and Some Norms

Discrete Fourier Transform. Nuno Vasconcelos UCSD

PURE MATHEMATICS A-LEVEL PAPER 1

Problem Value Score Earned No/Wrong Rec -3 Total

The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function

Classification of DT signals

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

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

SOLVED EXAMPLES. Ex.1 If f(x) = , then. is equal to- Ex.5. f(x) equals - (A) 2 (B) 1/2 (C) 0 (D) 1 (A) 1 (B) 2. (D) Does not exist = [2(1 h)+1]= 3

1985 AP Calculus BC: Section I

Practical Spectral Anaysis (continue) (from Boaz Porat s book) Frequency Measurement

Frequency Response & Digital Filters

EEO 401 Digital Signal Processing Prof. Mark Fowler

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

ELEC9721: Digital Signal Processing Theory and Applications

H2 Mathematics Arithmetic & Geometric Series ( )

In number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.

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

DIGITAL SIGNAL PROCESSING BEG 433 EC

ELCE5180 Digital Signal Processing

Linear time invariant systems

A. Basics of Discrete Fourier Transform

Thomas J. Osler. 1. INTRODUCTION. This paper gives another proof for the remarkable simple

Narayana IIT Academy

[ 47 ] then T ( m ) is true for all n a. 2. The greatest integer function : [ ] is defined by selling [ x]

Definition of z-transform.

Chapter 4 - The Fourier Series

NET/JRF, GATE, IIT JAM, JEST, TIFR

EEO 401 Digital Signal Processing Prof. Mark Fowler

The z-transform. Dept. of Electronics Eng. -1- DH26029 Signals and Systems

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.

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations

DIGITAL SIGNAL PROCESSING LECTURE 3

Generalizing the DTFT. The z Transform. Complex Exponential Excitation. The Transfer Function. Systems Described by Difference Equations

Web Appendix O - Derivations of the Properties of the z Transform

Signals and Systems. Problem Set: From Continuous-Time to Discrete-Time

Analog and Digital Signals. Introduction to Digital Signal Processing. Discrete-time Sinusoids. Analog and Digital Signals

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

Signals & Systems Chapter3

Chapter 3 Fourier Series Representation of Periodic Signals

+ x. x 2x. 12. dx. 24. dx + 1)

EECE 301 Signals & Systems

(Reference: sections in Silberberg 5 th ed.)

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

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,

EE Midterm Test 1 - Solutions

2D DSP Basics: 2D Systems

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

Solution to 1223 The Evil Warden.

SCHUR S THEOREM REU SUMMER 2005

1 Generating functions for balls in boxes

COMM 602: Digital Signal Processing

10. The Discrete-Time Fourier Transform (DTFT)

M2.The Z-Transform and its Properties

Windowing in FIR Filter Design. Design Summary and Examples

Complex Numbers Solutions

Lecture 2 Linear and Time Invariant Systems

EE123 Digital Signal Processing

Z Transforms. Lesson 20 6DT. BME 333 Biomedical Signals and Systems - J.Schesser

Chapter (8) Estimation and Confedence Intervals Examples

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

Finite-length Discrete Transforms. Chapter 5, Sections

The Matrix Exponential

A Simple Proof that e is Irrational

Solutions of Chapter 5 Part 1/2

The Matrix Exponential

x 2 a mod m. has a solution. Theorem 13.2 (Euler s Criterion). Let p be an odd prime. The congruence x 2 1 mod p,

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

The multiplicative structure of finite field and a construction of LRC

Chapter 8. DFT : The Discrete Fourier Transform

Chapter 7: The z-transform. Chih-Wei Liu

Series: Infinite Sums

YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE

Discrete-Time Signals and Systems. Signals and Systems. Digital Signals. Discrete-Time Signals. Operations on Sequences: Basic Operations

FIR Filter Design: Part II

Discrete Fourier Series and Transforms

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

The Structure of Z p when p is Prime

10. Joint Moments and Joint Characteristic Functions

Fall 2011, EE123 Digital Signal Processing

Putnam Training Exercise Counting, Probability, Pigeonhole Principle (Answers)

The Discrete Fourier Transform

Notations. Primary definition. Specific values. Traditional name. Traditional notation. Mathematica StandardForm notation. Specialized values

VI. FIR digital filters

EC1305 SIGNALS & SYSTEMS

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

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution

Lecture 3. Digital Signal Processing. Chapter 3. z-transforms. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev. 2016

The Z-Transform. Content and Figures are from Discrete-Time Signal Processing, 2e by Oppenheim, Shafer, and Buck, Prentice Hall Inc.

INCOMPLETE KLOOSTERMAN SUMS AND MULTIPLICATIVE INVERSES IN SHORT INTERVALS. xy 1 (mod p), (x, y) I (j)

ln x = n e = 20 (nearest integer)

Transcription:

: Discrt Fourir Trasform Cogruc (Itgr modulo m) I this sctio, all lttrs stad for itgrs. gcd m, = th gratst commo divisor of ad m Lt d = gcd(,m) All th liar combiatios r s m of ad m ar multils of d. a b a is a divisor of b. I a xrssio mod m, m is a strictly ositiv itgr. a b mod m m b If a bmod m th c d mod m a a c b d mod m a c b d mod m a c b d mod m a b mod m with a b mod m m mmod m r for uiqu r that ma m r -oit sigal x[]: -oit sigal Has fiit duratio Duratio itrval [,) Cyclic shift of x[] by ; < ; : = x ; x x ; ; othrwis Dr.Prau Susomog x Examl is aothr -oit sigal

= 5 - - 3 4 5 6 7 x[] a b c d x 5 d a b c -oit circular covolutio of -oit sigal x [] x [] = x mx m x m x m m m x m x m x m x m x m x m m m m x x x x If x [m] has may s, us mx m that is multilid by x m Examl: = 3 Lt y[] = x [] x [] x x x x x, limiatig ach of x m m y x m x m x x x x x x 3 3 3 m x x x x x x x x x x x x x x x x x x y x x x x x 3 x 3 y x x x x x x 3 3 y x x x x x x 3 3 To fid x [] x [] usig circular covolutio rul ˆ X x x x x x A x A 3 3

x x x x x A x A 3 3 Th multilicatio ca b asily fid with TI calculator or athcad (slct A, th choos Symbolics > Polyomial Cofficits): x x x x xx 3 4 X ˆ A A A A x x xx x x xx x x x x But 3 4 A, A A ; thrfor, xx xx xx A A xx xx xx. x x xx xx Obviously (actually from ivrs ), Examl: x [] = 3, x [] = y x x xx x x y x x xx x x. y x x xx x x 3 3 3 4 4 4 4 4 4 x [] x [] = 6 5 8 3 3 8 8 3 3 4 5 6 4 4 4 4 4 4 6 5 8 3 4 4 4 j mod For v, j 3

4 m othrwis j j j j j mod ; if ; if j I I ; if ; if j j I I q q ;,q 4

q q q q m q m q ; q q ; q q I -oit of th -oit sigal x[]: ˆ ˆ X X x ; j x x ; x x ˆ X x x ˆ 4 X x x ˆ x X x ˆ ˆ x X X x x x x x ; x X ˆ * x x X ˆ Giv tool for comutig 5

Tim rvrs x Aftr -fidr g[q] = ˆ X, q Tim rvrs: g[-q] = ˆ q X ˆ X DTFT x x x x x x x ; < x q ; ; ; othrwis Circular covolutio rul: x [] x [] x m x m x m x m m m m x m m 6

To us to comut rgular covolutios of tim-limitd (fiit-duratio) sigal: If x [] has duratio itrval < x [] has duratio itrval < Lt = + -, th x []*x [] = x [] To s this, x [] for < ad = othrwis x []*x [] has fiit duratio at most = + - Thi of x [] ad x [] as -oit sigal whos last valus ar (-addig) Bloc covolutio h[] has duratio itrval < P (imuls rsos of a causal FIR systm) w[] = a (ossibly) ifiit-duratio sigal To comut h[]*w[] Divid w[] ito blocs of som scific lgth L (tyically L >> P) w rl ; L w r duratio itrval < L ; othrwis r w[] = w rl, r y r [] = h[] * w r [] duratio itrval < P + L - Fid y r [] by (P+L )-oit circular covolutio r r h[] * w[] = y rl, h* w h* wr rl h* wr rl r r r y rl ot that h w rl y rl covolutio. * r r r from th tim-ivariac rorty of y [] y [-L] P- L P+L- L P+L- 7

Frqucy-samlig aroximatio of h[] To aroximat h[]: Samlig Ĥ at ; < by j h yild Us () -, h ~ Hˆ H ~ˆ j Hˆ Hˆ j Hˆ H ~ˆ r Hˆ ˆ r r h ; < r h ~ h r ˆ y x r Y X ˆ ˆ h H H hm m jm j j m hm m othrwis ; if I j ; if I m j m ; if I m ; if I hm h m m I So, th summatio oly iclud m of th form m r ; r I 8

Thus, h h r r ˆ h h r H H r : ˆ j First, ot that ˆ H h h. ˆ H h h r r r h r Substitut r r r r r r r r r Hˆ h h ot that r r x x x. r r r r ˆ H h H. Thus, ˆ Tim-aliasig If h[] has duratio itrval cotaid i <, h ~ = h[] ; < Examl: if h[] is a ()-oit sigal 9

j ˆ H h h h h h h h h h h h h h h ; So, h ~ = h[] ; < iff h[] = for (o foldig) Widowig a sigal to gt a aroximatio of Giv x[] - < < x[ ] Loo at y[] = x[] L [] = ; L L ; L Fid Yˆ si L si d (lgth = L- = ) L Zros @ si L ; L L DTFT ; L si L = L- @ d width of s fatur > 4 L If L, lim DTFT, ad Ŷ L L

Lots of shar activity i d biggr Giv x[] ; < Ca us -oit s to fid r by lt y[] = x, th Yˆ oly for = = r ; ; r I j x x x r r x x r x Lt x[] b a sigal of duratio. If alrady hav tool for -oit s. Ca fid To do this, Lt q[] = for = +, by costructig y[] so Y j Qˆ Yˆ Q, Wat ˆ x[], th ˆ Q ad From ˆ y[] ˆ. ˆ y x r Y X, so d r r q r othrwis ot that ot all r s ar usd. oly os that satisfy < +r < r < r, but <. So, - < r <