Linear shift-invariant filters
		This pattern is very common      - same entries in each row      - all non-zero entries near the diagonal It is known as a linear shift-invariant filter and is represented by a kernel (or mask) h: and can be written (for kernel of size 2k+1) as: The above allows negative filter indices.  When you implement need to use:  h[u+k] instead of h[u]