Fourier Transform Properties

Instructor: Mohammed Farrag

Dept. of Electrical Engineering
Assiut University

mohammed.farrag@eng.au.edu.eg
Course Outline

• Time domain analysis

• Signals and systems in continuous and discrete time

11/17/2013
• Convolution: finding system response in time domain
• Frequency domain analysis
• Fourier series

Signal Processing
• Fourier transforms
• Frequency responses of systems
• Generalized frequency domain analysis
• Laplace and z transforms of signals
• Tests for system stability
• Transfer functions of linear time-invariant systems

11 -
2
Fourier Transform pair

 
X     xt  e dt  xt   X   e j  t d
1

 jt
 2 

11/17/2013
• Conditions for Fourier transform of x(t) to exist
• x(t) is absolutely integrable

Signal Processing
X ( )  


X ( )   xt  e  jt dt  



 xt  dt  

12 - 3
Fourier Transform

• What system properties does it possess?

 Memoryless (in fact requires infinite memory)

11/17/2013
 Causal
 Linear

Signal Processing
 Time-invariant (doesn’t apply)

• What does it tell you about a signal?

• Answer: Measures frequency content

• What doesn’t it tell you about a signal?

• Answer: When those frequencies occurred in time

12 - 4
Fourier Transform Pairs
  t   jt  /2
F     rect e dt   e  jt dt

   / 2

11/17/2013
     
sin   sin  
2    

j
e 
1  j / 2
 e j / 2  2 

2 
 
  
  sinc


   2 

Signal Processing
 2 

f(t) F() 
1 F

t
-/2 0 /2 6 4 2  0 2 4 6
     
12 - 5
 Fourier Transform Pairs
• From the sifting property of the Dirac delta,

F d t    d t  e  j  t dt  e  j 0  1


11/17/2013
• Consider a Dirac delta in the Fourier domain

F d     d   e
1 jt 1 j 0t 1
1
d  e 

Signal Processing
2  2 2
• Using linearity property, F{ 1 } = 2 d()

x(t) = 1 X() = 2  d()

1 F
(2)

t  12 - 6
0 0

(2) means that the area under the Dirac delta is (2)
Fourier Transform Pairs
1 
F d   0     1 j 0 t

j t
1
d    e d   e
2 2
0
 

e  d   0  or e j0t  2 d   0 
1 j 0 t

11/17/2013
2

Since cos0t   e j0t  e  j0t
1


Signal Processing
2
cos0t    d   0   d   0 

f(t) F()
() ()
F
t  12 - 7
0 0 0 0
Common Fourier Transforms Pairs

11/17/2013
Signal Processing
12 -
8
 11/17/2013
Signal Processing
Properties of the Fourier Transform

13 -
9
Duality
• Forward/inverse transforms are similar

1 
f t    

F     f t  e 
j t
 j t
dt F  e d
2  

11/17/2013


f t   F   F t   2 f   

Signal Processing
• Example: rect(t/)   sinc(  / 2)

Apply duality  sinc(t /2)  2  rect(-/)

rect(·) is even  sinc(t  /2)  2  rect(/)

f(t) 
F()
1
13 -
 10
t
-/2 0 /2 6 4 2  0 2 4 6
     
Scaling

• Given f t   F   and that a  0

1  
f at   F 

11/17/2013
a a

• |a| > 1: compress time axis, expand frequency axis

Signal Processing
• |a| < 1: expand time axis, compress frequency axis

• Extent in time domain is inversely proportional to extent in

frequency domain ( bandwidth)
• f(t) is wider  spectrum is narrower
• f(t) is narrower  spectrum is wider
13 -
11
 Shifting in Time

• Shift in time f t  t0   e  j  t0 F  
• Does not change magnitude of the Fourier transform

11/17/2013
• Shifts phase of Fourier transform by -t0
(so t0 is the slope of the linear phase)

Signal Processing
• Derivation

F f (t  t0 )   f (t  t0 )e  j  t dt


Let u = t – t0, so du = dt and integration limits stay same

 
F f (t  t0 )   f (u )e  j  ( u t0 )
du  e  j  t0
 f (u )e  j  u du  e  j  t0 F ( )
  13 -
12
Sinusoidal Amplitude Modulation
y t   f t  cos 0t 
Multiplica tion in the time domain is

11/17/2013
convolution in the frequency domain :

Y    F    d    0   d    0 
1
2

Signal Processing
Recall that

x t   d t    d  x t   d  x t 


x t   d t  t0    d   t0 x t   d  x t  t0 


So,
13 -
Y    F    0   F    0 
1 1
13
2 2
Sinusoidal Amplitude Modulation
F()

• Example: y(t) = f(t) cos(0 t) 1

• f(t) is an ideal lowpass signal

11/17/2013
• Assume 1 << 0 
-1 0 1
Y()

Signal Processing
1/2 F0 1/2 F0
1/2


-0 - 1 -0 + 1 0 0 - 1 0 + 1
0 0

• Demodulation (i.e. recovery of f(t) from y(t)) is modulation

followed by lowpass filtering
• Similar derivation for modulation with sin(0 t) 13 -
14
Frequency-shifting Property

11/17/2013
e j 0 t f t   F   0 
e  j 0 t f t   F   0 

Signal Processing
cos0t  f t   F   0   F   0 
1
2
sin 0t  f t   F   0   F   0 
j
2

13 -
15
Time Integration Property

Find  f  x dx  ?
t

-

From the property of time convolution :

• Example:

 f x dx   f x ut  x dx f (t )  e t u (t )
t

- -

 f t   u t  1
F ( ) 
F   F   d    j1  j  1
f  x dx
t

- F (0)  1
F  
  F 0  d   
j  t

F  f (t )dt   d ( ) 

1
j  j  1
Therefore, if F (0) is defined,
F  
f  x dx   F 0  d   
t

- j

11/17/2013 Signal Processing 13 - 16

Properties of the Fourier Transform

11/17/2013
Signal Processing
12 -
17
Common Fourier Transforms Pairs

11/17/2013
Signal Processing
12 -
18
Summary

• Definition of Fourier Transform

11/17/2013

F     f t  e  j  t dt


• Two ways to find Fourier Transform

Signal Processing
• Use definition
• Use transform pairs and properties

13 -
19
 Thanks

Digital Signal Processing 20

013
11/17/2