Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is

Similar documents
Complex symmetry Signals and Systems Fall 2015

Definition of Discrete-Time Fourier Transform (DTFT)

Discrete-Time Fourier Transform (DTFT)

Discrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz

Discrete Time Fourier Transform

Overview of Discrete-Time Fourier Transform Topics Handy Equations Handy Limits Orthogonality Defined orthogonal

Discrete Time Fourier Transform (DTFT)

Digital Signal Processing Lecture 3 - Discrete-Time Systems

Fourier transform representation of CT aperiodic signals Section 4.1

Signals and Systems Spring 2004 Lecture #9

The Discrete-Time Fourier

Chap 2. Discrete-Time Signals and Systems

Review of Discrete-Time System

ECE-314 Fall 2012 Review Questions for Midterm Examination II

Discrete Fourier Transform

EE 224 Signals and Systems I Review 1/10

Lecture 13: Discrete Time Fourier Transform (DTFT)

DSP Laboratory (EELE 4110) Lab#5 DTFS & DTFT

Frequency-Domain C/S of LTI Systems

ECE 301. Division 2, Fall 2006 Instructor: Mimi Boutin Midterm Examination 3

Discrete-time Signals and Systems in

Signals and Systems Profs. Byron Yu and Pulkit Grover Fall Midterm 2 Solutions

Table 1: Properties of the Continuous-Time Fourier Series. Property Periodic Signal Fourier Series Coefficients

8 The Discrete Fourier Transform (DFT)

EC Signals and Systems

Lecture 19: Discrete Fourier Series

Review of Fundamentals of Digital Signal Processing

Multimedia Signals and Systems - Audio and Video. Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2

DSP-I DSP-I DSP-I DSP-I

Table 1: Properties of the Continuous-Time Fourier Series. Property Periodic Signal Fourier Series Coefficients

-Digital Signal Processing- FIR Filter Design. Lecture May-16

6.003 Signal Processing

Ch 4: The Continuous-Time Fourier Transform

5.1 The Discrete Time Fourier Transform

Signals & Systems. Lecture 5 Continuous-Time Fourier Transform. Alp Ertürk

6.003 Signal Processing

Lecture 10. Digital Signal Processing. Chapter 7. Discrete Fourier transform DFT. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev.

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

Aspects of Continuous- and Discrete-Time Signals and Systems

Digital Signal Processing. Midterm 1 Solution

Chapter 7: The z-transform

Review of Fundamentals of Digital Signal Processing

PS403 - Digital Signal processing

x[n] = x a (nt ) x a (t)e jωt dt while the discrete time signal x[n] has the discrete-time Fourier transform x[n]e jωn

Signals and Systems. Problem Set: The z-transform and DT Fourier Transform

Discrete Fourier transform (DFT)

ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin

Chapter 4 The Fourier Series and Fourier Transform

Chapter 5. Fourier Analysis for Discrete-Time Signals and Systems Chapter

University Question Paper Solution

Chapter 4 The Fourier Series and Fourier Transform

Signals and Systems Lecture 8: Z Transform

Discrete Time Systems

Your solutions for time-domain waveforms should all be expressed as real-valued functions.

6.003 Homework #10 Solutions

Fourier Analysis Overview (0B)

ECE 301 Division 1, Fall 2008 Instructor: Mimi Boutin Final Examination Instructions:

Homework 8 Solutions

EEE4001F EXAM DIGITAL SIGNAL PROCESSING. University of Cape Town Department of Electrical Engineering PART A. June hours.

Signals & Systems Handout #4

The Discrete-time Fourier Transform

ECE 301 Division 1, Fall 2006 Instructor: Mimi Boutin Final Examination

UNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything.

Very useful for designing and analyzing signal processing systems

Fourier Analysis and Spectral Representation of Signals

信號與系統 Signals and Systems

Grades will be determined by the correctness of your answers (explanations are not required).

Lecture 4: FT Pairs, Random Signals and z-transform

TTT4120 Digital Signal Processing Suggested Solutions for Problem Set 2

Flash File. Module 3 : Sampling and Reconstruction Lecture 28 : Discrete time Fourier transform and its Properties. Objectives: Scope of this Lecture:

Z-Transform. The Z-transform is the Discrete-Time counterpart of the Laplace Transform. Laplace : G(s) = g(t)e st dt. Z : G(z) =

ECE 301. Division 3, Fall 2007 Instructor: Mimi Boutin Midterm Examination 3

Continuous-Time Fourier Transform

EE 438 Essential Definitions and Relations

Ver 3808 E1.10 Fourier Series and Transforms (2014) E1.10 Fourier Series and Transforms. Problem Sheet 1 (Lecture 1)

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

6.003: Signals and Systems

Sinc Functions. Continuous-Time Rectangular Pulse

X (z) = n= 1. Ã! X (z) x [n] X (z) = Z fx [n]g x [n] = Z 1 fx (z)g. r n x [n] ª e jnω

6.003: Signals and Systems. Relations among Fourier Representations

Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding

Fourier Representations of Signals & LTI Systems

ECE-700 Review. Phil Schniter. January 5, x c (t)e jωt dt, x[n]z n, Denoting a transform pair by x[n] X(z), some useful properties are

Fourier Analysis and Spectral Representation of Signals

LTI Discrete-Time Systems in Transform Domain Ideal Filters Zero Phase Transfer Functions Linear Phase Transfer Functions

Transform Analysis of Linear Time-Invariant Systems

Final Exam of ECE301, Section 3 (CRN ) 8 10am, Wednesday, December 13, 2017, Hiler Thtr.

Digital Signal Processing Lecture 9 - Design of Digital Filters - FIR

Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding

summable Necessary and sufficient for BIBO stability of an LTI system. Also see poles.

EEL3135: Homework #4

3.2 Complex Sinusoids and Frequency Response of LTI Systems

Digital Filters Ying Sun

EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 19, Cover Sheet

Fourier Series and Fourier Transforms

EE 3054: Signals, Systems, and Transforms Summer It is observed of some continuous-time LTI system that the input signal.

Chapter 5 Frequency Domain Analysis of Systems

Stability Condition in Terms of the Pole Locations

Multidimensional digital signal processing

Transcription:

Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section 5. 3 The (DT) Fourier transform (or spectrum) of x[n] is X ( e jω) = n= x[n]e jωn x[n] can be reconstructed from its spectrum using the inverse Fourier transform x[n] = X ( e jω) e jωn dω The above two equations are referred to as the analysis equation and the synthesis equation respectively. 3 These slides are based on lecture notes of Professors L. Lampe, C. Leung, and R. Schober SM 38

Notation: X ( e jω) = F{x[n]} x[n] = F {X ( e jω) } x[n] and X ( e jω) form a Fourier transform pair, denoted by x[n] X ( e jω) Main differences from CTFT. X ( e jω) is periodic with period since e jωn is periodic in ω with period. 2. As a result of the above-mentioned periodicity, the integration for the synthesis equation is over a finite interval (of length ). SM 39

Example: Determine the DTFT of h[n] = a n u[n], a <. Then, H ( e jω) = = = n= n= a n e jωn ( a e jω ) n a e jω Hence, H ( e jω) = = ( acosω)2 +(asinω) 2 2acosω +a 2 A plot of H ( e jω) for a =.5 is shown in the figure below. SM 4

H e jω ( ) ----------- = 2 a π Since H ( e jω) = and = = ----------- = + a 2 -- 3 a e jω a ejω a e jω a e jω a e jω 2acosω +a 2 a e jω = acosω jasinω π ω we have H ( e jω) asinω = tan acosω SM 4

Example: Determine the DTFT of the rectangular pulse x[n] = {, n N, otherwise. Then, X ( e jω) = = N e jωn n= N 2N e jω(m N) m= (using m = n+n) = ejωn ( e jω(2n+)) e jω = e jωn e jω(n+ 2 ) { e jω(n+ 2 ) e jω(n+ 2 ) } e jω 2 { e j ω 2 e jω 2} {e jω(n+ 2 ) e jω(n+ 2 ) } = { e j ω 2 e jω 2} SM 42

= 2jsin[ ω ( )] N + 2 2jsin[ω/2] = sin[ ω ( )] N + 2 sin[ω/2] For N =, X ( e jω) = sin[ ω + ω 2 sin [ ] ω 2 = sinωcos ω 2 +cosωsin ω 2 sin ω 2 ] = 2sin ω 2 cos ω 2 cos ω 2 +cosωsin ω 2 sin ω 2 = 2cos 2 ω 2 +cosω = +2cosω Sketch X ( e jω) for N = in the figure below. SM 43

x[ n] 6 4 2 2 4 6 n X( e jω ) 3 2 π π ω DTFT convergence issues Recall the DTFT analysis and synthesis equations X ( e jω) = n= x[n]e jωn (4) x[n] = X ( e jω) e jωn dω (5) SM 44

The analysis equation (4) contains an infinite sum. Sufficient conditions to guarantee convergence are: () x[n] is absolutely summable, i.e. n= x[n] < or (2) x[n] has finite energy, i.e. n= x[n] 2 < There are no convergence issues associated with the synthesis equation (5) since the integral is over a finite interval. For example, unlike the CTFT case, the Gibbs phenomenon is absent when (5) is used. SM 45

DTFT for periodic signals Section 5.2 Similar to the CT case, we can express the FT of DT periodic signals in terms of impulses. It can be shown (see (5.9) and (5.2) in textbook) that if the DT periodic signal x[n] of fundamental period N has as DTFS coefficients a k, i.e. x[n] = k=<n> a k e jk ( N)n then X ( e jω) = k= a k δ ( ω k ). (6) N Furthermore, if we define x[n] as one basic period of x[n], it can be shown that a k = N X (e jk N ). SM 46

In words, (6) states that the DTFT of x[n] is a sequence of impulses located at multiples of the fundamental frequency N ; the strength of the impulse located at ω = k N is a k. Example: x[n] = cos(ω n), where ω = 3. cos-----n 3 6 4 2 2 4 6 n { cosω n} π ω ω ω cosω n = 2 ejω n + 2 e jω n SM 47

Fact: e jω n l= δ(ω ω l) Proof: The inverse DTFT of the RHS is = l= = e jω n. l= [ δ(ω ω l)e jωn dω ] δ(ω ω l)e jωn dω The last line follows since only one impulse is included in any interval of length. Hence, cos 3 n π + l= l= δ (ω 3 ) l δ (ω + 3 ) l SM 48

Exercise: Show that sin 3 n π j δ (ω 3 ) l l= δ (ω + 3 ) l l= Plot sin ( 3 n) and its DTFT in the figures below. sin----- n 3 6 4 2 2 4 6 n { sin ω n} ω ω ω SM 49

Example: Determine the DTFT of the impulse train x[n] = k= δ[n kn]. Then, a k = N n=<n> x[n] e jk ( N)n = N and from (6), we have X ( e jω) = N k= δ ( ω k ). N SM 5

Some properties of the DTFT Sections 5.3-5.7. Periodicity Section 5.3. The DTFT is always periodic in ω with period, i.e. X (e j(ω+)) = X ( e jω) In contrast, the CTFT is not generally periodic. 2. Linearity Section 5.3.2 similar to CTFT Let x[n] X ( e jω), y[n] Y ( e jω). Then, Z z[n] = ax[n] + by[n] ( e jω) ( = ax e jω) + by (e jω) SM 5

Proof: follows directly from the defn. of the DTFT. Example: What is the DTFT of the signal, z[n], shown below? z[ n] 2 4 2 2 4 n SM 52

3. Time-shift Section 5.3.3 similar to CTFT If x[n] X ( e jω), then Proof: x[n N] e jωn X ( e jω). Note that when a signal is delayed by N, the spectrum amplitude is unchanged whereas the spectrum phase is changed by ωn. SM 53

Example: What are the DTFT s of the signals shown below? x [ n] 2 4 2 2 4 n x 2 [ n] 4 2 2 2 4 n SM 54

4. Conjugation Section 5.3.4 similar to CTFT If x[n] X ( e jω), then Proof: x [n] X ( e jω). As a result, if x[n] is real, we have X ( e jω) = X ( e jω) i.e., the spectrum magnitude is an even function of ω and the spectrum phase is an odd function of ω. SM 55

5. Differencing and Accumulation Section 5.3.5 Differencing: Using the linearity and timeshift properties, if x[n] X ( e jω), then the DTFT of the first difference signal is given by x[n] x[n ] ( e jω) X ( e jω). Accumulation: Let y[n] = n m= x[m]. Then, Y ( e jω) = X( e jω) e jω +πx ( e j) k= δ(ω k). SM 56

Example: Determine the DTFT of the unit step sequence u[n] = {, n <, n. u[ n] 4 2 2 4 n SM 57

6. Parseval s relation Section 5.3.9 similar to CTFT If x[n] X ( e jω), then n= x[n] 2 = X ( e jω) 2 dω. (7) The LHS of (7) represents the total energy in the signal x[n]. The integrand, X ( e jω) 2, in the RHS is the energy density spectrum of x[n]. SM 58

7. Convolution Section 5.4 similar to CTFT If y[n] = x[n] h[n] then Y ( e jω) = X ( e jω) H ( e jω). Proof: SM 59

Example: Determine the convolution of the DT signals x[n] and h[n] shown below. x[ n] 2 4 2 2 4 h[ n] n 4 2 2 2 4 n SM 6

8. Multiplication Section 5.5 If y[n] = a[n]b[n] then Y ( e jω) = A ( e jθ) B ( e j(ω θ)) dθ. The RHS of the previous equation is referred to as the periodic convolution of A ( e jω) and B ( e jω). Proof: SM 6