---
title: Circular convolution
slug: circular-convolution
qid: 
snapshot: enwiki-001359306989
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1359306989
tags: [20476482, 22983403, 23603337, 26220375, 29379983]
---

# Circular convolution

> [!note] Provenance
> Snapshot `enwiki-001359306989` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1359306989> · Licensed CC BY-SA 4.0

Circular convolution, also known as cyclic convolution, is a special case of periodic convolution, which is the convolution of two periodic functions that have the same period. Periodic convolution arises, for example, in the context of the discrete-time Fourier transform (DTFT). In particular, the DTFT of the product of two discrete sequences is the periodic convolution of the DTFTs of the individual sequences. And each DTFT is a periodic summation of a continuous Fourier transform function (see ). Although DTFTs are usually continuous functions of frequency, the concepts of periodic and circular convolution are also directly applicable to discrete sequences of data. In that context, circular convolution plays an important role in maximizing the efficiency of a certain kind of common filtering operation.

Circular convolution, also known as cyclic convolution, is a special case of periodic convolution, which is the convolution of two periodic functions that have the same period. Periodic convolution arises, for example, in the context of the discrete-time Fourier transform (DTFT). In particular, the DTFT of the product of two discrete sequences is the periodic convolution of the DTFTs of the individual sequences. And each DTFT is a periodic summation of a continuous Fourier transform function (see ). Although DTFTs are usually continuous functions of frequency, the concepts of periodic and circular convolution are also directly applicable to discrete sequences of data. In that context, circular convolution plays an important role in maximizing the efficiency of a certain kind of common filtering operation. ==Definitions== The periodic convolution of two T-periodic functions, h_{_T}(t) and x_{_T}(t) can be defined as: \int_{t_o}^{t_o+T} h_{_T}(\tau)\cdot x_{_T}(t - \tau)\,d\tau, &nbsp; where t_o is an arbitrary parameter. An alternative definition, in terms of the notation of normal linear or aperiodic convolution, follows from expressing h_{_T}(t) and x_{_T}(t) as periodic summations of aperiodic components h and x , i.e.: h_{_T}(t) \ \triangleq \ \sum_{k=-\infty}^\infty h(t - kT) = \sum_{k=-\infty}^\infty h(t + kT). Then: \begin{align} \int_{-\infty}^\infty h(\tau)\cdot x_{_T}(t - \tau)\,d\tau &=\sum_{k=-\infty}^\infty \left[\int_{t_o+kT}^{t_o+(k+1)T} h(\tau)\cdot x_{_T}(t - \tau)\ d\tau\right] \quad t_0 \text{ is an arbitrary parameter}\\ &=\sum_{k=-\infty}^\infty \left[\int_{t_o}^{t_o+T} h(u + kT)\cdot \underbrace{x_{_T}(t-u-kT)}_{x_{_T}(t-u), \text{ by periodicity}}\ du\right] \quad \text{substituting } u\triangleq \tau-kT\\ &=\int_{t_o}^{t_o+T} \left[\sum_{k=-\infty}^\infty h(u + kT)\cdot x_{_T}(t - u)\right]\ du\\ &=\int_{t_o}^{t_o+T} \underbrace{\left[\sum_{k=-\infty}^\infty h(u + kT)\right]}_{\triangleq \ h_{_T}(u)}\cdot x_{_T}(t - u)\ du\\ &=\int_{t_o}^{t_o+T} h_{_T}(\tau)\cdot x_{_T}(t - \tau)\ d\tau \quad \text{substituting } \tau \triangleq u \end{align} Both forms can be called periodic convolution. The term circular convolution arises from the important special case of constraining the non-zero portions of both h and x to the interval [0,T]. Then the periodic summation becomes a periodic extension , which can also be expressed as a circular function: x_{_T}(t) = x(t_{\mathrm{mod}\ T}), \quad t\in\mathbb{R}\, (any real number) And the limits of integration reduce to the length of function h : (h *x_{_T})(t) = \int_{0}^{T} h(\tau)\cdot x((t - \tau)_{\mathrm{mod}\ T})\ d\tau. (h * x_{_N})[n] \ \triangleq \ \sum_{m=-\infty}^\infty h[m] \cdot \underbrace{x_{_N}[n-m]}_{\sum_{k=-\infty}^\infty x[n -m -kN]} This function is N-periodic. It has at most N unique values. For the special case that the non-zero extent of both x and h are ≤ N, it is reducible to matrix multiplication where the kernel of the integral transform is a circulant matrix. There are also methods for dealing with an x sequence that is longer than a practical value for N. The sequence is divided into segments (blocks) and processed piecewise. Then the filtered segments are carefully pieced back together. Edge effects are eliminated by overlapping either the input blocks or the output blocks. To help explain and compare the methods, we discuss them both in the context of an h sequence of length 201 and an FFT size of&nbsp;N&nbsp;=&nbsp;1024.
