Digital Signal Processing: Dr. Shekha Rai
Digital Signal Processing: Dr. Shekha Rai
1 / 19
Discrete time Fourier transform
Periodicity of DTFT
Convergence of DTFT
Gibbs phenomenon
2 / 19
Discrete time Fourier transform
3 / 19
Discrete time Fourier transform
X
x(n) = Xk ejkωo n (1)
k=<N>
1 X
Xk = x(m)e−jkωo m (2)
N
m=<N>
X 1 X
x(n) = ( x(m)e−jkωo m )ejkωo n
N
k=<N> m=<N>
4 / 19
Discrete time Fourier transform
2π
Since N = ωo
X X ωo
x(n) = ( x(m)e−jkωo m )ejkωo n
2π
k=<N> m=<N>
ωo dω
As N → ∞, 2π → 2π and kωo = ω
Z ∞
1 X
x(n) = ( x(m)e−jωm )ejωn dω (3)
2π 2π m=−∞
5 / 19
Discrete time Fourier transform
Now,
Z
1
x(n) = X(ejω )ejωn dω (4)
2π 2π
where,
∞
X
jω
X(e ) = x(m)e−jωm
m=−∞
or,
∞
X
jω
X(e ) = x(n)e−jωn (5)
n=−∞
6 / 19
Discrete time Fourier transform
7 / 19
Discrete time Fourier transform
x(n) ←→ X(ejω )
1
XR (ejω ) = [X(ejω ) + X ∗ (ejω )] (7)
2
1
XI (ejω ) = [X(ejω ) − X ∗ (ejω )] (8)
2j
8 / 19
Discrete time Fourier transform
In polar form
q
jω
|X(e )| = XR2 (ejω ) + XI2 (ejω ) (11)
XI (ejω )
θ(ω) = ∠X(ejω ) = tan−1 (12)
XR (ejω )
9 / 19
Discrete time Fourier transform
10 / 19
Periodicity of DTFT
11 / 19
Convergence of DTFT
∞
X
|X(ejω )| = | x(n)e−jωn |
n=−∞
∞
X
≤ |x(n)||e−jωn |
n=−∞
∞
X
|X(ejω )| ≤ |x(n)|| < ∞ (16)
n=−∞
12 / 19
Gibbs Phenomenon
13 / 19
Gibbs Phenomenon
Figure: K=5
14 / 19
Gibbs Phenomenon
Figure: K=21
15 / 19
Gibbs Phenomenon
Figure: K=51
16 / 19
DTFT
17 / 19
DTFT
Solution:
∞
X
jω
X(e ) = x(n)e−jωn )
n=−∞
∞
X
= δ(n)e−jωn )
n=−∞
= e−jωn |n=0 = 1
18 / 19
Thank You
19 / 19