The English used in this article or section may not be easy for everybody to understand. (May 2012)
The Fourier transform is a mathematical function that can be used to find the base frequencies that a wave is made of. Imagine playing a chord on a piano. When played, the sounds of the notes of the chord mix together and form a sound wave. This works because each of the different note's waves interfere with each other by adding together or canceling out at different points in the wave. A Fourier transform takes this complex wave and is able to find the frequencies that made it, meaning it can find the notes that a chord is made from.
The output of a Fourier transform is sometimes called a frequency spectrum or distribution because it displays a distribution of possible frequencies of the input. This function has many uses in cryptography, oceanography, machine learning, radiology, quantum physics as well as sound design and visualization.
The Fourier transform of a function , sometimes written as , is given by
- is a frequency.
- is the Fourier transform function and returns a value representing how prevalent frequency is in the original signal.
- represents wrapping the input wave function around the origin of the complex plane at some frequency .
The inverse Fourier transform is given by
A Fourier transform shows what frequencies are in a signal. For example, consider a sound wave which contains three different musical notes: A, B, and C. Making a graph of the Fourier transform of this sound wave (with the frequency on the x-axis and the intensity on the y-axis) will show a peak at each frequency which corresponds with one of the musical notes.
Many signals can be created by adding cosines and sines together with varying amplitudes and frequencies. The Fourier transform plots the amplitudes and phases of these cosines and sines against their respective frequencies.
Fourier transforms are important, because many signals make more sense when their frequencies are separated. In the audio example above, looking at the signal with respect to time does not make it obvious that the notes A, B, and C are in the signal. Many systems do different things to different frequencies, so these kinds of systems can be described by what they do to each frequency. An example of this is a filter which blocks high frequencies.
Calculating a Fourier transform requires understanding of integration and imaginary numbers. Computers are usually used to calculate Fourier transforms of anything but the simplest signals. The Fast Fourier Transform is a method computers use to quickly calculate a Fourier transform.
Related pages[change | change source]
References[change | change source]
- ↑ "List of Calculus and Analysis Symbols". Math Vault. 2020-05-11. Retrieved 2020-10-15.
- ↑ Weisstein, Eric W. "Fourier Transform". mathworld.wolfram.com. Retrieved 2020-10-15.
Other websites[change | change source]
- Media related to Fourier transformation at Wikimedia Commons