You are on page 1of 13

Fourier transform

Fourier transform
The Fourier transform is an operation that transforms one complex-valued function of a real variable into another. The new function, often called the frequency domain representation of the original function, describes which frequencies are present in the original function. This is in a similar spirit to the way that a chord of music can be described by notes that are being played.

Fourier transform
Definition:If Fourier transform of f(t) is
F(s) then the Fourier transform is defined by the integral.

F()=F [f(t)]=f(t)e-jt dt Inverse Fourier transform


-

f(t)=F

-1[F()]=

1/2 F()ejt d
-

Properties of Fourier transforms


linearity The Fourier transform of the sum of two functions is equal to the sum of the Fourier transforms of the individual function. The Fourier transform of a constant times a function is equal to the constant times the Fourier transform of the function.

Properties of Fourier transforms


Time shifting if f(t) F() Then f(t-T) F()e-jT

Properties of Fourier transforms


Frequency shifting if f(t) F() Then f(t)e-j0t F(- 0)

Properties of Fourier transforms


Scaling property if f(t) F() Then f(at) 1 F(/a) |a|

Properties of Fourier transforms


Time reversal if f(t) F() Then f(-t) F(-)

Properties of Fourier transforms


Symmetry if f(t) F() Then F(t) 2 f(-)

Theorems of Fourier transforms


The modulation theorem if f(t) F() Then modulation theorem f(t) cos 0t 1 F(-0)+1 F(+0) 2 2

Theorems of Fourier transforms


Differentiation theorem if f(t) F() then time domain differentiation theorem df(t) jF() dt provided that f(t) 0 as t

Theorems of Fourier transforms


Differentiation theorem if f(t) F() then frequency domain differentiation theorem(-jt)f(t) dF() d

Fourier transforms of standard functions


f(t) e-at F() 1/(a+j)

eat
sin t cos t

??
?? ??

You might also like