Difference between revisions of "Fourier Transform"
Jump to navigation
Jump to search
| Line 1: | Line 1: | ||
{{WikiEntry|key=Fourier Transform|qCode=6520159}} is a | =[[Fourier transform]]= | ||
{{WikiEntry|key=Fourier Transform|qCode=6520159}} | |||
[[Fourier transform]] is the next level of the Fourier Series, it comes up with a way to approximate hole functions by using exponentials <math>e^{ikx}</math> that means, unlike Fourier Series can only approximate a function on an interval, now we can approximate functions that are infinitely long. | |||
Fourier transforms integral equation : | |||
<math>\hat{f}(\xi) = \int_{-\infty}^{\infty} f(x)\ e^{-i 2\pi \xi x}\,dx,\quad \forall\ \xi \in \mathbb R.</math> | |||
Example for Fourier transform: | |||
We have a signal called <math>x(t)</math> we will represent it in terms of the time domain. We also can represent it in another way which is called <math>x(f)</math> we will represent it in terms of the frequency domain and This is why we called transformation. Fourier Transform is an equivalent representation of the signal. | |||
Convolution equation : | |||
<math>(f * g)(t) := \int_{-\infty}^\infty f(\tau) g(t - \tau) \, d\tau.</math> | |||
<ref extends=iAndFT>starting at [https://youtu.be/Ea4GIkjCJs8?t=569 9' 29" of the video]</ref> | |||
<ref>{{:Video/What is convolution? This is the easiest way to understand}}</ref> | |||
<ref>{{:Video/Fourier Transform Equation Explained}}</ref> | |||
<ref> {{:Video/Introduction to the Fourier Transform}}</ref> | |||
<ref>{{:Video/Fourier Transform, Fourier Series, and frequency spectrum}}</ref> | |||
<noinclude> | <noinclude> | ||
Revision as of 11:25, 30 July 2022
Fourier transform
Fourier transform is the next level of the Fourier Series, it comes up with a way to approximate hole functions by using exponentials that means, unlike Fourier Series can only approximate a function on an interval, now we can approximate functions that are infinitely long.
Fourier transforms integral equation :
Example for Fourier transform: We have a signal called we will represent it in terms of the time domain. We also can represent it in another way which is called we will represent it in terms of the frequency domain and This is why we called transformation. Fourier Transform is an equivalent representation of the signal.
Convolution equation :
Cite error: Invalid <ref> tag; invalid names, e.g. too many
[1]
[2]
References
- ↑ Discretised, ed. (Aug 25, 2020). What is convolution? This is the easiest way to understand. local page: Discretised.
- ↑ Collings, Iain (Sep 9, 2019). What is convolution? This is the easiest way to understand. local page: Iain Explains Signals, Systems, and Digital Comms.
- ↑ Douglas, Brian (Jan 11, 2013). Introduction to the Fourier Transform. local page: Brian Douglas.
- ↑ Khutoryansky, Eugene (Aug 25, 2020). Fourier Transform, Fourier Series, and frequency spectrum. local page: Physics Videos by Eugene Khutoryansky.
Related Pages