Then, I shift this reflected version by amounts N one, N two.

And for each shift, I find the product of h with

x, and I sum up this product for [UNKNOWN] to infinity.

So, then for this particular shift I'll find the output,

the value of the output at N one, N two.

I have to perform all possible shifts in order to find

y in all possible pixels loca, pixel locations, N one, N two.

So let's look at the steps that

are imposed by this superposition sum more specifically.

So again, the first step is to rename the axis.

So now we have x of k one, k two, and they do the same for h, but

I reflect it with respect to the vertical and

horizontal axis of the reflective version is shown here.

I put a zero here to indicate that the shift, if I just reflect, is zero.

So this is N one and this is N two.

I am going to now superimpose the signals, use them in the same graph as shown here.

And then, for this particular location, since h is sifted by zero, zero, right?

I'm going to find the product of the two signals, and

I'll sum it up and I'll find the value of y at zero, zero.

We see that for this particular situation, the overlap

is only at one pixel, the pixel here, which has changed color.

So, x is in blue, h is in red

and where they overlap the, the color is purple, right?

So, in this particular case, there is overlap of

only one pixel, and when I sum it up.