Convolution theorem

From HandWiki
Short description: Theorem in mathematics

In mathematics, the convolution theorem states that under suitable conditions the Fourier transform of a convolution of two functions (or signals) is the pointwise product of their Fourier transforms. More generally, convolution in one domain (e.g., time domain) equals point-wise multiplication in the other domain (e.g., frequency domain). Other versions of the convolution theorem are applicable to various Fourier-related transforms.

Functions of a continuous variable

Consider two functions [math]\displaystyle{ g(x) }[/math] and [math]\displaystyle{ h(x) }[/math] with Fourier transforms [math]\displaystyle{ G }[/math] and [math]\displaystyle{ H }[/math]: [math]\displaystyle{ \begin{align} G(f) &\triangleq \mathcal{F}\{g\}(f) = \int_{-\infty}^{\infty}g(x) e^{-i 2 \pi f x} \, dx, \quad f \in \mathbb{R}\\ H(f) &\triangleq \mathcal{F}\{h\}(f) = \int_{-\infty}^{\infty}h(x) e^{-i 2 \pi f x} \, dx, \quad f \in \mathbb{R} \end{align} }[/math] where [math]\displaystyle{ \mathcal{F} }[/math] denotes the Fourier transform operator. The transform may be normalized in other ways, in which case constant scaling factors (typically [math]\displaystyle{ 2\pi }[/math] or [math]\displaystyle{ \sqrt{2\pi} }[/math]) will appear in the convolution theorem below. The convolution of [math]\displaystyle{ g }[/math] and [math]\displaystyle{ h }[/math] is defined by: [math]\displaystyle{ r(x) = \{g*h\}(x) \triangleq \int_{-\infty}^{\infty} g(\tau) h(x-\tau)\, d\tau = \int_{-\infty}^{\infty} g(x-\tau) h(\tau)\, d\tau. }[/math]

In this context the asterisk denotes convolution, instead of standard multiplication. The tensor product symbol [math]\displaystyle{ \otimes }[/math] is sometimes used instead.

The convolution theorem states that:[1][2]:eq.8

[math]\displaystyle{ R(f) \triangleq \mathcal{F}\{r\}(f) = G(f) H(f). \quad f \in \mathbb{R} }[/math]

 

 

 

 

(Eq.1a)

Applying the inverse Fourier transform [math]\displaystyle{ \mathcal{F}^{-1} }[/math], produces the corollary:[2]:eqs.7,10

Convolution theorem

[math]\displaystyle{ r(x) = \{g*h\}(x) = \mathcal{F}^{-1}\{G\cdot H\}, }[/math]

 

 

 

 

(Eq.1b)

where [math]\displaystyle{ \cdot }[/math] denotes point-wise multiplication

The theorem also generally applies to multi-dimensional functions.

This theorem also holds for the Laplace transform, the two-sided Laplace transform and, when suitably modified, for the Mellin transform and Hartley transform (see Mellin inversion theorem). It can be extended to the Fourier transform of abstract harmonic analysis defined over locally compact abelian groups.

Periodic convolution (Fourier series coefficients)

Consider [math]\displaystyle{ P }[/math]-periodic functions [math]\displaystyle{ g_{_P} }[/math] and [math]\displaystyle{ h_{_P}, }[/math] which can be expressed as periodic summations: [math]\displaystyle{ g_{_P}(x)\ \triangleq \sum_{m=-\infty}^{\infty} g(x-mP) }[/math]   and   [math]\displaystyle{ h_{_P}(x)\ \triangleq \sum_{m=-\infty}^{\infty} h(x-mP). }[/math]

In practice the non-zero portion of components [math]\displaystyle{ g }[/math] and [math]\displaystyle{ h }[/math] are often limited to duration [math]\displaystyle{ P, }[/math] but nothing in the theorem requires that. The Fourier series coefficients are: [math]\displaystyle{ \begin{align} G[k] &\triangleq \mathcal{F}\{g_{_P}\}[k] = \frac{1}{P} \int_P g_{_P}(x) e^{-i 2\pi k x/P} \, dx, \quad k \in \mathbb{Z}; \quad \quad \scriptstyle \text{integration over any interval of length } P\\ H[k] &\triangleq \mathcal{F}\{h_{_P}\}[k] = \frac{1}{P} \int_P h_{_P}(x) e^{-i 2\pi k x/P} \, dx, \quad k \in \mathbb{Z} \end{align} }[/math] where [math]\displaystyle{ \mathcal{F} }[/math] denotes the Fourier series integral.

  • The pointwise product: [math]\displaystyle{ g_{_P}(x)\cdot h_{_P}(x) }[/math] is also [math]\displaystyle{ P }[/math]-periodic, and its Fourier series coefficients are given by the discrete convolution of the [math]\displaystyle{ G }[/math] and [math]\displaystyle{ H }[/math] sequences: [math]\displaystyle{ \mathcal{F}\{g_{_P}\cdot h_{_P}\}[k] = \{G*H\}[k]. }[/math]
  • The convolution: [math]\displaystyle{ \begin{align} \{g_{_P} * h\}(x)\ &\triangleq \int_{-\infty}^{\infty} g_{_P}(x-\tau)\cdot h(\tau)\ d\tau\\ &\equiv \int_P g_{_P}(x-\tau)\cdot h_{_P}(\tau)\ d\tau; \quad \quad \scriptstyle \text{integration over any interval of length } P \end{align} }[/math]is also [math]\displaystyle{ P }[/math]-periodic,[upper-alpha 1] and is called a periodic convolution. The corresponding convolution theorem is:

[math]\displaystyle{ \mathcal{F}\{g_{_P} * h\}[k] =\ P\cdot G[k]\ H[k]. }[/math]

 

 

 

 

(Eq.2)

Functions of a discrete variable (sequences)

By a derivation similar to Eq.1, there is an analogous theorem for sequences, such as samples of two continuous functions, where now [math]\displaystyle{ \mathcal{F} }[/math] denotes the discrete-time Fourier transform (DTFT) operator. Consider two sequences [math]\displaystyle{ g[n] }[/math] and [math]\displaystyle{ h[n] }[/math] with transforms [math]\displaystyle{ G }[/math] and [math]\displaystyle{ H }[/math]: [math]\displaystyle{ \begin{align} G(f) &\triangleq \mathcal{F}\{g\}(f) = \sum_{n=-\infty}^{\infty} g[n]\cdot e^{-i 2\pi f n}\;, \quad f \in \mathbb{R}\\ H(f) &\triangleq \mathcal{F}\{h\}(f) = \sum_{n=-\infty}^{\infty} h[n]\cdot e^{-i 2\pi f n}\;. \quad f \in \mathbb{R} \end{align} }[/math]

The § Discrete convolution of [math]\displaystyle{ g }[/math] and [math]\displaystyle{ h }[/math] is defined by: [math]\displaystyle{ r[n] \triangleq (g * h)[n] = \sum_{m=-\infty}^\infty g[m]\cdot h[n - m] = \sum_{m=-\infty}^\infty g[n-m]\cdot h[m]. }[/math]

The convolution theorem for discrete sequences is:[3][4]:p.60 (2.169)

[math]\displaystyle{ R(f) = \mathcal{F}\{g * h\}(f) =\ G(f) H(f). }[/math]

 

 

 

 

(Eq.3)

Periodic convolution

[math]\displaystyle{ G(f) }[/math] and [math]\displaystyle{ H(f), }[/math] as defined above, are periodic, with a period of 1. Consider [math]\displaystyle{ N }[/math]-periodic sequences [math]\displaystyle{ g_{_N} }[/math] and [math]\displaystyle{ h_{_N} }[/math]: [math]\displaystyle{ g_{_N}[n]\ \triangleq \sum_{m=-\infty}^{\infty} g[n-mN] }[/math]   and   [math]\displaystyle{ h_{_N}[n]\ \triangleq \sum_{m=-\infty}^{\infty} h[n-mN], \quad n \in \mathbb{Z}. }[/math]

These functions occur as the result of sampling [math]\displaystyle{ G }[/math] and [math]\displaystyle{ H }[/math] at intervals of [math]\displaystyle{ 1/N }[/math] and performing an inverse discrete Fourier transform (DFT) on [math]\displaystyle{ N }[/math] samples (see § Sampling the DTFT). The discrete convolution: [math]\displaystyle{ \{g_{_N} * h\}[n]\ \triangleq \sum_{m=-\infty}^{\infty} g_{_N}[m]\cdot h[n-m] \equiv \sum_{m=0}^{N-1} g_{_N}[m]\cdot h_{_N}[n-m] }[/math]

is also [math]\displaystyle{ N }[/math]-periodic, and is called a periodic convolution. Redefining the [math]\displaystyle{ \mathcal{F} }[/math] operator as the [math]\displaystyle{ N }[/math]-length DFT, the corresponding theorem is:[5][4]:p.548

[math]\displaystyle{ \mathcal{F}\{g_{_N} * h\}[k] =\ \underbrace{\mathcal{F}\{g_{_N}\}[k]}_{G(k/N)} \cdot \underbrace{\mathcal{F}\{h_{_N}\}[k]}_{H(k/N)}, \quad k \in \mathbb{Z}. }[/math]

 

 

 

 

(Eq.4a)

And therefore:

[math]\displaystyle{ \{g_{_N} * h\}[n] =\ \mathcal{F}^{-1}\{\mathcal{F}\{g_{_N}\} \cdot \mathcal{F}\{h_{_N}\}\}. }[/math]

 

 

 

 

(Eq.4b)

Under the right conditions, it is possible for this N-length sequence to contain a distortion-free segment of a [math]\displaystyle{ g*h }[/math] convolution. But when the non-zero portion of the [math]\displaystyle{ g(n) }[/math] or [math]\displaystyle{ h(n) }[/math] sequence is equal or longer than [math]\displaystyle{ N, }[/math] some distortion is inevitable.  Such is the case when the [math]\displaystyle{ H(k/N) }[/math] sequence is obtained by directly sampling the DTFT of the infinitely long § Discrete Hilbert transform impulse response.[upper-alpha 2]

For [math]\displaystyle{ g }[/math] and [math]\displaystyle{ h }[/math] sequences whose non-zero duration is less than or equal to [math]\displaystyle{ N, }[/math] a final simplification is:

Circular convolution

[math]\displaystyle{ \{g_{_N} * h\}[n] =\ \mathcal{F}^{-1}\{\mathcal{F}\{g\} \cdot \mathcal{F}\{h\}\}. }[/math]

 

 

 

 

(Eq.4c)

This form is often used to efficiently implement numerical convolution by computer. (see § Fast convolution algorithms and § Example)

As a partial reciprocal, it has been shown [6] that any linear transform that turns convolution into pointwise product is the DFT (up to a permutation of coefficients).

Convolution theorem for inverse Fourier transform

There is also a convolution theorem for the inverse Fourier transform: [math]\displaystyle{ \mathcal{F}\{g*h\} = \mathcal{F}\{g\} \cdot \mathcal{F}\{h\} }[/math] [math]\displaystyle{ \mathcal{F}\{g \cdot h\}= \mathcal{F}\{g\}*\mathcal{F}\{h\} }[/math] so that [math]\displaystyle{ g*h= \mathcal{F}^{-1}\left\{\mathcal{F}\{g\}\cdot\mathcal{F}\{h\}\right\} }[/math] [math]\displaystyle{ g \cdot h= \mathcal{F}^{-1}\left\{\mathcal{F}\{g\}*\mathcal{F}\{h\}\right\} }[/math]

Convolution theorem for tempered distributions

The convolution theorem extends to tempered distributions. Here, [math]\displaystyle{ g }[/math] is an arbitrary tempered distribution (e.g. the Dirac comb) [math]\displaystyle{ \mathcal{F}\{f*g\} = \mathcal{F}\{f\} \cdot \mathcal{F}\{g\} }[/math] [math]\displaystyle{ \mathcal{F}\{\alpha \cdot g\}= \mathcal{F}\{\alpha\}*\mathcal{F}\{g\} }[/math] but [math]\displaystyle{ f = F\{\alpha\} }[/math] must be "rapidly decreasing" towards [math]\displaystyle{ -\infty }[/math] and [math]\displaystyle{ +\infty }[/math] in order to guarantee the existence of both, convolution and multiplication product. Equivalently, if [math]\displaystyle{ \alpha = F^{-1}\{f\} }[/math] is a smooth "slowly growing" ordinary function, it guarantees the existence of both, multiplication and convolution product.[7][8][9]

In particular, every compactly supported tempered distribution, such as the Dirac Delta, is "rapidly decreasing". Equivalently, bandlimited functions, such as the function that is constantly [math]\displaystyle{ 1 }[/math] are smooth "slowly growing" ordinary functions. If, for example, [math]\displaystyle{ g\equiv\operatorname{III} }[/math] is the Dirac comb both equations yield the Poisson summation formula and if, furthermore, [math]\displaystyle{ f\equiv\delta }[/math] is the Dirac delta then [math]\displaystyle{ \alpha \equiv 1 }[/math] is constantly one and these equations yield the Dirac comb identity.

See also

Notes

  1. Proof: [math]\displaystyle{ \begin{align} \int_{-\infty}^\infty g_{_P}(x - \tau) \cdot h(\tau)\,d\tau &= \sum_{k=-\infty}^\infty \left[\int_{x_o+kP}^{x_o+(k+1)P} g_{_P}(x - \tau) \cdot h(\tau)\ d\tau\right] \quad x_0 \text{ is an arbitrary parameter}\\ &=\sum_{k=-\infty}^\infty \left[\int_{x_o}^{x_o+P} \underbrace{g_{_P}(x - \tau-kP)}_{g_{_P}(x - \tau), \text{ by periodicity}} \cdot h(\tau + kP)\ d\tau\right] \quad \text{substituting } \tau \rightarrow \tau+kP\\ &=\int_{x_o}^{x_o+P} g_{_P}(x - \tau) \cdot \underbrace{\left[\sum_{k=-\infty}^\infty h(\tau + kP)\right]}_{\triangleq \ h_{_P}(\tau)}\ d\tau \end{align} }[/math]
  2. An example is the MATLAB function, hilbert(g,N).

References

  1. McGillem, Clare D.; Cooper, George R. (1984). Continuous and Discrete Signal and System Analysis (2 ed.). Holt, Rinehart and Winston. p. 118 (3-102). ISBN 0-03-061703-0. 
  2. 2.0 2.1 Weisstein, Eric W.. "Convolution Theorem". https://mathworld.wolfram.com/ConvolutionTheorem.html. 
  3. Proakis, John G.; Manolakis, Dimitri G. (1996) (in en), Digital Signal Processing: Principles, Algorithms and Applications (3 ed.), New Jersey: Prentice-Hall International, p. 297, sAcfAQAAIAAJ, ISBN 9780133942897, Bibcode1996dspp.book.....P, https://archive.org/details/digitalsignalpro00proa 
  4. 4.0 4.1 Oppenheim, Alan V.; Schafer, Ronald W.; Buck, John R. (1999). Discrete-time signal processing (2nd ed.). Upper Saddle River, N.J.: Prentice Hall. ISBN 0-13-754920-2. https://archive.org/details/discretetimesign00alan.   Also available at https://d1.amobbs.com/bbs_upload782111/files_24/ourdev_523225.pdf
  5. Rabiner, Lawrence R.; Gold, Bernard (1975). Theory and application of digital signal processing. Englewood Cliffs, NJ: Prentice-Hall, Inc.. p. 59 (2.163). ISBN 978-0139141010. https://archive.org/details/theoryapplicatio00rabi. 
  6. Amiot, Emmanuel (2016). Music through Fourier Space. Zürich: Springer. p. 8. ISBN 978-3-319-45581-5. https://link.springer.com/book/10.1007/978-3-319-45581-5. 
  7. Horváth, John (1966). Topological Vector Spaces and Distributions. Reading, MA: Addison-Wesley Publishing Company. 
  8. Barros-Neto, José (1973). An Introduction to the Theory of Distributions. New York, NY: Dekker. 
  9. Petersen, Bent E. (1983). Introduction to the Fourier Transform and Pseudo-Differential Operators. Boston, MA: Pitman Publishing. 

Further reading

Additional resources

For a visual representation of the use of the convolution theorem in signal processing, see:

de:Faltung (Mathematik)#Faltungstheorem 2 fr:Produit de convolution