0% found this document useful (0 votes)
23 views6 pages

Lecture 5

Uploaded by

Ed Castro
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
23 views6 pages

Lecture 5

Uploaded by

Ed Castro
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 6

Discrete-Time Fourier Transform

Quote of the Day


The profound study of nature is the most fertile
source of mathematical discoveries.

Joseph Fourier

Content and Figures are from Discrete-Time Signal Processing, 2e by Oppenheim, Shafer, and Buck, ©1999-2000 Prentice Hall Inc.
Frequency Response
• The frequency response defines a systems output
– for complex exponential at all frequencies
• If input signals can be represented as a sum of complex
exponentials
xn   k
 e jkn

– we can determine the output of the system

yn   k
 H e jk
e jkn
 
k
• Different from continuous-time frequency response
– Discrete-time frequency response is periodic with 2

    hk e
  
He j  2 r 

k  
 j  2 r k
  hk e
k  
 j2 rk
e  j k
  hk
k  

e  j k

 
H e j  2 r   H e j  
Copyright (C) 2005 Güne 351M Digital Signal Processing 2
r Arslan
Discrete-Time Fourier Transform
• Many sequences can be expressed as a weighted sum of
complex exponentials as
xn 
1 
2  
X e j
e jn
 
d (inverse transform)

• Where the weighting is determined as


    xne

j  jn
Xe (forward transform)
n  

• X(ej) is the Fourier spectrum of the sequence x[n]


– It specifies the magnitude and phase of the sequence
– The phase wraps at 2 hence is not uniquely specified
• The frequency response of a LTI system is the DTFT of the
impulse response

    hk e 1 
 

He j  j k
and hn   H e j
e jn
d
k   2  

Copyright (C) 2005 Güne 351M Digital Signal Processing 3


r Arslan
Discrete-Time Fourier Transform Pair
    xne 1 
 

Xe j  j n
and xn   X e j
e j n
d
n   2  

• Let’s show that they constitute a transform pair


– Substitute first equation into second to get
1     j m  j n

 1  jn  m  
x̂n   
  xme e d   xm  e d 
2  m  
 
 m    2  

– Evaluate the integral
 sinn  m
1  jn  m    0 for n  m
 n  m
2  
e d  
 1 for n  m
 n  m

– Substitute the integral with this result to get



x̂n   xmn  m  xn
m  
Copyright (C) 2005 Güne 351M Digital Signal Processing 4
r Arslan
Existence of DTFT
• For a given sequence the DTFT exist if the infinite sum
convergence

    xne

j  j n
Xe
n  

• Or
 
X e j   for all 

    xne
  
Xe j

n  
 j n
  xn e
n  
 jn
  xn  
n  

• So the DTFT exists if a given sequence is absolute summable


• All stable systems are absolute summable and have DTFTs

Copyright (C) 2005 Güne 351M Digital Signal Processing 5


r Arslan
DTFT Demo

Square Wave

Triangular Wave

From Fundamentals of Signals and Systems Using the Web and Matlab
by Edward W. Kamen and Bonnie S. Heck

Copyright (C) 2005 Güne 351M Digital Signal Processing 6


r Arslan

You might also like