Professional Documents
Culture Documents
4 - Overlap Add, Overlap Save Method
4 - Overlap Add, Overlap Save Method
DISCRETE TIME
SIGNAL
PROCESSING -
1151EC112
Ms M Muthu mari
Asst Prof, Dept of ECE
1
M Muthumari, Asst Prof, ECE Dept 02/03/2023
2
M Muthumari, Asst Prof, ECE Dept 02/03/2023
3
M Muthumari, Asst Prof, ECE Dept 02/03/2023
STEP-2:
Given input sequence x[n] size of DFT is
‘N’. let assume, N=5
STEP-3:
Determine the length of the new data, ‘L’
=> N=(L+M-1)
STEP-4:
Pad ‘L-1’ zeros to h[n]
h[n] ‘L-1’ zeros (padded)
4
M Muthumari, Asst Prof, ECE Dept 02/03/2023
L L L L
6
M Muthumari, Asst Prof, ECE Dept 02/03/2023
M-1 data
y4[n]
X
7
M Muthumari, Asst Prof, ECE Dept 02/03/2023
n -2 -1 0 1 2 3 4 5 6 7 8 9 10 11
X(n) 3 -1 0 1 3 2 0 1 2 1
X1(n) 0 0 3 -1 0
X2(n) -1 0 1 3 2
X3(n) 3 2 0 1 2
X4(n) 1 2 1 0 0
8
M Muthumari, Asst Prof, ECE Dept 02/03/2023
y1(n) -1 0 3 2 2
X=> discard
y2(n) 4 1 0 4 6
X=> discard
y3(n) 6 7 5 3 3
X=> discard
y4(n) 1 3 4 3 1
X=> discard
y(n) 3 2 2 0 4 6 5 3 3 4 3 1
Output Y(n)={ 3, 2, 2, 0, 4, 6, 5, 3, 3, 4, 3, 1 }
9
M Muthumari, Asst Prof, ECE Dept 02/03/2023
10
M Muthumari, Asst Prof, ECE Dept 02/03/2023
12
M Muthumari, Asst Prof, ECE Dept 02/03/2023
13
M Muthumari, Asst Prof, ECE Dept 02/03/2023
add
add
add
14
M Muthumari, Asst Prof, ECE Dept 02/03/2023
n 0 1 2 3 4 5 6 7 8 9 10 11 12 13
X(n) 3 -1 0 1 3 2 0 1 2 1
X1(n) 3 -1 0 0 0
X2(n) 1 3 2 0 0
X3(n) 0 1 2 0 0
X4(n) 1 0 0 0 0
15
M Muthumari, Asst Prof, ECE Dept 02/03/2023
n 0 1 2 3 4 5 6 7 8 9 10 11 12 13
y1(n) 3 2 2 -1 0
y2(n) 1 4 6 5 2
y3(n) 0 1 3 3 2
y4(n) 1 1 1 0 0
y(n) 3 2 2 0 4 6 5 3 3 4 3 1 0 0
Output Y(n)={ 3, 2, 2, 0, 4, 6, 5, 3, 3, 4, 3, 1 }
16
M Muthumari, Asst Prof, ECE Dept 02/03/2023
18
M Muthumari, Asst Prof, ECE Dept 02/03/2023
n -1 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14
X(n) 1 2 -1 2 3 -2 -3 -1 1 1 2 -1
X1(n) 0 1 2 -1
X2(n) -1 2 3 -2
X3(n) -2 -3 -1 1
X4(n) 1 1 2 -1
X5(n) -1 0 0 0
19
M Muthumari, Asst Prof, ECE Dept 02/03/2023
X=> discard
Performing yk[n]= xk[n] N h[n], where k=1,2,3,4,5
y1[n]= {-2,1,4,3} y3[n]={0,-7,-7,-1}
y2[n]= {-5,0,7,4} y4[n]={-1,3,4,3} y5[n]= { -1,-2,0,0 }
n -1 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14
y1(n) -2 1 4 3
x
y2(n) -5 0 7 4
X
y3(n) 0 -7 -7 -1
X
y4(n) -1 3 4 3
X
y5(n) -1 -2 0 0
X
y(n) 1 4 3 0 7 4 -7 -7 -1 3 4 3 -2 0 0
n 0 1 2 3 4 5 6 7 8 9 10 11 12
X(n) 1 2 -1 2 3 -2 -3 -1 1 1 2 -1
X1(n) 1 2 -1 0
X2(n) 2 3 -2 0
X3(n) -3 -1 1 0
X4(n) 1 2 -1 0
21
M Muthumari, Asst Prof, ECE Dept 02/03/2023
y(n) 1 4 3 0 7 4 -7 -7 -1 3 4 3 -2
22