Difference between revisions of "Fourier Transform"

From PKC
Jump to navigation Jump to search
Line 24: Line 24:
<noinclude>
<noinclude>
{{PagePostfix
{{PagePostfix
|category_csd=Fourier Series,Transformation
|category_csd=Fourier Series,Uncertainty Principle
}}
}}
</noinclude>
</noinclude>

Revision as of 06:24, 2 August 2022

Fourier Transform(Q6520159)

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

Related Pages