Inverse DTFT

Inverse DTFT:

x[n] 
1
2  X e  
j
e jn
d (synthesis equation)
2

    x[n]e

j  jn
X e (analysis equation)
n  

1
 Discrete Fourier Series
• Given a periodic sequence ~x[n] with period N so that
~
x[n]  ~
x[n  rN]

• The Fourier series representation can be written as

~ 1 ~
x[n]   Xk e j 2  / Nkn
N k
• The Fourier series representation of continuous-time periodic
signals require infinite many complex exponentials
• Not that for discrete-time periodic signals we have
e j 2  / N k  mNn  e j 2  / Nkne j 2 mn  e j 2  / N kn
• Due to the periodicity of the complex exponential we only
need N exponentials for discrete time Fourier series
~ 1 N 1 ~
x[n]   Xk e j 2  / Nkn
N k 0

Copyright (C) 2005 Güner Arslan 351M Digital Signal Processing 2

 Discrete Fourier Series Pair
• A periodic sequence in terms of Fourier series coefficients
~ 1 N 1 ~
x[n]   Xk e j 2  / Nkn
N k 0
• The Fourier series coefficients can be obtained via

~ N 1
Xk    ~x[n]e
n0
 j 2  / N  kn

• For convenience we sometimes use

WN  e  j 2  / N
• Analysis equation
~ N 1
~
Xk    x[n]Wkn
N
n0

• Synthesis equation
~ 1 N 1 ~
x[n]   Xk WNkn
N k 0
Copyright (C) 2005 Güner Arslan 351M Digital Signal Processing 3
 Example 1
• DFS of a periodic impulse train
~

1 n  rN
x[n]   n  rN  
r   0 else
• Since the period of the signal is N
~ N 1 N 1
Xk    ~x[n]e j 2 / Nkn 
n0
 [n]e
n0
 j 2  / N  kn
 e  j 2  / N  k 0  1

• We can represent the signal with the DFS coefficients as

~

1 N1 j 2  / Nkn
x[n]   n  rN   e
r   N k 0

Copyright (C) 2005 Güner Arslan 351M Digital Signal Processing 4

 Example 2
• DFS of an periodic rectangular pulse train

• The DFS coefficients

~ 1  e  j 2  / 10 k5  j 4 k / 10  sin k / 2
4
Xk    e  j 2  / 10  kn
 e
n0 1  e  j 2  / 10  k
sin k / 10

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

 Properties of DFS
• Linearity
~ ~
x1 n  DFS
 X1 k 
~ ~
x n
2 DFS
 X2 k 
~ ~
a~
x1 n  b~
x2 n  aX1 k   bX2 k 
DFS
 

• Shift of a Sequence
~ ~
x n DFS
 Xk 
~ ~
x n  m  e  j2 km / NXk 
DFS

j2 nm / N~ ~
e x n  
DFS
 Xk  m

• Duality
~ ~
x n DFS
 Xk 
~
Xn DFS
 N~
x  k

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

 Symmetry Properties

Copyright (C) 2005 Güner Arslan 351M Digital Signal Processing 7

 Symmetry Properties Cont’d

Copyright (C) 2005 Güner Arslan 351M Digital Signal Processing 8

 Periodic Convolution
• Take two periodic sequences
~ ~
x1 n DFS
 X1 k 
~ ~
x n DFS
 X k 
2 2
• Let’s form the product
~ ~ ~
X3 k   X1 k X2 k 

• The periodic sequence with given DFS can be written as

N 1
~
x n  ~
x m~
x n  m
3 
m0
1 2

• Periodic convolution is commutative

N 1
~
x3 n  ~ ~
 2 x1 n  m
x
m0
 m

Copyright (C) 2005 Güner Arslan 351M Digital Signal Processing 9