Digital signal processing I

DFT

DFT examples
x[n]

1
0
-1
0

10

12

14

16

18

10

12

14

16

18

10

12

14

16

18

10

12

14

16

18

X[k]

1
0.5
0

x[n]

1
0
-1

X[k]

10
8
6
4

e1

Circular Shift of a Sequence

x[n]

x[ < n 1 > 6 ]

x[ < n 4 > 6 ]

= x[ < n + 5 > 6 ]

= x[ < n + 2 > 6 ]
c1

Cyclic convolution
4
0

29

26

15

20

c2

Cyclic convolution through DFT

N- 1

x[n]WNkn

X [k ] =
n= 0
- j

W4 = e

2p
4

= - j : W40 = 1,W41 = - j ,W42 = - 1,W43 = j

X [0] = 0 1 + 3 1+ 5 1+ 1 1 = 9
X [1] = 0 1 + 3 -( j )+ 5 - ( 1) + 1 j = - 5 - 2 j
X [2] = 0 1+ 3( + 1)- 5 1+ 1( - 1) = 1
X [3] = 0 1+ 3- j 5+ ( 1)+ 1( - j ) = - 5 + 2 j
DFT
y[n] = [1, 2,3, 4]
Y [k ] = [10, - 2 + 2 j , - 2, - 2 - 2 j ]

c3

Cyclic convolution through DFT

Z [k ] = X [k ]Y [k ] = [90, 14 - 6 j , - 2, 14 + 6 j ]
1
z[n] =
N
- j

W4 = e

N- 1

Z [ k]WN- kn
k= 0

2p
4

= - j : W40 = 1,W41 = - j ,W42 = - 1,W43 = j

z[0] = 14 (90 1 +(14 +6 j ) 1 - ( 2)

+ 1 - (14 +6 j ) 1 =) 29
z[1] = 14 (90 1+ (14 + 6 j )- j ( - 2) +( 1) - (14 + 6 j )( - j ))= 26
z[2] = 14 (90 1 + (14 - 6 j ) ( + 1) +( 2) 1 - (14+ -6 j ) ( - 1))= 15
z[3] = 14 (90 1 +(14 +6 j ) (- j ) - ( 2)
+ (- 1) -(14 +6 j ) j )= 19
c4

Cyclic convolution as linear

convolution with aliasing

-N

N
0

c5

Linear convolution using

cyclic convolution
1

4
L1

Linear Convolution of Two

Finite-Length Sequences
y[ n] = g[ n]* h[ n] = g[ n] L h[ n]
N+ M- 1
g[n] Zero-padding
with
Length-N ( M 1) zeros

g e [n] ( N + M 1)

h[n] Zero-padding
with
Length-M ( N 1) zeros

he [n] ( N + M 1)

point DFT

point DFT

( N + M 1) y L [n]
point IDFT
Length- ( N + M 1)

L2

DTFT sampling by DFT

x[n] = cos(2 3n / 16), 0 n 15

10

Magnitude

8
6
4
2
0
0

0.2
0.4
0.6
0.8
Normalized angular frequency

1
d1

Overlap-Add Method

N= 7

O1

Overlap-Add Method

N= 7
M=5

O2

Overlap-Add Method
Therefore, y[n] obtained by a linear
convolution of x[n] and h[n] is given by
0n6
y[n] = y0 [n],
y[n] = y0 [n] + y1[n 7],
7 n 10
11 n 13
y[n] = y1[n 7],
y[n] = y1[n 7] + y2 [n 14], 14 n 17
18 n 20
y[n] = y2 [n 14],

O3

Overlap-Save Method
Process is illustrated next

N= 7
M=5
L = 11

O4

Overlap-Save Method

N= 7
M=5
L = 11

O5

DFT Computation Using

MATLAB
Functions name in matlab:
DFT: fft
IDFT ifft
Overlap and add: fftfilt