How to do convolution in Fourier Series?

1. What is convolution in Fourier series?
2. How do you use convolution in FFT?
3. What is the Fourier transform of a convolution?

What is convolution in Fourier series?

The convolution theorem (together with related theorems) is one of the most important results of Fourier theory which is that the convolution of two functions in real space is the same as the product of their respective Fourier transforms in Fourier space, i.e. f ( r ) ⊗ ⊗ g ( r ) ⇔ F ( k ) G ( k ) .

How do you use convolution in FFT?

FFT convolution uses the principle that multiplication in the frequency domain corresponds to convolution in the time domain. The input signal is transformed into the frequency domain using the DFT, multiplied by the frequency response of the filter, and then transformed back into the time domain using the Inverse DFT.

What is the Fourier transform of a convolution?

We've just shown that the Fourier Transform of the convolution of two functions is simply the product of the Fourier Transforms of the functions. This means that for linear, time-invariant systems, where the input/output relationship is described by a convolution, you can avoid convolution by using Fourier Transforms.