MATEMATEKA REKAYASA

MO 091204
Fungsi-fungsi
Khusus: Fourier
and FT
mahmud mustain

Fourier and
Fourier Transform
Why should we learn Fourier
Transform?
Sumber: www.csee.wvu.edu/~xinl/courses/ee465/fourier.ppt

Joseph Fourier
Josephs father was a tailor in Auxerre
Joseph was the ninth of twelve children
His mother died when he was nine and
his father died the following year
Fourier demonstrated talent on math
at the age of 14.
In 1787 Fourier decided to train for
the priesthood - a religious life or a
mathematical life?
In 1793, Fourier joined the local
Revolutionary Committee
Born: 21 March 1768 in Auxerre, Bourgogne, France
Died: 16 May 1830 in Paris, France

Fouriers Controversy
Work
Fourier did his important mathematical
work on the theory of heat (highly
regarded memoir On the Propagation of
Heat in Solid Bodies ) from 1804 to 1807
This memoir received objection from
Fouriers mentors (Laplace and
Lagrange) and not able to be published
until 1815
Napoleon awarded him a pension of 6000 francs, payable from 1 July, 1815.
However Napoleon was defeated on 1 July and Fourier did not receive any money

Expansion of a Function
Example (Taylor Series)

constant
first-order
term

second-order
term

Fourier Series

Fourier series make use of the orthogonality relationships of

the sine and cosine functions

Examples

Fourier Transform
The Fourier transform is a generalization of
the complex Fourier series in the limit
Fourier analysis = frequency domain analysis
Low frequency: sin(nx),cos(nx) with a small n
High frequency: sin(nx),cos(nx) with a large n

Note that sine and cosine waves are

infinitely long this is a shortcoming of
Fourier analysis, which explains why a more
advanced tool, wavelet analysis, is more
appropriate for certain signals

Applications of Fourier
Transform
Physics
Solve linear PDEs (heat conduction,
Laplace, wave propagation)

Antenna design
Seismic arrays, side scan sonar, GPS, SAR

Signal processing
1D: speech analysis, enhancement
2D: image restoration, enhancement

Not Just for EE

Just like Calculus invented by
Newton, Fourier analysis is another
mathematical tool
BIOM: fake iris detection
CS: anti-aliasing in computer
graphics
CpE: hardware and software systems

FT in Biometrics

natural

fake

FT in CS

Anti-aliasing in 3D graphic display

FT in CpE
Computer Engineering: The creative
application of engineering principles and
methods to the design and development
of hardware and software systems
If the goal is to build faster computer
alone (e.g., Intel), you might not need
FT; but as long as applications are
involved, there is a place for FT (e.g.,
Texas Instrument)

Frequency-Domain Analysis of
Interpolation
Step-I: Upsampling
xi n xn / L x c nT / L

Step-II: Low-pass filtering

Different interpolation schemes
correspond to different low-pass filters
14

Frequency Domain Representation of

Upsampling
X e w

x k e

jLk

X wL

15

Frequency Domain Representation of

Interpolation

16

Introduction to
Fast Fourier Transform (FFT)
Algorithms

Sumber: ecee.colorado.edu/~ecen4002/10_fft_intro.ppt

Discrete Fourier Transform

(DFT)
The DFT provides uniformly spaced
samples of the Discrete-Time Fourier
Transform (DTFT)
2nk
N 1
2nk
j
N 1
1
j
DFT
definition:
x[n] X [k ]e N
X [k ] x[n]e N

n 0

n 0

Requires N2 complex multiplies and

N(N-1) complex additions
ECEN4002 Spring 2003

FFT Intro

R. C.
Maher

18

Faster DFT computation?

Take advantage of the symmetry and
periodicity of the complex exponential (let
WN=e-j2/N)
k[ N n]
kn
kn *
WN

WN

(WN )

symmetry: kn
WN WNk [ n N ] WN[ k N ]n
periodicity:

Note that two length N/2 DFTs take less

computation than one length N DFT:
2(N/2)2<N2
Algorithms that exploit computational savings
are collectively called Fast Fourier Transforms
ECEN4002 Spring 2003

FFT Intro

R. C.
Maher

19

Decimation-in-Time
Algorithm
Consider expressing DFT with even
and odd input samples:
N 1

X [k ] x[n]WNnk
n 0

nk
x
[
n
]
W

n even
N
2

nk
x
[
n
]
W

n odd

N
2

x[2r ](WN2 ) rk WNk x[2r 1](WN2 ) rk

r 0
N
2

r 0

N
2

x[2r ]WNrk/ 2 WNk x[2r 1]WNrk/ 2

r 0

ECEN4002 Spring 2003

r 0

FFT Intro

R. C.
Maher

20

DIT Algorithm (cont.)

Result is the sum of two N/2 length DFTs

X [k ]

G
[k ]

N/2 DFT
of even samples

WNk H
[k ]

N/2 DFT
of odd samples

Then repeat decomposition of N/2 to N/4 DFTs, etc.

x[0,2,4,6]

N/2
DFT
X[07]

x[1,3,5,7]

N/2
DFT

WN0...7
ECEN4002 Spring 2003

FFT Intro

R. C.
Maher

21

Detail of Butterfly
Cross feed of G[k] and H[k] in flow
diagram is called a butterfly, due
to shape
WNr

or simplify:

WN( r N 2)

WNr

( WNr )

ECEN4002 Spring 2003

FFT Intro

R. C.
Maher

-1

22

8-point DFT Diagram

x[0,4,2,6
,1,5,3,7]

X[07]

WN0

1
WN0

WN0

WN0

WN2

1
WN0

WN0

WN2

WN0

WN1

WN2
WN3

ECEN4002 Spring 2003

FFT Intro

R. C.
Maher

23

Computation on DSP
Input and Output data
Real data in X memory
Imaginary data in Y memory

Coefficients (twiddle factors)

cos (real) values in X memory
sin (imag) values in Y memory

Inverse computed with exponent sign

change and 1/N scaling
ECEN4002 Spring 2003

FFT Intro

R. C.
Maher

24

AL-HAMDULILLAH