Review on Fourier

Slides edited from:

Prof. Brian L. Evans and Mr. Dogu Arifler
Dept. of Electrical and Computer
Engineering The University of Texas at
Austin course:
EE 313 Linear Systems and Signals
2003

Fall

Existence of the Fourier Series

Existence

T0

Convergence for all t

f t dt

f t t

Finite number of maxima and minima in one

period of f(t)

Fourier Integral

G f g t e

X x t e j t dt

1
j 2 f t
j t

g t G f e
df x t
X

e
d

2
Communication Systems
Signal Processing
j 2 f t

dt

Conditions for the Fourier transform of g(t) to

exist (Dirichlet conditions):
x(t) is single-valued with finite maxima and minima in
any finite time interval
x(t) is piecewise continuous; i.e., it has a finite number of
discontinuities in any finite time interval

x(t) is absolutely integrable

g t dt

Fourier Transform
What system properties does it possess?
Memoryless
Causal
Linear
Time-invariant

What does it tell you about a signal?

Answer: Measures frequency content
What doesnt it tell you about a signal?
Answer: When those frequencies occurred in time

Useful Functions
Unit gate function (a.k.a. unit pulse function)

rect(x)
1

-1/2

1/2

0
1
rect x
2
1

What does rect(x / a) look like?

Unit triangle function
(x)

-1/2

x
0

1/2

1 2 x

1
2
1
x
2
1
x
2
x

1
2
1
x
2

Useful Functions
Sinc function

sin x
x
How to compute sinc(0)?
As x 0, numerator and
denominator are both going
to 0. How to handle it?

sinc x

sinc(x) 1

Even function
Zero crossings at x , 2 , 3 , ...
Amplitude decreases proportionally to 1/x

Fourier Transform Pairs

t
F rect

jt

/2

dt

e jt dt

/ 2

1 j / 2

e
e j / 2
j

sin

2
2

2 sin

F()

f(t)

sinc

-/2

/2

Fourier Transform Pairs

From the sampling property of the impulse,

F t t e j t dt e j 0t 1

f(t) = 1

F() = 2 ()
F

(2)
0

(2) means that the area under the spike is (2)

Fourier Transform Pairs

1
1 j 0 t
j t

F 0

e
d

e
0

2
2
1 j 0 t
e
0 or e j 0t 0
2
1 j 0 t

Since cos 0t e e j 0t
2
cos 0t 0 0
1

F()

f(t)

()

()

F
0

Fourier Transform Pairs

1 t 0
sgn t
lim e at u t e at u t
1 t 0 a 0

F sgn t lim F e at u t F e at u t
a 0

1
1
lim

a 0 a j
a

2
2 j
lim 2

a 0 a 2
j

sgn(t)
1
t

-1

Fourier Transform Properties

Fourier vs. Laplace Transform Pairs

f(t)
e-at u(t)
e-a|t|
(t)
1
u(t)
cos(0t)
sin(0t)
eat u(t)

F(s)

Region of Convergence

F()

1 Re{s} > -Re{a}

s+a
2a -Re{a} < Re{s} < Re{a}
a2 s2
1
complex plane
2(s) complex plane
Re{s} > 0
1
s

1
j + a
2a
2 + a2
1
2()
() + 1/(j
[( + 0) + ( 0)]
j[( + 0) - ( 0)]

1
s-a

Re{s} > Re{a}

Assuming that Re{a} > 0

Duality
Forward/inverse transforms are similar

1
j t
j t

f t
F

e
d
F f t e
dt

2
F t 2 f

f t F

rect(t/) sinc( / 2)

Example:

sinc(t /2) 2 rect(-/)

sinc(t /2) 2 rect(/)

Apply duality
rect() is even
f(t)
1

-/2

F()

/2

Scaling
Same as Laplace
transform scaling property

f t F
f at

1
F
a a

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

|a| < 1: expand time axis, compress frequency axis

Effective extent in the time domain is inversely

proportional to extent in the frequency domain
(a.k.a bandwidth).
f(t) is wider spectrum is narrower
f(t) is narrower spectrum is wider

Time-shifting Property
Shift in time

f t t0 e j t0 F

Does not change magnitude of the Fourier transform

Does shift the phase of the Fourier transform by -t0
(so t0 is the slope of the linear phase)

Frequency-shifting Property
e j 0 t f t 2 F 0

e j 0 t f t 2 F 0
1
F 0 F 0
cos 0t f t
2
1
1
cos 0t f t F 0 F 0
2
2
1
jF 0 jF 0
sin 0t f t
2

sin 0t f t F 0 F 0
j
j

Modulation
y t f t cos 0t
Multiplication in the time domain is
convolution in the frequency domain :
1
Y
F 0 0
2
Recall that

x t t x t d x t

x t t t0 t0 x t d x t t0

So,
Y

1
1
F 0 F 0
2
2

Modulation

F()
1

Example: y(t) = f(t) cos(0 t)

f(t) is an ideal lowpass signal
Assume 1 << 0
Y()
F

- -

- +

Demodulation is modulation followed by

lowpass filtering
Similar derivation for modulation with sin(0 t)

Time Differentiation Property

Conditions
f(t) 0, when |t|
f(t) is differentiable

Derivation of property:
Given f(t) F()
d

f (t )
dt

df t
B
e j t dt
dt

Let B F

e j t df t

From the chain rule, recall that

u dv u v - v du
Let u e j t and dv df (t ),
so du j e j t
B e

j t

f t

f t d e j t

f t e j t dt j F

df t
j F
dt
df n t
n

F
dt n

Time Integration Property

Find f x dx ?
t

From the property of time convolution :

f x dx f x u t x dx
-

f t u t

1
F

F
F 0
j
Therefore,

f x dx F 0

F
j

Summary
Definition of Fourier Transform
F

f t e j t dt

Two ways to find Fourier Transform

Use definitions
Use properties