Fourier (1) - Petra Christian University

Download Report

Transcript Fourier (1) - Petra Christian University

Fourier (2)
Hany Ferdinando
Dept. of Electrical Eng.
Petra Christian University
Overview





Fourier transform for continuous-time
signal
Fourier transform for discrete-time
signal
Properties
Convolution with Fourier
Introduction to DFT and FFT
Fourier (2) - Hany Ferdinando
2
Fourier Analysis

Fourier Series






Exponential
Sinusoid
Discrete-time Fourier Transform
Fourier Transform
Discrete Fourier Transform (DFT)
Fast Fourier Transform (FFT)
Fourier (2) - Hany Ferdinando
3
Discrete-time Fourier Transform (DTFT)
j
F (e ) 

f e
k  
1
fk 
2

 F (e
j
 jk
k
jk
)e d

Fourier (2) - Hany Ferdinando
4
Exercise


h(n) = 1 for 0 ≤ n ≤ N-1, find the DTFT
Proof that cos , has sequence
{½,0,½} in time domain
Fourier (2) - Hany Ferdinando
5
Properties of DTFT






Convergence
Linearity
Convolution
Time shifting
Parseval’s theorem
Frequency convolution
Fourier (2) - Hany Ferdinando
6
Convolution with Fourier


We have f = ½ for n=±1 and so is g,
what is the spectrum of y = fg?
We have two choices to solve it:


Multiply f and g, then find the signal in
frequency domain, or
Transform both f and g to frequency
domain, then convolve them
Fourier (2) - Hany Ferdinando
7
Convolution with Fourier

F = cos  and G = cos  also
1
j
Y (e ) 
2
1
j
Y (e ) 
2

 cos cos(   )d


 cos (cos cos  sin  sin  )d

cos
Y ( e j ) 
2
Y ( e j ) 

2
cos
 d

cos
2
Fourier (2) - Hany Ferdinando
8
Application of DTFT



It is applied when one wants to design
a digital filter
The frequency response of the filter is
known then one has to calculate its
coefficients
For detail discussion, please refer to
Digital Signal Processing course for
filter design
Fourier (2) - Hany Ferdinando
9
Continuous-time Fourier Transform

F ( j ) 
 f (t )e
 jt
dt

1
f (t ) 
2

F
(
j

)
e
d


jt

Fourier (2) - Hany Ferdinando
10
Energy and Power Signal

Energy signal is defined as


f 2 (t )dt  


Power signal has infinite energy but
finite power

f

T /2
2
(t )dt  
lim
T 
Fourier (2) - Hany Ferdinando
1
2
f
(t )dt  

T T / 2
11
Exercise
1
0.8
f(t)
0.6
A
0.4
0.2
-T/2
T/2
t
0
-0.2
-0.4
-20
-15
-10
-5
Fourier (2) - Hany Ferdinando
0
5
10
15
20
12
Properties of Fourier Transform







Symmetry
Linearity
Scaling
Time shifting (delay)
Frequency shifting (modulation)
Time convolution
Frequency convolution
Fourier (2) - Hany Ferdinando
13
Properties of Fourier Transform





Time differentiation
Time integration
Frequency differentiation
Frequency integration
Reversal
Fourier (2) - Hany Ferdinando
14
The Energy Spectrum


For periodic function, its power can
be associated with the power
contained in each harmonic
component of the signal
For non periodic function, the energy
over the interval (-∞,∞) is finite, while
the power is zero
Fourier (2) - Hany Ferdinando
15
The Energy Spectrum



Energy is defined as E   f 2 (t )dt

Proof that

1
E   f (t )dt 
2

2

 F  j 
2
d

Fourier (2) - Hany Ferdinando
16
Numerical Fourier Transform


How to calculate Fourier transform in
computer?
The integration is approximated with
sum and the technique is called DFT
(Discrete Fourier Transform)
Fourier (2) - Hany Ferdinando
17
Numerical Fourier Transform

Unfortunately, DFT offers problem in
computation speed



For n values, we need n2 of multiplication and
n(n-1) of addition
To solve this problem, FFT (Fast Fourier
Transform) is used
For detail discussion about DFT and FFT,
please refer to Digital Signal Processing
course
Fourier (2) - Hany Ferdinando
18
Next…
The Fourier transform is discussed and students have to
exercise how to use it.
For the next class, students have to read Z transform:
• Signals and Systems by A. V. Oppeneim ch 10, or
• Signals and Linear Systems by Robert A. Gabel ch 4, or
• Sinyal & Sistem (terj) ch 10
Fourier (2) - Hany Ferdinando
19