M Muthumari, Asst Prof, ECE Dept 02/03/2023

DISCRETE TIME SIGNAL

PROCESSING -
1151EC112

Ms M Muthu mari
Asst Prof, Dept of ECE

1
 M Muthumari, Asst Prof, ECE Dept 02/03/2023

WHAT YOU ARE GOING TO LEARN?

UNIT I - DISCRETE
FOURIER
CO1 Compute Discrete
TRANSFORMS Fourier Transform
for the given signals.

Introduction & Properties of DFT – Linear

& Circular Convolution Methods, FFT
algorithms – Radix-2 FFT algorithms –
Decimation in Time – Decimation in
Frequency algorithms –Use of FFT K3
algorithms in Linear Filtering and
correlation Knowledge
level

2
 M Muthumari, Asst Prof, ECE Dept 02/03/2023

WHY DFT?
 The discrete-time Fourier transform (DTFT) provided the
frequency- domain (ω) representation for absolutely summable
sequences.
 The z-transform provided a generalized frequency-domain
(z) representation for arbitrary sequences.
 These transforms have two features in common.
 First, the transforms are defined for infinite-length sequences.
 Second, and the most important, they are functions of continuous variables
(ω or z).
 In other words, the discrete-time Fourier transform and the z-transform
are not numerically computable transforms.
 The Discrete Fourier Transform (DFT) avoids the two problems
mentioned and is a numerically computable transform that is suitable
for computer implementation.
33
 M Muthumari, Asst Prof, ECE Dept 02/03/2023

DISCRETE FOURIER TRANSFORM(DFT)

44
 M Muthumari, Asst Prof, ECE Dept 02/03/2023

RECALL OF DTFT

 DTFT is not suitable for DSP applications because

 In DSP, we are able to compute the spectrum only at specific discrete values of ω
 Any signal in any DSP application can be measured only in a finite number of
points.
 A finite signal measures at N-points:
0 n0
x(n)  y(n), 0  n  (N

1)
 0,
 nN
Where y(n) are the measurements taken at N-points
55
 M Muthumari, Asst Prof, ECE Dept 02/03/2023

COMPUTATION OF DFT
 The DFT can be computed by:
 Truncate the summation so that it ranges over finite limits x[n] is a finite-length
sequence.
 Discretize ω to ωk  evaluate DTFT at a finite number of discrete frequencies.
 For an N-point sequence, only N values of frequency samples of X(ejw) at N
distinct frequency points,   k , 0  k  N 1 are sufficient to determine x[n] and
X(ejw) uniquely.
 So, by sampling the spectrum X(ω) in frequency domain
2
X (k)  X(k ),   N
N
 j 2 kn
1 N
 DFT
X (k)   x(n)
e
n0
6
 M Muthumari, Asst Prof, ECE Dept 02/03/2023

COMPUTATION OF IDFT
 The inverse DFT is given by:
1 N kn
j 2 N
x(n)  1
 IDFT
N 
k 0
X (k)
e
 Proo j 2 k m 
1
 
kn
f x(n) 
N 1  N x(m) e N  j 2 N
1
N ke0  m0
N N
1  
k (m n)
1 1  j 2 N

 x(m)
x(n)  m0 
 N n0
e 
N
1
x(n)   x(m)  (m  n)  7
 M Muthumari, Asst Prof, ECE Dept 02/03/2023

THE DFT PAIR N 1 kn

-j 2  N

Analysis  X (k)  
n0 x(n)
e N 1
X (k)   x(n )W kn
N k  0,1,..., N  1
n0

1 N 1
j 2 N
kn
Synthesis  x(n) 
N 
k 0 X (k )
1 e
N 1
x(n) 
N
 k 0
X ( k ) W N kn n  0,1,..., N  1
2
 j
w h er e WN  e N

8
 M Muthumari, Asst Prof, ECE Dept 02/03/2023

DFT INTERPRETATION
 DFT sample X (k) specifies the magnitude and phase angle of the spectral
kth
component of x[n].
M agnitude spectrum 

| X (k) | Phase spectrum 

 X (k)
| X (k) |2
S N (k)  , 0kN
 The amount of power that x[nN] contains at a normalized frequency, fk, can be
1
determined from the power density spectrum defined as
9
 M Muthumari, Asst Prof, ECE Dept 02/03/2023

1.Find the 4 point DFT of following window function x(n)=u(n)-u(n-N).

Solution:
According to the definition of DFT,
N  j 2kn
1 N
……..(1)
 x(n)e
X (k)  n0
•The given equation is x(n)=1
for0  n  N , Here N=4,so we
will get 4point
X (kDFT.
)  j 2kn

3
4
……..(2)
n0

•The rangeof
1.e‘k’ is from ‘0’ to ‘N-1’.So in this case ‘k’ will vary
from 0 to 3.
3 3

For k=0, X (0)   1.e 0   1 

1111  4
n0 n0
10
 M Muthumari, Asst Prof, ECE Dept 02/03/2023
3 j

FOR K=1, X (1)  e 2n 4

n=0

 X (1)   e  j 2 4  e  j 4 4
 e  j 6 4
e0
2 2 4 4 6 6
 X (1)  1  cos 4  j sin   cos 4  j sin    cos 4  j sin 
4 4 4

 X (1)  1 j 1 j 
0
3  j 2 3
2n 4  j n

For k=2, X (2)  

n0e 
n0 e

 X (2)   e  j  e  j 2  e  j3
e0
 X (2)  1 cos  j sin   cos 2  j sin 2  cos3  j sin
3 
 X (2)  1 1 0 1 0 1 0  1111  0
11
 M Muthumari, Asst Prof, ECE Dept 02/03/2023

3
3  j 2 j
For k=3, X (3)   3n
e
4 6n 4

N0
 e
n0

 j 6  j9
 X (3)  e0  e e  j3 e 2

4
6 6 9
 X (3)  1  cos  j sin   cos3  j sin 3   cos  j sin 
 4 4   2 2 
9 
 X (3)  1 0  j  1 0 0  j
0

 X (k)  4,0,0,0
M Muthumari, Asst Prof, ECE Dept 02/03/2023

13
M Muthumari, Asst Prof, ECE Dept 02/03/2023

14
M Muthumari, Asst Prof, ECE Dept 02/03/2023

15
M Muthumari, Asst Prof, ECE Dept 02/03/2023

16
 M Muthumari, Asst Prof, ECE Dept 02/03/2023

DFT EXAMPLES x p n  1, 

,0 , 
1 1 kn
-j 2  N
 2 2 X (k)   x(n) e
3 3
 j 4 nk  j 2 nk
2
n  0, 1, 2, 3
X (k)   xP n   xP n
e e

n0  j 2 0k 1 
 j n0

 j 2 2k 1 
 j 2 3k
 1 e   e 1k2 0  e
2 e 2
k  0, 1, 2,
3
Answer:

X (k)  2 , 1, 1  2 , 1}
{1 

17
 M Muthumari, Asst Prof, ECE Dept 02/03/2023
2 0

NTH ROOT OF UNITY

j
1) W8 0  e 8
1 2 1
 j 1 1
2) W8 1  e 8  j
 2 2
2 2
2
j
3) W8  e 8 2

j
WN  N j
j
4) W8  e 8
3
2 3 1
 j
1
 2 2
e kN k 5) W8  e 8 4 j
2 4

 WN  N  1 2 5 1 1
W
j
6) W8  e 8
5
 j
k ( N / 2)  2 2
 WN  W Nk 2
j 6
6
2k k 7) W  e 8
 j
 W N N/
8

2 7 1 1
 W * WW
j
2 8) W8  e 7 8
 j
2 2
1 2
j 8
8
N 9) W  e8
8

N j
2 91 1 1 18
10) W8  e 9 8  j
 2 2
 DFT - MATRIX M Muthumari, Asst Prof, ECE Dept 02/03/2023

FORMULATION
 X (0)  1 ... 1   x[0] 
   1 W N 1  
 X (1)  1
1 WN W N2 ...  N x[1] 
 X (2)   1 1 ...   x[2] 
W N2 WN4 W N2( N 1) 
   
 ...  ... ... ... ... ...   ... 
 ( N 1)( N   x[N 1]
 X (N  1 W NN 1 W N2( N 1) ... 1)   
N 
1) W
X N
 WN  x N

19
 M Muthumari, Asst Prof, ECE Dept 02/03/2023

IDFT - MATRIX FORMULATION

 x(0)  1 1 1 ... 1 X [0] 
  1  
 x(1)  W N1 W N2 ... W N( N 1)   X [1] 
 x(2)   1  ...   X [2] 
  1 W N2 W N4 W N2( N 1)  
... N ... ... ... ... ...
  ...  

 1 W N
( N 1) 2( N 1) ... W ( N 1)( N 
  X [N 1]
x(N WN 1)

N

1)
*
X
x N
N
 1 W
N N •Here WN * is the complex conjugate of

 WN .

20
M Muthumari, Asst Prof, ECE Dept 02/03/2023

21
M Muthumari, Asst Prof, ECE Dept 02/03/2023

22
M Muthumari, Asst Prof, ECE Dept 02/03/2023

23
M Muthumari, Asst Prof, ECE Dept 02/03/2023

24
M Muthumari, Asst Prof, ECE Dept 02/03/2023

25
M Muthumari, Asst Prof, ECE Dept 02/03/2023

26
 M Muthumari, Asst Prof, ECE Dept 02/03/2023

Problem-1:Calculate the four point DFT of four point sequence x(n)=(0,1,2,3).

Solution:The four point DFT in matrix form is given by

X 4
 W4 x4

1 1 1 1  0 

X 4  1
  j 1
j   1
1   2 
  
1 1 1  j   3 

j 1
1  6 
 0 1 2  3 
0  j  2  3 j   2 j  2 
X 4
  
 0 1 2  3  

2 0 j23j   2j 

2
X 4
{6, 2j-2, -2, -2j-2}
27
 M Muthumari, Asst Prof, ECE Dept 02/03/2023

COMPUTATION COMPLEXITY
 To calculate the DFT of N-Points discrete time signal, we need:

 (N-1)2 Complex Multiplications

 N(N-1) Complex Additions.

28
 M Muthumari, Asst Prof, ECE Dept 02/03/2023

EXERCISE PROBLEMS

29