The convolution operation has a handful of algebraic properties that make it usable. Throughout, are continuous-time signals, is a constant, is a nonzero constant, is real, and is the unit impulse.

Commutativity

Order of the two signals doesn’t matter. Falls out of the change of variable in the convolution integral. Practical use: if one of the two signals is easier to flip than the other, flip that one.

Associativity

Order of convolving three signals doesn’t matter. This is what makes cascaded systems clean: if input feeds a system with impulse response , whose output feeds a system with response , the overall I/O relation is . So a cascade is equivalent to a single system with impulse response .

Distributivity

Convolution distributes over addition. Practical use: parallel-connected systems with shared input have overall impulse response .

Scalar multiplication

Constants pass through convolution.

Identity (the impulse)

The unit impulse is the convolution identity. Quick proof: by the sifting property.

More generally, . Convolving with a shifted impulse shifts the signal — a “system” with impulse response is just a pure delay.

A useful corollary: if , then . The shift can be applied to either side of the convolution.

Differentiation

If , then

The derivative of a convolution is the convolution of either factor’s derivative with the other. Useful when one factor has a simpler derivative than itself.

Area

Total area under a convolution equals the product of the areas of the factors. Fast sanity check: if your computed has the wrong total area, there’s an error.

Proof: integrating over all and swapping the order, .

Time-scaling

If , then

where and are the time-scaled signals and , convolved and then evaluated at (not at ). The factor out front comes from the change of integration variable.

Smoothing and continuity

Two more properties that don’t have one-line formulas but are worth knowing:

  • Convolution is smoothing. The output is at least as smooth as the smoother of the two factors. Rough signals become rough only if both are rough; convolving with a smooth signal smooths the result.
  • Convolution is continuous. Small changes in the inputs produce small changes in the output.

For the frequency-domain consequence — convolution in time becoming multiplication in frequency — see the Convolution theorem. This is what makes the Fourier transform and Laplace transform so useful for LTI analysis.