www.rejinpaul.

com

Unit-IV
Fourier Transforms (FT)

FORMULA SHEET

e ix  e ix e ix  e  ix
1. cos x  2. sin x 
2 2i
3. ein  cos n  i sin n
1  cos 2 x
4. sin 2 x 
2
1  cos 2 x
tan 1 
dx 1  x
5. cos2 x  6.  
2 x2  a2 a a
 sin ax   2
7.  dx 
  x 2 dx   ; e  x dx  
x 2
8.  e
2

0
 0 
9.  e  ax sin bx dx 
 ax a
e
b
10. cosbx dx 
a2  b2 0 a  b2
2
0
e ax e ax
11.  ax
 e sin bx dx  a sin bx  b cosbx 12.  ax
 e cosbx dx  a cosbx  b sin bx
a2  b 2
a 2  b2

12. Fourier integral theorem:

If f (x) is piece-wise continuously differentiable and absolutely integrable in
(,) , then

f x     f t  cos st  x  dt ds
1

0 

13. Fourier Sine integral theorem : f x   2   f t  sin sx sin st dt ds

0 
 
14. Fourier Cosine integral theorem : f x  2   f t  cos sx cos st dt ds

0 

15. Fourier Transform : F  f ( x)  1  f ( x) eisx dx
2


Inversion Fourier Transform : f ( x)  1  F  f ( x)eisx ds
2


16 .Fourier Sine Transform (FST) : Fs  f ( x)  2  f ( x) sin sx dx

0

Inversion Fourier sine Transform : f ( x)  2  Fs  f ( x)sin sx ds

0

Get useful study materials from www.rejinpaul.com

 www.rejinpaul.com

17. Fourier Cosine Transforms (FCT) : Fc  f ( x)  2
 f ( x) cos sx dx

0

 Fc  f ( x)cos sx ds
2
Inversion Fourier Cosine Transform : f ( x) 

0
18. Properties:
Fourier Transform Fourier Sine Transform Fourier Cosine
Transform
Linear property: Linearproperty: Linear property:
F af ( x)  bg ( x)  aF (s)  bG(s) Fs af ( x)  bg( x)  aFs (s)  bGs (s) Fc af ( x)  bg( x)  aFc (s)  bGc (s)

Change of scale Property:

1 s 1 s 1 s
F  f (ax)  F   Fs  f (ax)  Fs   Fc  f (ax)  Fc  
a a a a a a
Shifting Theorem:
F  f ( x  a )  eias F ( s )
 
F e iax f ( x)  F ( s  a )

Modulation Theorem: Modulation Theorem: Modulation Theorem:

F  f ( x) cos ax Fs  f ( x) cos ax Fc  f ( x) cos ax


1
F (s  a)  F (s  a) 
1
Fs (s  a)  Fs (s  a) 
1
Fc (s  a)  Fc (s  a)
2 2 2
Fs  f ( x) sin ax
 dF  f ( x) Fc  f ( x) sin ax
dFs  f ( x)
 n

F x f ( x)  (i ) n d n F s 
ds n
Fs xf (xF)c(s  a) c Fc ( s  a)
1
2 ds
Fc xf1( x) 
 Fs ( s  a)ds  Fs (a  s )
2
F  f ' ( x)  isF ( s ) Fs  f ' ( x)  sFc (s)
Fc  f ' ( x)  f 0  sFc ( s)
2
if f  x   0 as x   
In general
 d n f ( x) 
F n 
 (is)n F ( s)
 dx 
 

x  F ( s)  Fs  f ( x)  Gs g ( x)ds  Fc  f ( x)  Gc g ( x)ds

F  f x dx  0 0

 a  (is)  

  f ( x) g ( x) dx   f ( x) g ( x) dx
0
0

F  f (  x)  F ( s )
 
F f ( x)  F (  s )
F  f  x   F  s 

Get useful study materials from www.rejinpaul.com

 www.rejinpaul.com
19. Convolution of two functions:
1

f *g   f (u ) g ( x  u ) du
2


20. Convolution Theorem for Fourier Transforms:

F ( f * g ) x  F ( s)  G( s)

21. Parseval’s Identity:

 

  where F ( s)  F  f ( x) 
2 2
f ( x) dx  F ( s ) ds
 
22. Parseval’s Identity for Fourier Sine Transforms:
 

 f ( x) dx   Fs ( s) ds where Fs ( s)  Fs  f ( x) 
2 2

0 0

23. Parseval’s Identity for Fourier Cosine Transforms:

 

 f ( x) dx   Fc ( s) ds where Fc ( s)  Fc  f ( x) 
2 2

0 0

Get useful study materials from www.rejinpaul.com