| Disclaimer: The information on this page has not been checked by an independent person. Use this information at your own risk. |
Click arrows to page adverts
Home
Maths Index
Fourier index
|
Introduction The notes on this page are provided to simply describe convolutions and their application with respect to Continuous Fourier Transforms and Discrete Fourier Transforms.
The convolution process is completed in four steps as illustrated in the figure below 1 ) Obtain f2 ( - u ). The process is illustrated by a very simple example. two simple example function f1 ( u ) and f2 ( u ) are shown below
1 ) Obtain f2 (-u). 2) Obtain f2 ( x - u ).
3 ) Consider all possible cases of x from
4 ) Plot of the integral . This is the integral of the product of the overlapping part of the two functions.
Convolution process with f1 ( u ) = 1 and f2 ( u ) = e -u
An illustration is provided below of the convolution of a one four point input signal x(n) with an eight point response h(n) resulting in a 4+8-1 = 11 point output signal. y(n)
The above output signal is effectively the sum of four seperate signal responses x(0)*h(0) + x(1)*h(n-1) + x(2)*h(n-2) + x(3)*h(n-3). In mathematical terms, x(n) is convolved with h(n) to produce y(n) . Each of the four samples in the input signal contributes a scaled and shifted version of the impulse response to the output signal. The four versions are shown below.
|
Useful Related Links
|
|
Home
Maths Index
Fourier index
Send Comments to Roy Beardmore
Last Updated 14/03/2009