Transformasi Fourier

Transformasi Fourier
Deret Fourier
Suatu fungsi dapat dinyatakan sebagai kombinasi linier dari

fungsi-fungsi yang saling orthogonal.
s(t )
c g
n =
(t )
Dot product dari 2 fungsi yang orthogonal akan menghasilkan

0.
1
t0 +
f0
g n (t ) g m (t )dt = 0
t0
Salah satu set fungsi orthogonal adalah :

Sin 2f0t, Sin 4f0t, Sin 6f0t
Cos 2f0t, Cos 4f0t, cos 6f0t
Untuk semua nm
Deret Fourier
Setiap fungsi s(t) dapat dituliskan sebagai :
s (t ) = a0 + [an cos 2nf 0t + bn sin 2nf 0t ]

n =1
1
a0 =
T
t 0 +T
t0
s (t )dt
2 t 0 +T
an = s (t ) cos 2nf 0tdt
T t0
2 t 0 +T
bn = s (t ) sin 2nf 0tdt
T t0
t0 < t < t0 + T
Deret Fourier
Penulisan cara lain :
s(t ) =
j 2nf 0t
c
e
n
n =
Ingat :
exp( j 2nf 0t ) = cos 2nf 0t + j sin 2nf 0t
t0 < t < t0 + T
THE FOURIER TRANSFORM

1. Representation of a signal by a continuum of impulses
Consider approximating a continuous signal x(t) over an interval T by a

sequence of pulses each of width .
A simple approximation is to make the height of the pulse to be equal to the

value of the function x(t) at the centre of the pulse.
Clearly if we reduce the value of we increase the number of pulses and

consequently make a better approximation to the function.
In order to express this concept mathematically we need to define a function P (t )

for
/ 2 < t < + / 2
1
P (t ) =
elsewhere
0
1
Thus we can express the function x(t) as a weighted sum of appropriately time
shifted functions P (t ) . Thus
N
x(t )
x(k )P (t k)
k = N
where the total number of pulses 2 N + 1 = T /
We can re-arrange the above equation to give

x(t )
k = N
x(k )
P (t k )
Now let 0, using a lot of pulse and obtaining a very good approximation.
The function P (t ) / tends to very narrow, very high function with the same
area as the original pulse.
We call the limit of P (t ) / as 0 a delta function . Taking the limit in

the above equation we obtain an integral
x(t ) =
T /2
x( ) (t )d
T / 2
If we let we obtain
x(t ) =
x( ) (t )d
It is important to realise that a true delta function never occurs in the real
word, but the concept of an impulse often models a number of situations.
Mathematically it will always find (t ) associated with integration. For
example, consider a step function (t ) where
0
1
(t ) =
If we differentiate (t )
for
t<0
for
t>0
we obtain
(t ) the delta function.
and as a result delta functions can be thought of as a means of describing the

derivative of discontinuous functions. Hence
[ (t ) (t 2 )]dt = (t ) (t 2 )

or graphically
The useful mathematical properties of a delta function can be summarised as :
(t )dt = 0
(t )dt = 1
(t )dt = 0
and shifting property
which converts a function of t to a number equal to the value of the function at

time t =
.
u(t ) (t )dt = u( )

2. The Fourier Transform as the limit of a Fourier series
We can write the spectrum obtained from the Fourier series as
T /2
1
c(n 0 ) =
f (t )e jn 0t dt
T T / 2
c(n 0 ) = 0
2
2
where the relationship T =
0
T /2
f (t )e
jn 0t
dt
T / 2
has been used.
Note that rather than express the coefficient as a function of n we have

converted to the actual frequency of the complex exponential.
Thus the first harmonic is at a frequency 0 whilst the second is at 20 etc.
Now if we let T , this implies that 0 d and
d
c( ) =
2
f (t )e
jt
dt
Now we define
F ( ) =
F ( ) =
2c( )
d
+
f (t )e
jt
dt
a quantity known as the Fourier Transform of f(t).

Terminology : F = f t
( )
{ ( )}
F ( ) jk 0t
e d
k =
and letting we obtain the inverse Fourier transform
correspondingly :
f (t ) =
1
f (t ) =
2
jt
(
)
F
e
d
The above equations form a Fourier transform pair and can strictly be applied
to signals of finite energy. In order for the Fourier transform of f(t) to exist we
require the Dirichlet conditions to be satisfied, namely :

1. f(t) is absolutely integrable over ( , ) , i.e.
+
f (t )dt
<
where M is a finite integer.

2. f(t) has a finite number of discontinuities, minima and maxima in every finite
time interval.
The Fourier transform pair

F ( ) =
f (t )e jt dt
1
f (t ) =
2
F ( )e
j t
Discrete
Fourier Transform
Overview Discrete Fourier

Transform
Digital representation of signals
Sampling
Interpolation with sinusoidal basis

functions
Sampling theorem
Aliasing
Nyquist
Signal reconstruction
Analogue and Digital Signals
Continuous and Discrete Signals
Continuous-time signals
signal defined for all
instances of time
formally written as
s=f(t) "t s
Discrete-time signals
Signal defined only for

specific instances of time
s=f[n], " integer n

Transformasi Fourier

Uploaded by

Copyright:

Available Formats

Transformasi Fourier

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Transformasi Fourier

Uploaded by

Copyright:

Available Formats

Transformasi Fourier

Suatu fungsi dapat dinyatakan sebagai kombinasi linier dari

Dot product dari 2 fungsi yang orthogonal akan menghasilkan

Salah satu set fungsi orthogonal adalah :

Setiap fungsi s(t) dapat dituliskan sebagai :

s (t ) = a0 + [an cos 2nf 0t + bn sin 2nf 0t ]

Penulisan cara lain :

exp( j 2nf 0t ) = cos 2nf 0t + j sin 2nf 0t

THE FOURIER TRANSFORM

Consider approximating a continuous signal x(t) over an interval T by a

A simple approximation is to make the height of the pulse to be equal to the

Clearly if we reduce the value of we increase the number of pulses and

THE FOURIER TRANSFORM

In order to express this concept mathematically we need to define a function P (t )

where the total number of pulses 2 N + 1 = T /

We can re-arrange the above equation to give

THE FOURIER TRANSFORM

We call the limit of P (t ) / as 0 a delta function . Taking the limit in

THE FOURIER TRANSFORM

(t ) the delta function.

and as a result delta functions can be thought of as a means of describing the

THE FOURIER TRANSFORM

The useful mathematical properties of a delta function can be summarised as :

and shifting property

which converts a function of t to a number equal to the value of the function at

THE FOURIER TRANSFORM

has been used.

Note that rather than express the coefficient as a function of n we have

THE FOURIER TRANSFORM

a quantity known as the Fourier Transform of f(t).

THE FOURIER TRANSFORM

where M is a finite integer.

The Fourier transform pair

Overview Discrete Fourier

Digital representation of signals

Interpolation with sinusoidal basis

Analogue and Digital Signals

Continuous and Discrete Signals

Signal defined only for

s=f[n], " integer n

You might also like