Step 1: x[n]->x[k]; h[n]-

Given >h[-k]
x[n] 1 1 0 1 1 x[k] 1 1 0 1 1
n -2 -1 0 1 2 k -2 -1 0 1 2
h[n] 1 2 3 4 h[-k] 4 3 2 1
n -3 -2 -1 0 k 0 1 2 3

Step 2: Shift and Sum in Overlapping region

k -5 -4 -3 -2 -1 0 1 2 3 4 5
x[k] 1 1 0 1 1 y[n]
h[-k-5] 4 3 2 1 y[-5]
h[-k-4] 4 3 2 1 y[-4]
h[-k-3] 4 3 2 1 y[-3]
h[-k-2] 4 3 2 1 y[-2]
h[-k-1] 4 3 2 1 y[-1]
h[-k] 4 3 2 1 y[0]
h[-k+1] 4 3 2 1 y[1]
h[-k+2] 4 3 2 1 y[2]
apping region

∑x[k]h[k-n]
1X1 1
1X2+1X1 3
1X3+1X2+0X1 5
1X4+1X3+0X2+1X1 8
1X4+0X3+1X2+1X1 7
0X4+1X3+1X2 5
1X4+1X3 7
1X4 4