Convolution Article Index for
Convolution 		Articles about
Convolution 		 

Information About

Convolution
  CATEGORIES ABOUT CONVOLUTION
   
functional analysis
   
image processing
   
binary operations
   
fourier analysis
   
APPAREL
BABY
BEAUTY
BOOKS
CAR TOYS
CELL PHONES
DVD'S
ELECTRONICS
GOURMET FOOD
GROCERIES
HEALTH & PERSONAL
HOME & GARDEN
JEWELRY
MUSIC
MUSIC INSTRUMENTS
OFFICE PRODUCTS
SOFTWARE
SPORTING GOODS
TOOLS & HARDWARE
TOYS
VIDEO GAMES
SHOPPING HOME
MORE SHOPPING...



In Mathematics and, in particular, Functional Analysis , convolution is a mathematical Operator which takes two Function s ''f'' and ''g'' and produces a third function that in a sense represents the amount of overlap between ''f'' and a reversed and translated version of ''g''.

Typically, one of the functions is taken to be a fixed filter Impulse Response , and is known as a ''kernel''. Such a convolution is a kind of generalized Moving Average , as one can see by taking the kernel to be an Indicator Function of an Interval .
(in this case au) and make each waveform a function of this variable. Second, time-invert one of the waveforms (it does not matter which) and add ''t''. This allows the function to "slide" back and forth on the au-axis while remaining stationary with respect to ''t''. (The front edge of the "travelling" waveform is always ''t–1'' in this case.) Finally, start one function at negative infinity and slide it all the way to positive infinity. Wherever the two functions intersect, find the integral of their product. The resulting waveform (not shown here) is the convolution of the two functions.]]


DEFINITION

  • g \,. 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 :


  • g )(t) = \int_{a}^{b} f( au) g(t - au)\, d au


The integration range depends on the Domain on which the functions are defined; often a = -∞ and b = +∞. While the symbol t\, is used above, it need not represent the time domain. In the case of a finite integration range, f\, and g\, are often considered to extend Periodic ally in both directions, so that the term \displaystyle g(t- au) does not imply a range violation. This use of periodic domains is sometimes called a cyclic, '''circular''' Or '''periodic Convolution''' . Of course, extension with zeros is also possible. Using zero-extended or infinite domains is sometimes called a '''linear convolution''', especially in the discrete case below.


DISCRETE CONVOLUTION



Normal convolution

For discrete functions, one can use a discrete version of the convolution. It is given by

  • g)(m) = \sum_n {f(n) g(m - n)} \,


When multiplying two Polynomial s, the coefficients of the product are given by the convolution of the original coefficient Sequence s, in this sense (using extension with zeros as mentioned above).

Generalizing the above cases, the convolution can be defined for any two Integrable functions defined on a Locally Compact Topological Group (see '' Convolutions On Groups '' below).

A different generalization is the convolution of Distribution s.

Evaluating discrete convolutions takes O (''N''2) arithmetic operations.


Fast convolution

In practice, Digital Signal Processing typically uses fast convolution to increase the speed of the convolution.

Calculating convolution via a fast convolution algorithm consists of taking the fast Fourier transform (see FFT ) of two separate sequences, multiplying them together, and then computing the inverse fast Fourier transform, known as the IFFT .

Fast convolution can be implemented using Circular Convolution .

When using large sequences, evaluating fast discrete convolutions takes O(''N'' log ''N'') arithmetical operations.


PROPERTIES



Commutativity

  • g = g --- f \,



Associativity

  • (g --- h) = (f --- g) --- h \,



Distributivity

  • (g + h) = (f --- g) + (f --- h) \,



Identity element

  • \delta = \delta --- f = f \,

    • where δ denotes the Dirac Delta



Associativity with scalar multiplication

  • g) = (a f) --- g = f --- (a g) \,

    • for any real (or complex) number a\,.



Differentiation rule

  • g) = \mathcal{D}f --- g = f --- \mathcal{D}g \,

    • where \mathcal{D}f denotes the Derivative of f or, in the discrete case, the Difference Operator

\mathcal{D}f(n) = f(n+1) - f(n). Consequently, convolution can be viewed as a "smoothing" operation: the convolution of ''f'' and ''g'' is differentiable as many times as either ''f'' or ''g'' is, whichever is greater.


Convolution theorem

The Convolution Theorem states that


where \mathcal{F}(f)\, denotes the Fourier Transform of f, and k is a constant which depends upon the specific Normalization of the Fourier transform (e.g., k=1 if \mathcal{F}\left[f(x) ight]\equiv\int^\infty_{-\infty}f(x)\exp(\pm 2 \pi i x \xi)dx). Versions of this theorem also hold for the Laplace Transform , Two-sided Laplace Transform , Z-transform and Mellin Transform .

See also less trivial Titchmarsh Convolution Theorem .


CONVOLUTIONS ON GROUPS

If ''G'' is a suitable Group endowed with a Measure ''m'' (for instance, a Locally Compact Hausdorff Topological Group with the Haar Measure ) and if ''f'' and ''g'' are real or complex valued m- Integrable functions of G, then we can define their convolution by

  • g)(x) = \int_G f(y)g(xy^{-1})\,dm(y) \,


The Circle Group T with the Lebesgue measure is an immediate example. For a fixed ''g'' in ''L''1(T), we have the following familiar operator acting on the Hilbert Space ''L''2(T):

:T f(x) = rac{1}{2 \pi} \int_{\mathbb{T}} f(y) g( x - y) dy.

  • '' is convolution with


:\bar{g}(-y).

  • T = TT---''. Also, ''T'' commutes with the translation operators. Consider the family ''S'' of operators consisting of all such convolutions and the translation operators. ''S'' is a commuting family of normal operators. According to Spectral Theory , there exists an orthonormal basis {''hk''} that simultaneously diagonalizes ''S''. This characterizes convolutions on the circle. Specifically, we have


:h_k (x) = e^{ikx},\;

which are precisely the Character s 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.

The above example may convince one that convolutions arise naturally in the context of Harmonic Analysis on groups. For more general groups, it is also possible to give, for instance, a Convolution Theorem, however it is much more difficult to phrase and requires Representation Theory for these types of groups and the Peter-Weyl Theorem . It is very difficult to do these calculations without more structure, and Lie Group s turn out to be the setting in which these things are done.


CONVOLUTION OF MEASURES

  •  ν is defined by



    • u)(A) = (\mu imes

u)(\{\, (x,y) \in \mathbb{R}^2 \,:\, x+y \in A \,\}).

  •  ν is also absolutely continuous, and its density function is just the convolution of the two separate density functions.




APPLICATIONS

Convolution and related operations are found in many applications of engineering and mathematics.
  • In Statistics , as noted above, a weighted Moving Average is a convolution.

  • In Probability Theory , the Probability Distribution of the sum of two Independent Random Variable s is the convolution of their individual distributions.

  • In Optics , many kinds of "blur" are described by convolutions. A shadow (e.g. the shadow on the table when you hold your hand between the table and a light source) is the convolution of the Shape of the light source that is casting the shadow and the object whose shadow is being cast. An out-of-focus photograph is the convolution of the sharp image with the shape of the iris diaphragm. The photographic term for this is Bokeh .

  • Similarly, in Digital Image Processing , convolutional filtering plays an important role in many important Algorithm s in Edge Detection and related processes.

  • In linear Acoustics , an echo is the convolution of the original sound with a function representing the various objects that are reflecting it.

  • In artificial Reverberation ( Digital Signal Processing , pro audio), convolution is used to map the Impulse Response of a real room on a digital audio signal (see previous and next point for additional information).

  • In electrical engineering and other disciplines, the output (response) of a (stationary, or time- or space- Invariant ) Linear System is the convolution of the input (excitation) with the system's response to an impulse or Dirac Delta function. See LTI System Theory and Digital Signal Processing .

  • 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 Physics , wherever there is a Linear System with a " Superposition Principle ", a convolution operation makes an appearance.

  • This is the fundamental problem term in the Navier Stokes Equations relating to the Clay Institute Of Mathematics Millennium Problem and the associated million dollar prize.

  • In digital signal processing, frequency filtering can be simplified by convolving two functions (data with a filter) in the time domain, which is analogous to multiplying the data with a filter in the frequency domain.



SEE ALSO



EXTERNAL LINKS