## Convolution Representation

We will now derive the convolution representation for LTI filters in its full generality. The first step is to express an arbitrary signal as a linear combination of shifted impulses,*i.e.*,

where ``'' denotes the convolution operator. (See [84]

^{6.4}for an elementary introduction to convolution.) If the above equation is not obvious, here is how it is built up intuitively. Imagine as a 1 in the midst of an infinite string of 0s. Now think of as the same pattern shifted over to the right by samples. Next multiply by , which plucks out the sample and surrounds it on both sides by 0's. An example collection of waveforms for the case is shown in Fig.5.4a. Now, sum over all , bringing together the samples of , to obtain . Figure 5.4b shows the result of this addition for the sequences in Fig.5.4a. Thus, any signal may be expressed as a weighted sum of shifted impulses. Equation (5.4) expresses a signal as a linear combination (or weighted sum) of impulses. That is, each sample may be viewed as an impulse at some amplitude and time. As we have already seen, each impulse (sample) arriving at the filter's input will cause the filter to produce an impulse response. If another impulse arrives at the filter's input before the first impulse response has died away, then the impulse response for both impulses will

*superimpose*(add together sample by sample). More generally, since the input is a linear combination of impulses, the output is the

*same*linear combination of impulse responses. This is a direct consequence of the

*superposition principle*which holds for any LTI filter.

This states that the filter output is the

*convolution*of the input with the filter impulse response . The infinite sum in Eq.(5.5) can be replaced by more typical practical limits. By choosing time 0 as the beginning of the signal, we may define to be 0 for so that the lower summation limit of can be replaced by 0. Also, if the filter is causal, we have for , so the upper summation limit can be written as instead of . Thus, the

*convolution representation of a linear, time-invariant, causal digital filter*is given by

*i.e.*, for ). Since the above equation is a convolution, and since convolution is commutative (

*i.e.*, [84]), we can rewrite it as

*weighted echoes*of the input signal together. At time , the weight of the echo from samples ago [] is .

### Convolution Representation Summary

We have shown that the output of any LTI filter may be calculated by convolving the input with the impulse response . It is instructive to compare this method of filter implementation to the use of difference equations, Eq.(5.1). If there is no feedback (no coefficients in Eq.(5.1)), then the difference equation and the convolution formula are essentially*identical*, as shown in the next section. For recursive filters, we can convert the difference equation into a convolution by calculating the filter impulse response. However, this can be rather tedious, since with nonzero feedback coefficients the impulse response generally lasts forever. Of course, for stable filters the response is infinite only in theory; in practice, one may truncate the response after an appropriate length of time, such as after it falls below the quantization noise level due to round-off error.

**Next Section:**

Finite Impulse Response Digital Filters

**Previous Section:**

Implications of Linear-Time-Invariance