You are on page 1of 8

Table of Fourier Transform Pairs

Function, f(t)
Definition of Inverse Fourier Transform

1
f (t ) =
2p

F (w )e

jwt

dw

Fourier Transform, F(w)


Definition of Fourier Transform

F (w ) =

f (t )e

- jwt

dt

f (t - t 0 )

F (w )e - jwt0

f (t )e jw 0t

F (w - w 0 )

f (at )

1
w
F( )
a
a

F (t )

2pf (-w )

d n f (t )

( jw ) n F (w )

dt n
(- jt ) n f (t )

d n F (w)
dw n

f (t )dt

F (w )
+ pF (0)d (w )
jw

d (t )

e jw 0 t

2pd (w - w 0 )

sgn (t)

2
jw

Signals & Systems - Reference Tables

Fourier Transform Table


UBC M267 Resources for 2005

Fb()

F (t)

Notes

(0)

Definition.

(1)

fb()

Inversion formula.

(2)

fb(t)

2f ()

Duality property.

(3)

eat u(t)

1
a + i

a constant, <e(a) > 0

(4)

2a
+ 2

a constant, <e(a) > 0

(5)

Boxcar in time.

(6)

Boxcar in frequency.

(7)

Derivative in time.

(8)

Higher derivatives similar.

(9)

f (t)eit dt

f (t)
1
2

fb()eit d

ea|t|

(t) =

1,
0,

a2

if |t| < 1,
if |t| > 1

2 sinc() = 2

sin()

1
sinc(t)

()

f 0 (t)

i fb()

f 00 (t)

(i)2 fb()
d
i fb()
d
d2
i2 2 fb()
d
b
f ( 0 )

tf (t)
t2 f (t)
ei0 t f (t)


t t0
f
k

keit0 fb(k)
fb()b
g ()

Derivative in frequency.

(10)

Higher derivatives similar.

(11)

Modulation property.

(12)

Time shift and squeeze.

(13)

Convolution in time.

(14)

(f g)(t)

0, if t < 0
u(t) =
1, if t > 0

1
+ ()
i

Heaviside step function.

(15)

(t t0 )f (t)

eit0 f (t0 )

Assumes f continuous at t0 .

(16)

ei0 t

2( 0 )

Useful for sin(0 t), cos(0 t).

(17)

Z
Convolution:

(f g)(t) =
Z

Parseval:

Z
f (t u)g(u) du =

1
|f (t)| dt =
2

f (u)g(t u) du.



b 2
f () d.

sgn(w )

1
pt

u (t )

pd (w ) +

Fn e jnw 0t

2p

t
rect ( )
t

tSa(

B
Bt
Sa( )
2p
2

w
rect ( )
B

tri (t )

w
Sa 2 ( )
2

n = -

A cos(

pt
t
)rect ( )
2t
2t

1
jw

Fnd (w - nw 0 )

n = -

wt
)
2

Ap cos(wt )
t (p ) 2 - w 2
2t

cos(w 0 t )

p [d (w - w 0 ) + d (w + w 0 )]

sin(w 0 t )

p
[d (w - w 0 ) - d (w + w 0 )]
j

u (t ) cos(w 0 t )

p
[d (w - w 0 ) + d (w + w 0 )] + 2 jw 2
2
w0 - w

u (t ) sin(w 0 t )

2
p
[d (w - w 0 ) - d (w + w 0 )] + 2w 2
2j
w0 - w

u (t )e -at cos(w 0 t )

Signals & Systems - Reference Tables

(a + jw )
w 02 + (a + jw ) 2

w0

u (t )e -at sin(w 0 t )

w 02 + (a + jw ) 2
2a

-a t

e -t

a2 +w2
2

/( 2s 2 )

s 2p e -s

w2 / 2

1
a + jw

u (t )e -at

u (t )te -at

(a + jw ) 2

Trigonometric Fourier Series

f (t ) = a 0 + (a n cos(w 0 nt ) + bn sin(w 0 nt ) )
n =1

where
1
a0 =
T

2T
f (t )dt , a n = f (t ) cos(w 0 nt )dt , and
T0

2T
bn = f (t ) sin(w 0 nt )dt
T 0

Complex Exponential Fourier Series


f (t ) =

Fn e

jwnt

, where

n = -

Signals & Systems - Reference Tables

1T
Fn = f (t )e - jw 0 nt dt
T 0

Some Useful Mathematical Relationships


e jx + e - jx
cos( x) =
2
e jx - e - jx
sin( x) =
2j
cos( x y ) = cos( x) cos( y ) m sin( x) sin( y )
sin( x y ) = sin( x) cos( y ) cos( x) sin( y )
cos(2 x) = cos 2 ( x) - sin 2 ( x)
sin( 2 x) = 2 sin( x) cos( x)
2 cos2 ( x) = 1 + cos(2 x)
2 sin 2 ( x) = 1 - cos(2 x)
cos 2 ( x) + sin 2 ( x) = 1
2 cos( x) cos( y ) = cos( x - y ) + cos( x + y )
2 sin( x) sin( y ) = cos( x - y ) - cos( x + y )
2 sin( x) cos( y ) = sin( x - y ) + sin( x + y )

Signals & Systems - Reference Tables

Useful Integrals

cos( x)dx

sin(x)

sin( x)dx

- cos(x)

x cos( x)dx

cos( x) + x sin( x)

x sin( x)dx

sin( x) - x cos( x)

cos( x)dx

2 x cos( x) + ( x 2 - 2) sin( x)

sin( x)dx

2 x sin( x) - ( x 2 - 2) cos( x)

ax

dx

e ax
a

xe
x

ax

dx

2 ax

x 1
e ax - 2
a a

e dx

x 2 2x 2
e ax - 2 - 3
a
a a

dx

1
ln a + bx
b

a + bx
dx

a 2 + b 2x2

Signals & Systems - Reference Tables

bx
1
tan -1 ( )
ab
a

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( - at2) 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

J0 (t) is the Bessel function of first kind of order 0, rect is


the rectangular function
it's the generalization of the previous transform; Tn (t) is the
Chebyshev polynomial of the first kind.

Un (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