TOPICS
Search

Convolution Theorem


Let f(t) and g(t) be arbitrary functions of time t with Fourier transforms. Take

where F_nu^(-1)(t) denotes the inverse Fourier transform (where the transform pair is defined to have constants A=1 and B=-2pi). Then the convolution is

Interchange the order of integration,

So, applying a Fourier transform to each side, we have

F[f*g]=F[f]F[g].
(8)

The convolution theorem also takes the alternate forms

F[fg] = F[f]*F[g]
(9)
F^(-1)(F[f]F[g]) = f*g
(10)
F^(-1)(F[f]*F[g]) = fg.
(11)

See also

Autocorrelation, Convolution, Fourier Transform, Wiener-Khinchin Theorem

Explore with Wolfram|Alpha

References

Arfken, G. "Convolution Theorem." §15.5 in Mathematical Methods for Physicists, 3rd ed. Orlando, FL: Academic Press, pp. 810-814, 1985.Bracewell, R. "Convolution Theorem." The Fourier Transform and Its Applications, 3rd ed. New York: McGraw-Hill, pp. 108-112, 1999.

Referenced on Wolfram|Alpha

Convolution Theorem

Cite this as:

Weisstein, Eric W. "Convolution Theorem." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/ConvolutionTheorem.html

Subject classifications

AltStyle によって変換されたページ (->オリジナル) /