Professional Documents
Culture Documents
Table of Fourier Transform Pairs
Table of Fourier Transform Pairs
Table of Fourier Transform Pairs
1
Table of Fourier Transform Pairs
Function, f(t) Fourier Transform, F(w)
Definition of Inverse Fourier Transform
-
= w w
p
w
d e F t f
t j
) (
2
1
) (
Definition of Fourier Transform
-
-
= dt e t f F
t jw
w ) ( ) (
) (
0
t t f -
0
) (
t j
e F
w
w
-
t j
e t f
0
) (
w
) (
0
w w - F
) ( t f a
) (
1
a
w
a
F
) (t F ) ( 2 w p - f
n
n
dt
t f d ) ( ) ( ) ( w w F j
n
) ( ) ( t f jt
n
-
n
n
d
F d
w
w) (
-
t
d f t t ) (
) ( ) 0 (
) (
w d p
w
w
F
j
F
+
) (t d
1
t j
e
0
w
) ( 2
0
w w pd -
(t) sgn
w j
2
Fourier Transform Table
UBC M267 Resources for 2005
F(t)
F() Notes (0)
f(t)
f(t)e
it
dt Denition. (1)
1
2
f()e
it
d
f() Inversion formula. (2)
1, if |t| < 1,
0, if |t| > 1
2 sinc() = 2
sin()
(t) i
f() Derivative in time. (8)
f
(t) (i)
2
f() Higher derivatives similar. (9)
tf(t) i
d
d
t t
0
k
ke
it
0
f(k) Time shift and squeeze. (13)
(f g)(t)
f() g() Convolution in time. (14)
u(t) =
0, if t < 0
1, if t > 0
1
i
+ () Heaviside step function. (15)
(t t
0
)f(t) e
it
0
f(t
0
) Assumes f continuous at t
0
. (16)
e
i
0
t
2(
0
) Useful for sin(
0
t), cos(
0
t). (17)
Convolution: (f g)(t) =
f(t u)g(u) du =
f(u)g(t u) du.
Parseval:
|f(t)|
2
dt =
1
2
f()
2
d.
Signals & Systems - Reference Tables
2
t
j
p
1
) sgn(w
) (t u
w
w pd
j
1
) ( +
- = n
t jn
n
e F
0
w
- =
-
n
n
n F ) ( 2
0
w w d p
) (
t
t
rect )
2
(
wt
tSa
)
2
(
2
Bt
Sa
B
p
) (
B
rect
w
) (t tri
)
2
(
2
w
Sa
)
2
( )
2
cos(
t t
p t
rect
t
A
2 2
)
2
(
) cos(
w
t
p
wt
t
p
-
A
) cos(
0
t w [ ] ) ( ) (
0 0
w w d w w d p + + -
) sin(
0
t w
[ ] ) ( ) (
0 0
w w d w w d
p
+ - -
j
) cos( ) (
0
t t u w
[ ]
2 2
0
0 0
) ( ) (
2
w w
w
w w d w w d
p
-
+ + + -
j
) sin( ) (
0
t t u w
[ ]
2 2
0
2
0 0
) ( ) (
2
w w
w
w w d w w d
p
-
+ + - -
j
) cos( ) (
0
t e t u
t
w
a -
2 2
0
) (
) (
w a w
w a
j
j
+ +
+
Signals & Systems - Reference Tables
3
) sin( ) (
0
t e t u
t
w
a -
2 2
0
0
) ( w a w
w
j + +
t
e
a -
2 2
2
w a
a
+
) 2 /(
2 2
s t
e
- 2 /
2 2
2
w s
p s
-
e
t
e t u
a -
) (
w a j +
1
t
te t u
a -
) (
2
) (
1
w a j +
Trigonometric Fourier Series
( )
=
+ + =
1
0 0 0
) sin( ) cos( ) (
n
n n
nt b nt a a t f w w
where
=
= =
T
n
T
T
n
dt nt t f
T
b
dt nt t f
T
a dt t f
T
a
0
0
0
0
0
0
) sin( ) (
2
and , ) cos( ) (
2
, ) (
1
w
w
Complex Exponential Fourier Series
- =
= =
T
nt j
n
n
nt j
n
dt e t f
T
F e F t f
0
0
) (
1
where , ) (
w w
Signals & Systems - Reference Tables
4
Some Useful Mathematical Relationships
2
) cos(
jx jx
e e
x
-
+
=
j
e e
x
jx jx
2
) sin(
-
-
=
) sin( ) sin( ) cos( ) cos( ) cos( y x y x y x m =
) sin( ) cos( ) cos( ) sin( ) sin( y x y x y x =
) ( sin ) ( cos ) 2 cos(
2 2
x x x - =
) cos( ) sin( 2 ) 2 sin( x x x =
) 2 cos( 1 ) ( cos 2
2
x x + =
) 2 cos( 1 ) ( sin 2
2
x x - =
1 ) ( sin ) ( cos
2 2
= + x x
) cos( ) cos( ) cos( ) cos( 2 y x y x y x + + - =
) cos( ) cos( ) sin( ) sin( 2 y x y x y x + - - =
) sin( ) sin( ) cos( ) sin( 2 y x y x y x + + - =
Signals & Systems - Reference Tables
5
Useful Integrals
dx x) cos(
) sin(x
dx x) sin(
) cos(x -
dx x x ) cos(
) sin( ) cos( x x x +
dx x x ) sin(
) cos( ) sin( x x x -
dx x x ) cos(
2
) sin( ) 2 ( ) cos( 2
2
x x x x - +
dx x x ) sin(
2
) cos( ) 2 ( ) sin( 2
2
x x x x - -
dx e
x a
a
e
x a
dx xe
x a
-
2
1
a
a
x
e
x a
dx e x
x a 2
- -
3 2
2
2 2
a a
x
a
x
e
x a
+ x
dx
b a
x b a
b
+ ln
1
+
2 2 2
x
dx
b a
) ( tan
1
1
a
b
ab
x
-
Your continued donations keep Wikibooks running!
Engineering Tables/Fourier Transform Table 2
From Wikibooks, the open-content textbooks collection
< Engineering Tables
Jump to: navigation, search
Signal
Fourier transform
unitary, angular frequency
Fourier transform
unitary, ordinary frequency
Remarks
10
The rectangular pulse and the normalized sinc function
11
Dual of rule 10. The rectangular function is an idealized
low-pass filter, and the sinc function is the non-causal
impulse response of such a filter.
12
tri is the triangular function
13
Dual of rule 12.
14
Shows that the Gaussian function exp( - at
2
) is its own
Fourier transform. For this to be integrable we must have
Re(a) > 0.
common in optics
a>0
the transform is the function itself
J
0
(t) is the Bessel function of first kind of order 0, rect is
the rectangular function
it's the generalization of the previous transform; T
n
(t) is the
Chebyshev polynomial of the first kind.
U
n
(t) is the Chebyshev polynomial of the second kind
Retrieved from "http://en.wikibooks.org/wiki/Engineering_Tables/Fourier_Transform_Table_2"
Category: Engineering Tables
Views