Wsrtjtyk

Visual comparison of convolution, cross-correlation, and autocorrelation. For the operations involving function f, and assuming the height of f is 1.0, the value of the result at 5 different points is indicated by the shaded area below each point. Also, the symmetry of f is the reason f∗g{displaystyle f*g} and f⋆g{displaystyle fstar g} are identical in this example.

In mathematics (and, in particular, functional analysis) convolution is a mathematical operation on two functions (f and g) to produce a third function that expresses how the shape of one is modified by the other. The term convolution refers to both the result function and to the process of computing it. Convolution is similar to cross-correlation. For discrete, real-valued functions, they differ only in a time reversal in one of the functions. For continuous functions, the cross-correlation operator is the adjoint of the convolution operator.

It has applications that include probability, statistics, computer vision, natural language processing, image and signal processing, engineering, and differential equations.^{[citation needed]}

The convolution can be defined for functions on Euclidean space, and other groups.^{[citation needed]} For example, periodic functions, such as the discrete-time Fourier transform, can be defined on a circle and convolved by periodic convolution. (See row 13 at DTFT § Properties.) A discrete convolution can be defined for functions on the set of integers.

Generalizations of convolution have applications in the field of numerical analysis and numerical linear algebra, and in the design and implementation of finite impulse response filters in signal processing.^{[citation needed]}

Computing the inverse of the convolution operation is known as deconvolution.

Definition

The convolution of f and g is written f ∗ g, using an asterisk or star. It is defined as the integral of the product of the two functions after one is reversed and shifted. As such, it is a particular kind of integral transform:

An equivalent definition is (see commutativity):

(f∗g)(t)=def ∫−∞∞f(t−τ)g(τ)dτ{displaystyle (f*g)(t){stackrel {mathrm {def} }{=}} int _{-infty }^{infty }f(t-tau )g(tau ),dtau }

While the symbol t is used above, it need not represent the time domain. But in that context, the convolution formula can be described as a weighted average of the function f(τ) at the moment t where the weighting is given by g(−τ) simply shifted by amount t. As t changes, the weighting function emphasizes different parts of the input function.

For functions f, g supported on only [0,∞){displaystyle [0,infty )} (i.e., zero for negative arguments), the integration limits can be truncated, resulting in

(f∗g)(t)=∫0tf(τ)g(t−τ)dτ for f,g:[0,∞)→R{displaystyle (f*g)(t)=int _{0}^{t}f(tau )g(t-tau ),dtau {text{ for }}f,g:[0,infty )to mathbb {R} }

In this case, the Laplace transform is more appropriate than the Fourier transform below and boundary terms become relevant.

For the multi-dimensional formulation of convolution, see domain of definition (below).

Notation

A primarily engineering convention that one often sees is:^[1]

f(t)∗g(t)=def ∫−∞∞f(τ)g(t−τ)dτ⏟(f∗g)(t),{displaystyle f(t)*g(t),{stackrel {mathrm {def} }{=}} underbrace {int _{-infty }^{infty }f(tau )g(t-tau ),dtau } _{(f*g)(t)},}

which has to be interpreted carefully to avoid confusion. For instance, f(t) * g(t − t₀) is equivalent to (f * g)(t − t₀), but f(t − t₀)* g(t − t₀) is in fact equivalent to (f * g)(t − 2t₀).^[2]

Derivations

Convolution describes the output (in terms of the input) of an important class of operations known as linear time-invariant (LTI). See LTI system theory for a derivation of convolution as the result of LTI constraints. In terms of the Fourier transforms of the input and output of an LTI operation, no new frequency components are created. The existing ones are only modified (amplitude and/or phase). In other words, the output transform is the pointwise product of the input transform with a third transform (known as a transfer function). See Convolution theorem for a derivation of that property of convolution. Conversely, convolution can be derived as the inverse Fourier transform of the pointwise product of two Fourier transforms.

Visual explanation

Visual explanations of convolution
Express each function in terms of a dummy variable τ.{displaystyle tau .} Reflect one of the functions: g(τ){displaystyle g(tau )}→g(−τ).{displaystyle g(-tau ).} Add a time-offset, t, which allows g(t−τ){displaystyle g(t-tau )} to slide along the τ{displaystyle tau }-axis. Start t at −∞ and slide it all the way to +∞. Wherever the two functions intersect, find the integral of their product. In other words, compute a sliding, weighted-sum of function f(τ){displaystyle f(tau )}, where the weighting function is g(−τ).{displaystyle g(-tau ).} The resulting waveform (not shown here) is the convolution of functions f and g. If f(t) is a unit impulse, the result of this process is simply g(t). Formally: ∫−∞∞δ(τ)g(t−τ)dτ=g(t){displaystyle int _{-infty }^{infty }delta (tau )g(t-tau ),dtau =g(t)}
In this example, the red-colored "pulse", g(τ),{displaystyle g(tau ),} is an even function ( g(−τ)=g(τ) ),{displaystyle ( g(-tau )=g(tau ) ),} so convolution is equivalent to correlation. A snapshot of this "movie" shows functions g(t−τ){displaystyle g(t-tau )} and f(τ){displaystyle f(tau )} (in blue) for some value of parameter t,{displaystyle t,} which is arbitrarily defined as the distance from the τ=0{displaystyle tau =0} axis to the center of the red pulse. The amount of yellow is the area of the product f(τ)⋅g(t−τ),{displaystyle f(tau )cdot g(t-tau ),} computed by the convolution/correlation integral. The movie is created by continuously changing t{displaystyle t} and recomputing the integral. The result (shown in black) is a function of t,{displaystyle t,} but is plotted on the same axis as τ,{displaystyle tau ,} for convenience and comparison.
In this depiction, f(τ){displaystyle f(tau )} could represent the response of an RC circuit to a narrow pulse that occurs at τ=0.{displaystyle tau =0.} In other words, if g(τ)=δ(τ),{displaystyle g(tau )=delta (tau ),} the result of convolution is just f(t).{displaystyle f(t).} But when g(τ){displaystyle g(tau )} is the wider pulse (in red), the response is a "smeared" version of f(t).{displaystyle f(t).} It begins at t=−0.5,{displaystyle t=-0.5,} because we defined t{displaystyle t} as the distance from the τ=0{displaystyle tau =0} axis to the center of the wide pulse (instead of the leading edge).

Historical developments

One of the earliest uses of the convolution integral appeared in D'Alembert's derivation of Taylor's theorem in Recherches sur différents points importants du système du monde, published in 1754.^[3]

Also, an expression of the type:

∫f(u)⋅g(x−u)du{displaystyle int f(u)cdot g(x-u),du}

is used by Sylvestre François Lacroix on page 505 of his book entitled Treatise on differences and series, which is the last of 3 volumes of the encyclopedic series: Traité du calcul différentiel et du calcul intégral, Chez Courcier, Paris, 1797-1800.^[4] Soon thereafter, convolution operations appear in the works of Pierre Simon Laplace, Jean-Baptiste Joseph Fourier, Siméon Denis Poisson, and others. The term itself did not come into wide use until the 1950s or 60s. Prior to that it was sometimes known as Faltung (which means folding in German), composition product, superposition integral, and Carson's integral.^[5]
Yet it appears as early as 1903, though the definition is rather unfamiliar in older uses.^[6][7]

The operation:

∫0tφ(s)ψ(t−s)ds,0≤t<∞,{displaystyle int _{0}^{t}varphi (s)psi (t-s),ds,qquad 0leq t<infty ,}

is a particular case of composition products considered by the Italian mathematician Vito Volterra in 1913.^[8]

Circular convolution

When a function g_T is periodic, with period T, then for functions, f, such that f∗g_T exists, the convolution is also periodic and identical to:

(f∗gT)(t)≡∫t0t0+T[∑k=−∞∞f(τ+kT)]gT(t−τ)dτ,{displaystyle (f*g_{T})(t)equiv int _{t_{0}}^{t_{0}+T}left[sum _{k=-infty }^{infty }f(tau +kT)right]g_{T}(t-tau ),dtau ,}

where t_o is an arbitrary choice. The summation is called a periodic summation of the function f.

When g_T is a periodic summation of another function, g, then f∗g_T is known as a circular or cyclic convolution of f and g.

And if the periodic summation above is replaced by f_T, the operation is called a periodic convolution of f_T and g_T.

Discrete convolution

For complex-valued functions f, g defined on the set Z of integers, the discrete convolution of f and g is given by:^[9]

or equivalently (see commutativity) by:

(f∗g)[n]=∑m=−∞∞f[n−m]g[m]{displaystyle (f*g)[n]=sum _{m=-infty }^{infty }f[n-m]g[m]}.

The convolution of two finite sequences is defined by extending the sequences to finitely supported functions on the set of integers. When the sequences are the coefficients of two polynomials, then the coefficients of the ordinary product of the two polynomials are the convolution of the original two sequences. This is known as the Cauchy product of the coefficients of the sequences.

Thus when g has finite support in the set {−M,−M+1,…,M−1,M}{displaystyle {-M,-M+1,dots ,M-1,M}} (representing, for instance, a finite impulse response), a finite summation may be used:^[10]

(f∗g)[n]=∑m=−MMf[n−m]g[m].{displaystyle (f*g)[n]=sum _{m=-M}^{M}f[n-m]g[m].}

Circular discrete convolution

When a function g_N is periodic, with period N, then for functions, f, such that f∗g_N exists, the convolution is also periodic and identical to:

(f∗gN)[n]≡∑m=0N−1(∑k=−∞∞f[m+kN])gN[n−m].{displaystyle (f*g_{N})[n]equiv sum _{m=0}^{N-1}left(sum _{k=-infty }^{infty }{f}[m+kN]right)g_{N}[n-m].}

The summation on k is called a periodic summation of the function f.

If g_N is a periodic summation of another function, g, then f∗g_N is known as a circular convolution of f and g.

When the non-zero durations of both f and g are limited to the interval [0, N − 1], f∗g_N reduces to these common forms:

(f∗gN)[n]=∑m=0N−1f[m]gN[n−m]=∑m=0nf[m]g[n−m]+∑m=n+1N−1f[m]g[N+n−m]=∑m=0N−1f[m]g[(n−m)modN]≡(f∗Ng)[n]{displaystyle {begin{aligned}(f*g_{N})[n]&=sum _{m=0}^{N-1}f[m]g_{N}[n-m]\&=sum _{m=0}^{n}f[m]g[n-m]+sum _{m=n+1}^{N-1}f[m]g[N+n-m]\&=sum _{m=0}^{N-1}f[m]g[(n-m)_{bmod {N}}]equiv (f*_{N}g)[n]end{aligned}}}

(Eq.1)

The notation (f ∗_Ng) for cyclic convolution denotes convolution over the cyclic group of integers modulo N.

Circular convolution arises most often in the context of fast convolution with a fast Fourier transform (FFT) algorithm.

Fast convolution algorithms

In many situations, discrete convolutions can be converted to circular convolutions so that fast transforms with a convolution property can be used to implement the computation. For example, convolution of digit sequences is the kernel operation in multiplication of multi-digit numbers, which can therefore be efficiently implemented with transform techniques (Knuth 1997, §4.3.3.C; von zur Gathen & Gerhard 2003, §8.2).

Eq.1 requires N arithmetic operations per output value and N² operations for N outputs. That can be significantly reduced with any of several fast algorithms. Digital signal processing and other applications typically use fast convolution algorithms to reduce the cost of the convolution to O(N log N) complexity.

The most common fast convolution algorithms use fast Fourier transform (FFT) algorithms via the circular convolution theorem. Specifically, the circular convolution of two finite-length sequences is found by taking an FFT of each sequence, multiplying pointwise, and then performing an inverse FFT. Convolutions of the type defined above are then efficiently implemented using that technique in conjunction with zero-extension and/or discarding portions of the output. Other fast convolution algorithms, such as the Schönhage–Strassen algorithm or the Mersenne transform,^[11] use fast Fourier transforms in other rings.

If one sequence is much longer than the other, zero-extension of the shorter sequence and fast circular convolution is not the most computationally efficient method available.^[12] Instead, decomposing the longer sequence into blocks and convolving each block allows for faster algorithms such as the Overlap–save method and Overlap–add method.^[13] A hybrid convolution method that combines block and FIR algorithms allows for a zero input-output latency that is useful for real-time convolution computations.^[14]

Domain of definition

The convolution of two complex-valued functions on R^d is itself a complex-valued function on R^d, defined by:

(f∗g)(x)=∫Rdf(y)g(x−y)dy=∫Rdf(x−y)g(y)dy,{displaystyle (f*g)(x)=int _{mathbf {R} ^{d}}f(y)g(x-y),dy=int _{mathbf {R} ^{d}}f(x-y)g(y),dy,}

is well-defined only if f and g decay sufficiently rapidly at infinity in order for the integral to exist. Conditions for the existence of the convolution may be tricky, since a blow-up in g at infinity can be easily offset by sufficiently rapid decay in f. The question of existence thus may involve different conditions on f and g:

Compactly supported functions

If f and g are compactly supported continuous functions, then their convolution exists, and is also compactly supported and continuous (Hörmander 1983, Chapter 1). More generally, if either function (say f) is compactly supported and the other is locally integrable, then the convolution f∗g is well-defined and continuous.

Convolution of f and g is also well defined when both functions are locally square integrable on R and supported on an interval of the form [a, +∞) (or both supported on [-∞, a]).

Integrable functions

The convolution of f and g exists if f and g are both Lebesgue integrable functions in L¹(R^d), and in this case f∗g is also integrable (Stein & Weiss 1971, Theorem 1.3). This is a consequence of Tonelli's theorem. This is also true for functions in ℓ1{displaystyle ell ^{1}}, under the discrete convolution, or more generally for the convolution on any group.

Likewise, if f ∈ L¹(R^d) and g ∈ L^p(R^d) where 1 ≤ p ≤ ∞, then f∗g ∈ L^p(R^d) and

‖f∗g‖p≤‖f‖1‖g‖p.{displaystyle |{f}*g|_{p}leq |f|_{1}|g|_{p}.}

In the particular case p = 1, this shows that L¹ is a Banach algebra under the convolution (and equality of the two sides holds if f and g are non-negative almost everywhere).

More generally, Young's inequality implies that the convolution is a continuous bilinear map between suitable L^p spaces. Specifically, if 1 ≤ p,q,r ≤ ∞ satisfy

1p+1q=1r+1,{displaystyle {frac {1}{p}}+{frac {1}{q}}={frac {1}{r}}+1,}

then

‖f∗g‖r≤‖f‖p‖g‖q,f∈Lp, g∈Lq,{displaystyle leftVert f*grightVert _{r}leq leftVert frightVert _{p}leftVert grightVert _{q},quad fin {mathcal {L}}^{p}, gin {mathcal {L}}^{q},}

so that the convolution is a continuous bilinear mapping from L^p×L^q to L^r.
The Young inequality for convolution is also true in other contexts (circle group, convolution on Z). The preceding inequality is not sharp on the real line: when 1 < p, q, r < ∞, there exists a constant B_{p, q} < 1 such that:

‖f∗g‖r≤Bp,q‖f‖p‖g‖q,f∈Lp, g∈Lq.{displaystyle leftVert f*grightVert _{r}leq B_{p,q}leftVert frightVert _{p}leftVert grightVert _{q},quad fin {mathcal {L}}^{p}, gin {mathcal {L}}^{q}.}

The optimal value of B_{p, q} was discovered in 1975.^[15]

A stronger estimate is true provided 1 < p, q, r < ∞ :

‖f∗g‖r≤Cp,q‖f‖p‖g‖q,w{displaystyle |f*g|_{r}leq C_{p,q}|f|_{p}|g|_{q,w}}

where ‖g‖q,w{displaystyle |g|_{q,w}} is the weak L^q norm. Convolution also defines a bilinear continuous map Lp,w×Lq.w→Lr,w{displaystyle L^{p,w}times L^{q.w}to L^{r,w}} for 1<p,q,r<∞{displaystyle 1<p,q,r<infty }, owing to the weak Young inequality:^[16]

‖f∗g‖r,w≤Cp,q‖f‖p,w‖g‖r,w.{displaystyle |f*g|_{r,w}leq C_{p,q}|f|_{p,w}|g|_{r,w}.}

Functions of rapid decay

In addition to compactly supported functions and integrable functions, functions that have sufficiently rapid decay at infinity can also be convolved. An important feature of the convolution is that if f and g both decay rapidly, then f∗g also decays rapidly. In particular, if f and g are rapidly decreasing functions, then so is the convolution f∗g. Combined with the fact that convolution commutes with differentiation (see Properties), it follows that the class of Schwartz functions is closed under convolution (Stein & Weiss 1971, Theorem 3.3).

Distributions

Under some circumstances, it is possible to define the convolution of a function with a distribution, or of two distributions. If f is a compactly supported function and g is a distribution, then f∗g is a smooth function defined by a distributional formula analogous to

∫Rdf(y)g(x−y)dy.{displaystyle int _{mathbf {R} ^{d}}{f}(y)g(x-y),dy.}

More generally, it is possible to extend the definition of the convolution in a unique way so that the associative law

f∗(g∗φ)=(f∗g)∗φ{displaystyle f*(g*varphi )=(f*g)*varphi }

remains valid in the case where f is a distribution, and g a compactly supported distribution (Hörmander 1983, §4.2).

Measures

The convolution of any two Borel measures μ and ν of bounded variation is the measure λ defined by (Rudin 1962)

∫Rdf(x)dλ(x)=∫Rd∫Rdf(x+y)dμ(x)dν(y).{displaystyle int _{mathbf {R} ^{d}}f(x)dlambda (x)=int _{mathbf {R} ^{d}}int _{mathbf {R} ^{d}}f(x+y),dmu (x),dnu (y).}

This agrees with the convolution defined above when μ and ν are regarded as distributions, as well as the convolution of L¹ functions when μ and ν are absolutely continuous with respect to the Lebesgue measure.

The convolution of measures also satisfies the following version of Young's inequality

‖μ∗ν‖≤‖μ‖‖ν‖{displaystyle |mu *nu |leq |mu ||nu |}

where the norm is the total variation of a measure. Because the space of measures of bounded variation is a Banach space, convolution of measures can be treated with standard methods of functional analysis that may not apply for the convolution of distributions.

Properties

Algebraic properties

The convolution defines a product on the linear space of integrable functions. This product satisfies the following algebraic properties, which formally mean that the space of integrable functions with the product given by convolution is a commutative associative algebra without identity (Strichartz 1994, §3.3). Other linear spaces of functions, such as the space of continuous functions of compact support, are closed under the convolution, and so also form commutative associative algebras.

Commutativity

f∗g=g∗f{displaystyle f*g=g*f}

Proof: By definition

f∗g=∫−∞∞f(τ)g(t−τ)dτ{displaystyle f*g=int _{-infty }^{infty }f(tau )g(t-tau ),dtau }

Changing the variable of integration to u=t−τ{displaystyle u=t-tau } and the result follows.

Associativity

f∗(g∗h)=(f∗g)∗h{displaystyle f*(g*h)=(f*g)*h}

Proof: This follows from using Fubini's theorem (i.e., double integrals can be evaluated as
iterated integrals in either order).

Distributivity

f∗(g+h)=(f∗g)+(f∗h){displaystyle f*(g+h)=(f*g)+(f*h)}

Proof: This follows from linearity of the integral.

Associativity with scalar multiplication

a(f∗g)=(af)∗g{displaystyle a(f*g)=(af)*g}

for any real (or complex) number a{displaystyle a}.

Multiplicative identity

No algebra of functions possesses an identity for the convolution. The lack of identity is typically not a major inconvenience, since most collections of functions on which the convolution is performed can be convolved with a delta distribution or, at the very least (as is the case of L¹) admit approximations to the identity. The linear space of compactly supported distributions does, however, admit an identity under the convolution. Specifically,

f∗δ=f{displaystyle f*delta =f}

where δ is the delta distribution.

Inverse element

Some distributions have an inverse element for the convolution, S⁽⁻¹⁾, which is defined by

S(−1)∗S=δ.{displaystyle S^{(-1)}*S=delta .}

The set of invertible distributions forms an abelian group under the convolution.

Complex conjugation

f∗g¯=f¯∗g¯{displaystyle {overline {f*g}}={overline {f}}*{overline {g}}}

Relationship with differentiation

(f∗g)′=f′∗g=f∗g′{displaystyle (f*g)'=f'*g=f*g'}

Proof:

(f∗g)′=ddt∫−∞∞f(τ)g(t−τ)dτ=∫−∞∞f(τ)∂∂tg(t−τ)dτ=∫−∞∞f(τ)g′(t−τ)dτ=f∗g′.{displaystyle {begin{aligned}(f*g)'&={frac {d}{dt}}int _{-infty }^{infty }f(tau )g(t-tau ),dtau \[4pt]&=int _{-infty }^{infty }f(tau ){frac {partial }{partial t}}g(t-tau ),dtau \[4pt]&=int _{-infty }^{infty }f(tau )g'(t-tau ),dtau =f*g'.end{aligned}}}

Relationship with integration

If F(t)=∫−∞tf(τ)dτ,{displaystyle F(t)=int _{-infty }^{t}f(tau )dtau ,} and G(t)=∫−∞tg(τ)dτ,{displaystyle G(t)=int _{-infty }^{t}g(tau ),dtau ,} then

(F∗g)(t)=(f∗G)(t)=∫−∞t(f∗g)(τ)dτ.{displaystyle (F*g)(t)=(f*G)(t)=int _{-infty }^{t}(f*g)(tau ),dtau .}

Integration

If f and g are integrable functions, then the integral of their convolution on the whole space is simply obtained as the product of their integrals:

∫Rd(f∗g)(x)dx=(∫Rdf(x)dx)(∫Rdg(x)dx).{displaystyle int _{mathbf {R} ^{d}}(f*g)(x),dx=left(int _{mathbf {R} ^{d}}f(x),dxright)left(int _{mathbf {R} ^{d}}g(x),dxright).}

This follows from Fubini's theorem. The same result holds if f and g are only assumed to be nonnegative measurable functions, by Tonelli's theorem.

Differentiation

In the one-variable case,

ddx(f∗g)=dfdx∗g=f∗dgdx{displaystyle {frac {d}{dx}}(f*g)={frac {df}{dx}}*g=f*{frac {dg}{dx}}}

where d/dx is the derivative. More generally, in the case of functions of several variables, an analogous formula holds with the partial derivative:

∂∂xi(f∗g)=∂f∂xi∗g=f∗∂g∂xi.{displaystyle {frac {partial }{partial x_{i}}}(f*g)={frac {partial f}{partial x_{i}}}*g=f*{frac {partial g}{partial x_{i}}}.}

A particular consequence of this is that the convolution can be viewed as a "smoothing" operation: the convolution of f and g is differentiable as many times as f and g are in total.

These identities hold under the precise condition that f and g are absolutely integrable and at least one of them has an absolutely integrable (L¹) weak derivative, as a consequence of Young's convolution inequality. For instance, when f is continuously differentiable with compact support, and g is an arbitrary locally integrable function,

ddx(f∗g)=dfdx∗g.{displaystyle {frac {d}{dx}}(f*g)={frac {df}{dx}}*g.}

These identities also hold much more broadly in the sense of tempered distributions if one of f or g is a compactly supported distribution or a Schwartz function and the other is a tempered distribution. On the other hand, two positive integrable and infinitely differentiable functions may have a nowhere continuous convolution.

In the discrete case, the difference operator D f(n) = f(n + 1) − f(n) satisfies an analogous relationship:

D(f∗g)=(Df)∗g=f∗(Dg).{displaystyle D(f*g)=(Df)*g=f*(Dg).}

Convolution theorem

The convolution theorem states that

F{f∗g}=k⋅F{f}⋅F{g}{displaystyle {mathcal {F}}{f*g}=kcdot {mathcal {F}}{f}cdot {mathcal {F}}{g}}

where F{f}{displaystyle {mathcal {F}}{f}} denotes the Fourier transform of f{displaystyle f}, and k{displaystyle k} is a constant that depends on the specific normalization of the Fourier transform. Versions of this theorem also hold for the Laplace transform, two-sided Laplace transform, Z-transform and Mellin transform.

See also the less trivial Titchmarsh convolution theorem.

Translational equivariance

The convolution commutes with translations, meaning that

τx(f∗g)=(τxf)∗g=f∗(τxg){displaystyle tau _{x}(f*g)=(tau _{x}f)*g={f}*(tau _{x}g)}

where τ_xf is the translation of the function f by x defined by

(τxf)(y)=f(y−x).{displaystyle (tau _{x}f)(y)=f(y-x).}

If f is a Schwartz function, then τ_xf is the convolution with a translated Dirac delta function τ_xf = f ∗ τ_xδ. So translation invariance of the convolution of Schwartz functions is a consequence of the associativity of convolution.

Furthermore, under certain conditions, convolution is the most general translation invariant operation. Informally speaking, the following holds

• Suppose that S is a bounded linear operator acting on functions which commutes with translations: S(τ_xf) = τ_x(Sf) for all x. Then S is given as convolution with a function (or distribution) g_S; that is Sf = g_S ∗ f.

Thus some translation invariant operations can be represented as convolution. Convolutions play an important role in the study of time-invariant systems, and especially LTI system theory. The representing function g_S is the impulse response of the transformation S.

A more precise version of the theorem quoted above requires specifying the class of functions on which the convolution is defined, and also requires assuming in addition that S must be a continuous linear operator with respect to the appropriate topology. It is known, for instance, that every continuous translation invariant continuous linear operator on L¹ is the convolution with a finite Borel measure. More generally, every continuous translation invariant continuous linear operator on L^p for 1 ≤ p < ∞ is the convolution with a tempered distribution whose Fourier transform is bounded. To wit, they are all given by bounded Fourier multipliers.

Convolutions on groups

If G is a suitable group endowed with a measure λ, and if f and g are real or complex valued integrable functions on G, then we can define their convolution by

(f∗g)(x)=∫Gf(y)g(y−1x)dλ(y).{displaystyle (f*g)(x)=int _{G}f(y)g(y^{-1}x),dlambda (y).}

It is not commutative in general. In typical cases of interest G is a locally compact Hausdorff topological group and λ is a (left-) Haar measure. In that case, unless G is unimodular, the convolution defined in this way is not the same as ∫f(xy−1)g(y)dλ(y){displaystyle textstyle {int f(xy^{-1})g(y),dlambda (y)}}. The preference of one over the other is made so that convolution with a fixed function g commutes with left translation in the group:

Lh(f∗g)=(Lhf)∗g.{displaystyle L_{h}(f*g)=(L_{h}f)*g.}

Furthermore, the convention is also required for consistency with the definition of the convolution of measures given below. However, with a right instead of a left Haar measure, the latter integral is preferred over the former.

On locally compact abelian groups, a version of the convolution theorem holds: the Fourier transform of a convolution is the pointwise product of the Fourier transforms. The circle group T with the Lebesgue measure is an immediate example. For a fixed g in L¹(T), we have the following familiar operator acting on the Hilbert space L²(T):

Tf(x)=12π∫Tf(y)g(x−y)dy.{displaystyle T{f}(x)={frac {1}{2pi }}int _{mathbf {T} }{f}(y)g(x-y),dy.}

The operator T is compact. A direct calculation shows that its adjoint T* is convolution with

g¯(−y).{displaystyle {bar {g}}(-y).}

By the commutativity property cited above, T is normal: T* T = TT* . Also, T commutes with the translation operators. Consider the family S of operators consisting of all such convolutions and the translation operators. Then S is a commuting family of normal operators. According to spectral theory, there exists an orthonormal basis {h_k} that simultaneously diagonalizes S. This characterizes convolutions on the circle. Specifically, we have

hk(x)=eikx,k∈Z,{displaystyle h_{k}(x)=e^{ikx},quad kin mathbb {Z} ,;}

which are precisely the characters of T. Each convolution is a compact multiplication operator in this basis. This can be viewed as a version of the convolution theorem discussed above.

A discrete example is a finite cyclic group of order n. Convolution operators are here represented by circulant matrices, and can be diagonalized by the discrete Fourier transform.

A similar result holds for compact groups (not necessarily abelian): the matrix coefficients of finite-dimensional unitary representations form an orthonormal basis in L² by the Peter–Weyl theorem, and an analog of the convolution theorem continues to hold, along with many other aspects of harmonic analysis that depend on the Fourier transform.

Convolution of measures

Let G be a (multiplicatively written) topological group.
If μ and ν are finite Borel measures on G, then their convolution μ∗ν is defined as the pushforward measure of the group action and can be written as

(μ∗ν)(E)=∬1E(xy)dμ(x)dν(y){displaystyle (mu *nu )(E)=iint 1_{E}(xy),dmu (x),dnu (y)}

for each measurable subset E of G. The convolution is also a finite measure, whose total variation satisfies

‖μ∗ν‖≤‖μ‖‖ν‖.{displaystyle |mu *nu |leq |mu ||nu |.}

In the case when G is locally compact with (left-)Haar measure λ, and μ and ν are absolutely continuous with respect to a λ, so that each has a density function, then the convolution μ∗ν is also absolutely continuous, and its density function is just the convolution of the two separate density functions.

If μ and ν are probability measures on the topological group (R,+), then the convolution μ∗ν is the probability distribution of the sum X + Y of two independent random variables X and Y whose respective distributions are μ and ν.

Bialgebras

Let (X, Δ, ∇, ε, η) be a bialgebra with comultiplication Δ, multiplication ∇, unit η, and counit ε. The convolution is a product defined on the endomorphism algebra End(X) as follows. Let φ, ψ ∈ End(X), that is, φ,ψ : X → X are functions that respect all algebraic structure of X, then the convolution φ∗ψ is defined as the composition

X→ΔX⊗X→ϕ⊗ψX⊗X→∇X.{displaystyle X{xrightarrow {Delta }}Xotimes X{xrightarrow {phi otimes psi }}Xotimes X{xrightarrow {nabla }}X.}

The convolution appears notably in the definition of Hopf algebras (Kassel 1995, §III.3). A bialgebra is a Hopf algebra if and only if it has an antipode: an endomorphism S such that

S∗idX=idX∗S=η∘ε.{displaystyle S*operatorname {id} _{X}=operatorname {id} _{X}*S=eta circ varepsilon .}

Applications

Gaussian blur can be used in order to obtain a smooth grayscale digital image of a halftone print

Convolution and related operations are found in many applications in science, engineering and mathematics.

• In image processing
  

In digital image processing convolutional filtering plays an important role in many important algorithms in edge detection and related processes.

In optics, an out-of-focus photograph is a convolution of the sharp image with a lens function. The photographic term for this is bokeh.

In image processing applications such as adding blurring.

• In digital data processing

In analytical chemistry, Savitzky–Golay smoothing filters are used for the analysis of spectroscopic data. They can improve signal-to-noise ratio with minimal distortion of the spectra.

In statistics, a weighted moving average is a convolution.

• In acoustics, reverberation is the convolution of the original sound with echoes from objects surrounding the sound source.

In digital signal processing, convolution is used to map the impulse response of a real room on a digital audio signal.

In electronic music convolution is the imposition of a spectral or rhythmic structure on a sound. Often this envelope or structure is taken from another sound. The convolution of two signals is the filtering of one through the other.^[17]

• In electrical engineering, the convolution of one function (the input signal) with a second function (the impulse response) gives the output of a linear time-invariant system (LTI). At any given moment, the output is an accumulated effect of all the prior values of the input function, with the most recent values typically having the most influence (expressed as a multiplicative factor). The impulse response function provides that factor as a function of the elapsed time since each input value occurred.


• In physics, wherever there is a linear system with a "superposition principle", a convolution operation makes an appearance. For instance, in spectroscopy line broadening due to the Doppler effect on its own gives a Gaussian spectral line shape and collision broadening alone gives a Lorentzian line shape. When both effects are operative, the line shape is a convolution of Gaussian and Lorentzian, a Voigt function.

In time-resolved fluorescence spectroscopy, the excitation signal can be treated as a chain of delta pulses, and the measured fluorescence is a sum of exponential decays from each delta pulse.

In computational fluid dynamics, the large eddy simulation (LES) turbulence model uses the convolution operation to lower the range of length scales necessary in computation thereby reducing computational cost.

• In probability theory, the probability distribution of the sum of two independent random variables is the convolution of their individual distributions.

In kernel density estimation, a distribution is estimated from sample points by convolution with a kernel, such as an isotropic Gaussian. (Diggle 1995).

• In radiotherapy treatment planning systems, most part of all modern codes of calculation applies a convolution-superposition algorithm.^{[clarification needed]}
  


• 
  Convolutional neural networks apply multiple cascaded convolution kernels with applications in machine vision and artificial intelligence
  


• In structural reliability, the reliability index can be defined based on the convolution theorem.

The definition of reliability index for limit state functions with nonnormal distributions can be established corresponding to the joint distribution function. In fact, the joint distribution function can be obtained using the convolution theory. (Ghasemi-Nowak 2017).

See also

• Analog signal processing


• Circulant matrix


• Convolution for optical broad-beam responses in scattering media


• Convolution power


• Dirichlet convolution


• Generalized signal averaging


• Jan Mikusinski


• List of convolutions of probability distributions


• LTI system theory#Impulse response and convolution


• Multidimensional discrete convolution


• Scaled correlation


• Titchmarsh convolution theorem


• 
  Toeplitz matrix (convolutions can be considered a Toeplitz matrix operation where each row is a shifted copy of the convolution kernel)

Notes

References

• 
  Bracewell, R. (1986), The Fourier Transform and Its Applications (2nd ed.), McGraw–Hill, ISBN 0-07-116043-4.


• 
  Damelin, S.; Miller, W. (2011), The Mathematics of Signal Processing, Cambridge University Press, ISBN 978-1107601048
  


• 
  Diggle, P. J. (1985), "A kernel method for smoothing point process data", Journal of the Royal Statistical Society, Series C, 34: 138–147, doi:10.2307/2347366
  


• Dominguez-Torres, Alejandro (Nov 2, 2010). "Origin and history of convolution". 41 pgs. http://www.slideshare.net/Alexdfar/origin-adn-history-of-convolution. Cranfield, Bedford MK43 OAL, UK. Retrieved Mar 13, 2013.


• 
  Diggle, P. J. (1985), "A kernel method for smoothing point process data", Journal of the Royal Statistical Society, Series C, 34: 138–147, doi:10.2307/2347366
  


• 
  Ghasemi, S. Hooman; Nowak, Andrzej S. (2017), "Reliability Index for Non-normal Distributions of Limit State Functions", Structural Engineering and Mechanics, 62 (3): 365–372, doi:10.12989/sem.2017.62.3.365
  


• 
  Grinshpan, A. Z. (2017), "An inequality for multiple convolutions with respect to Dirichlet probability measure", Advances in Applied Mathematics, 82 (1): 102–119, doi:10.1016/j.aam.2016.08.001
  


• 
  Hewitt, Edwin; Ross, Kenneth A. (1979), Abstract harmonic analysis. Vol. I, Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], 115 (2nd ed.), Berlin, New York: Springer-Verlag, ISBN 978-3-540-09434-0, MR 0551496.


• 
  Hewitt, Edwin; Ross, Kenneth A. (1970), Abstract harmonic analysis. Vol. II: Structure and analysis for compact groups. Analysis on locally compact Abelian groups, Die Grundlehren der mathematischen Wissenschaften, Band 152, Berlin, New York: Springer-Verlag, MR 0262773.


• 
  Hörmander, L. (1983), The analysis of linear partial differential operators I, Grundl. Math. Wissenschaft., 256, Springer, doi:10.1007/978-3-642-96750-4, ISBN 3-540-12104-8, MR 0717035.


• 
  Kassel, Christian (1995), Quantum groups, Graduate Texts in Mathematics, 155, Berlin, New York: Springer-Verlag, doi:10.1007/978-1-4612-0783-2, ISBN 978-0-387-94370-1, MR 1321145.


• 
  Knuth, Donald (1997), Seminumerical Algorithms (3rd. ed.), Reading, Massachusetts: Addison–Wesley, ISBN 0-201-89684-2.


• 
  Reed, Michael; Simon, Barry (1975), Methods of modern mathematical physics. II. Fourier analysis, self-adjointness, New York-London: Academic Press Harcourt Brace Jovanovich, Publishers, pp. xv+361, ISBN 0-12-585002-6, MR 0493420
  


• 
  Rudin, Walter (1962), Fourier analysis on groups, Interscience Tracts in Pure and Applied Mathematics, No. 12, Interscience Publishers (a division of John Wiley and Sons), New York–London, ISBN 0-471-52364-X, MR 0152834.


• 
  Sobolev, V.I. (2001) [1994], "Convolution of functions", in Hazewinkel, Michiel, Encyclopedia of Mathematics, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4.


• 
  Stein, Elias; Weiss, Guido (1971), Introduction to Fourier Analysis on Euclidean Spaces, Princeton University Press, ISBN 0-691-08078-X.


• 
  Strichartz, R. (1994), A Guide to Distribution Theory and Fourier Transforms, CRC Press, ISBN 0-8493-8273-4.


• 
  Titchmarsh, E (1948), Introduction to the theory of Fourier integrals (2nd ed.), New York, N.Y.: Chelsea Pub. Co. (published 1986), ISBN 978-0-8284-0324-5.


• 
  Uludag, A. M. (1998), "On possible deterioration of smoothness under the operation of convolution", J. Math. Anal. Appl. 227 no. 2, 335–358
  


• 
  Treves, François (1967), Topological Vector Spaces, Distributions and Kernels, Academic Press, ISBN 0-486-45352-9.


• 
  von zur Gathen, J.; Gerhard, J. (2003), Modern Computer Algebra, Cambridge University Press, ISBN 0-521-82646-2.

External links

Look up convolution in Wiktionary, the free dictionary.

Wikimedia Commons has media related to Convolution.

• Earliest Uses: The entry on Convolution has some historical information.


• 
  Convolution, on The Data Analysis BriefBook
  


• 
  http://www.jhu.edu/~signals/convolve/index.html Visual convolution Java Applet


• 
  http://www.jhu.edu/~signals/discreteconv2/index.html Visual convolution Java Applet for discrete-time functions


• 
  Lectures on Image Processing: A collection of 18 lectures in pdf format from Vanderbilt University. Lecture 7 is on 2-D convolution., by Alan Peters


• * https://archive.org/details/Lectures_on_Image_Processing
  


• Convolution Kernel Mask Operation Interactive tutorial


• 
  Convolution at MathWorld
  


• 
  Freeverb3 Impulse Response Processor: Opensource zero latency impulse response processor with VST plugins


• Stanford University CS 178 interactive Flash demo showing how spatial convolution works.


• 
  A video lecture on the subject of convolution given by Salman Khan