Difference between revisions of "Fourier Transform"
Jump to navigation
Jump to search
(5 intermediate revisions by 2 users not shown) | |||
Line 2: | Line 2: | ||
[[Fourier Transform]] <ref> {{:Video/Introduction to the Fourier Transform}}</ref> 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 Transform]] <ref> {{:Video/Introduction to the Fourier Transform}}</ref> 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. | ||
Example for Fourier transform: | 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. | 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. | ||
Fourier Series equation <math> f(\omega)= \int f(x) e^{-i \omega x } dx </math> | Fourier Series equation <math> f(\omega)= \int f(x) e^{-i \omega x } dx </math> | ||
exponential term <math>e^{i \omega x} = \cos ({\omega x}) + i\sin ({\omega x}),</math> | |||
*<math>f(\omega) </math> is the subject of the equation | |||
*<math>f(x)</math> is the time function we calculating the Fourier Series for. | |||
*<math>i</math> represents imaginary numbers, | |||
*<math>e^{i \omega x}</math> is a exponential term | |||
*<math>\int</math> is a integral | |||
-From [[Video/The Fourier Series and Fourier Transform Demystified | The Fourier Series and Fourier Transform Demystified]]<ref>{{:Video/The Fourier Series and Fourier Transform Demystified}}</ref> | -From [[Video/The Fourier Series and Fourier Transform Demystified | The Fourier Series and Fourier Transform Demystified]]<ref>{{:Video/The Fourier Series and Fourier Transform Demystified}}</ref> | ||
<noinclude> | <noinclude> | ||
{{PagePostfix | {{PagePostfix | ||
|category_csd=Fourier Series, | |category_csd=Fourier Series,Uncertainty Principle,Data Science | ||
}} | }} | ||
</noinclude> | </noinclude> |
Latest revision as of 06:26, 2 August 2022
Fourier Transform [1] 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.
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.
Fourier Series equation
exponential term
- is the subject of the equation
- is the time function we calculating the Fourier Series for.
- represents imaginary numbers,
- is a exponential term
- is a integral
-From The Fourier Series and Fourier Transform Demystified[2]
References
- ↑ Douglas, Brian (Jan 11, 2013). Introduction to the Fourier Transform. local page: Brian Douglas.
- ↑ Tan-Holmes, Jade (Jun 30, 2022). The Fourier Series and Fourier Transform Demystified. local page: Up and Atom.
Related Pages