The Discrete-Time Fourier Transform (DTFT)

Similar documents
FIR Filter Design: Part I

Frequency Response of FIR Filters

FIR Filter Design: Part II

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

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

6.3 Testing Series With Positive Terms

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

EE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course

Chapter 10: Power Series

Infinite Sequences and Series

Chapter 4. Fourier Series

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

Chapter 8. DFT : The Discrete Fourier Transform

A. Basics of Discrete Fourier Transform

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

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

Module 18 Discrete Time Signals and Z-Transforms Objective: Introduction : Description: Discrete Time Signal representation

Finite-length Discrete Transforms. Chapter 5, Sections

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

Introduction to Extreme Value Theory Laurens de Haan, ISM Japan, Erasmus University Rotterdam, NL University of Lisbon, PT

Chapter 6 Infinite Series

subcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016

Definition of z-transform.

Statistics 511 Additional Materials

Chapter 8. Euler s Gamma function

ELEG3503 Introduction to Digital Signal Processing

Recurrence Relations

Chapter 7 z-transform

Ma 530 Introduction to Power Series

The Riemann Zeta Function

Discrete-time Fourier transform (DTFT) of aperiodic and periodic signals

Additional Notes on Power Series

Polynomial Generalizations and Combinatorial Interpretations for Sequences Including the Fibonacci and Pell Numbers

INFINITE SEQUENCES AND SERIES

Section 11.8: Power Series

CHAPTER 10 INFINITE SEQUENCES AND SERIES

Lecture 11. Solution of Nonlinear Equations - III

Introduction to Signals and Systems, Part V: Lecture Summary

Math 113 Exam 3 Practice

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

Mathematical Description of Discrete-Time Signals. 9/10/16 M. J. Roberts - All Rights Reserved 1

Dirichlet s Theorem on Arithmetic Progressions

A NUMERICAL METHOD OF SOLVING CAUCHY PROBLEM FOR DIFFERENTIAL EQUATIONS BASED ON A LINEAR APPROXIMATION

ECEN 644 HOMEWORK #5 SOLUTION SET

Chapter 8. Euler s Gamma function

lim za n n = z lim a n n.

Fall 2011, EE123 Digital Signal Processing

Topic 9 - Taylor and MacLaurin Series

Representing Functions as Power Series. 3 n ...

(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 31B: MIDTERM 2 REVIEW

2D DSP Basics: 2D Systems

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

Euler-MacLaurin using the ZETA-matrix

Complex Numbers Solutions

Comparison Study of Series Approximation. and Convergence between Chebyshev. and Legendre Series

Frequency Domain Filtering

Signal Processing in Mechatronics. Lecture 3, Convolution, Fourier Series and Fourier Transform

2.4 Sequences, Sequences of Sets

4x 2. (n+1) x 3 n+1. = lim. 4x 2 n+1 n3 n. n 4x 2 = lim = 3

Linear time invariant systems

ENGI Series Page 6-01

MAT1026 Calculus II Basic Convergence Tests for Series

The natural exponential function


7 Sequences of real numbers

We are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n

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

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

Z ß 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

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

Measure and Measurable Functions

This chapter describes different methods to discretize the diffusion equation. f z 2 = 0. y ) x f

CHAPTER 6c. NUMERICAL INTERPOLATION

A PROOF OF THE TWIN PRIME CONJECTURE AND OTHER POSSIBLE APPLICATIONS

1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series.

Math 155 (Lecture 3)

MASSACHUSETTS 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

PLEASE 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)

Honors Calculus Homework 13 Solutions, due 12/8/5

Machine Learning for Data Science (CS 4786)

An Introduction to Randomized Algorithms

Math 113, Calculus II Winter 2007 Final Exam Solutions

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

Fundamental Concepts: Surfaces and Curves

The Z-Transform. (t-t 0 ) Figure 1: Simplified graph of an impulse function. For an impulse, it can be shown that (1)

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

Sequences. Notation. Convergence of a Sequence

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

Beurling Integers: Part 2

ANSWERS SOLUTIONS iiii i. and 1. Thus, we have. i i i. i, A.

Once we have a sequence of numbers, the next thing to do is to sum them up. Given a sequence (a n ) n=1

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

Random Variables, Sampling and Estimation

Vibratory Motion. Prof. Zheng-yi Feng NCHU SWC. National CHung Hsing University, Department of Soil and Water Conservation

A PROCEDURE TO MODIFY THE FREQUENCY AND ENVELOPE CHARACTERISTICS OF EMPIRICAL GREEN'S FUNCTION. Lin LU 1 SUMMARY

Taylor Polynomials and Approximations - Classwork

Abstract Vector Spaces. Abstract Vector Spaces

Appendix to Quicksort Asymptotics

Problem 4: Evaluate ( k ) by negating (actually un-negating) its upper index. Binomial coefficient

Transcription:

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

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

EEL: Discrete-Time Sigals ad Systems The Discrete-Time Fourier Trasorm (DTFT) M 8 Xe ( j ).. - - - - - - 8 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 - -

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

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 () --δ ( + ) + --δ ( ) () - -

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

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 -

EEL: Discrete-Time Sigals ad Systems The Discrete-Time Fourier Trasorm (DTFT). -. - 8 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 -

EEL: Discrete-Time Sigals ad Systems The Discrete-Time Fourier Trasorm (DTFT) - 8 Xe ( j ) - - - - - Xe ( j ) - - - - 8 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 -

EEL: Discrete-Time Sigals ad Systems The Discrete-Time Fourier Trasorm (DTFT) 8 Xe ( j ) π s - - Figure 8.. - - 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. - -

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

EEL: Discrete-Time Sigals ad Systems The Discrete-Time Fourier Trasorm (DTFT) x c () t s.hz - - t. 7... X c (). X s ().... -7. - -.. 7. -7. - -.. 7. DTFT Xe ( j ) π s -7. - -.. 7. Figure - -

EEL: Discrete-Time Sigals ad Systems The Discrete-Time Fourier Trasorm (DTFT) s Hz x c () t - - t. X c (). X s ().... 8 - - DTFT - - Xe ( j ) π s - - Figure - -