The Fourier Transform, named in honor of the French mathematician and physicist Jean Baptiste Joseph Fourier (1768-1830), who in 1807 claimed that any function could be expanded as a series of sinusoidal waves of appropriate amplitude and phase in his "Théorie analytique de la chaleur" (published 1822.)

The main idea behind the Fourier transform is to represent a periodic function, image002x, as an infinite series of trigonometric functions, such that

image004x

or in exponential form:

image006x

where image008x is the interval for which image002x makes one period, image012x and image014x are called Fourier coefficients, image016x is called the fundamental frequency and the image026x coefficients are complex.

Although Fourier claims where not entirely true for all continuous functions, it does a perfect representation of discrete signals. In this case, the summation takes place a finite number of times and the Fourier transform, which is then termed the discrete Fourier transform, is said to have such a degree:

image018x

The Fourier coefficients for a discrete signal can be found as follows:

image020x

Because the Fourier transform breaks a function into its set of amplitudes and phases for the sine and cosine functions at a given number of frequencies, it is said that the Fourier transform decomposes a signal into its frequency components, hence the terminology frequency domain representation. In this context, the power of a discrete signal at any frequency multiple image022x is given by:

image024x

 

 

Sponsored

Try Predictive Systems Lab

Interactive Demo →

Need Help?
Contact support