Convolution and Circulant Matrices

Key idea

Matrices diagonalised by the Fourier transform.

In depth

Convolution slides a kernel across a signal. For periodic signals it is multiplication by a circulant matrix, each row a cyclic shift of the one above. The Fourier basis diagonalises every circulant matrix.

Worked example

Convolving with kernel (1, 2) is multiplying by a matrix with 1 on the diagonal and 2 on the next diagonal.

Real-world uses

• Filtering audio and images with fast algorithms in signal processing

Common mistake

Forgetting that the kernel is flipped in true convolution.

How to learn this

1. Read the key idea and say it in your own words.
2. Work through the worked example, then try a similar problem.
3. Use the interactive lesson’s visual and mini-quiz to check the pattern.

Frequently asked questions

Expand all Collapse all

Related expert topics in Linear Algebra

• Triple Product – Scalar triple product gives parallelepiped volume.
• Homogeneous Systems – Ax = 0 always has the trivial solution.
• Cofactor Expansion – Compute determinants recursively.
• Properties of Determinants – Multiplicative; row swaps change sign.
• Geometric Meaning of Determinants – Area or volume scaling factor.
• Cramer’s Rule for Systems – Solve systems using determinants.