Table of Fourier Transform Pairs

Function, f(t) Fourier Transform, F(w)

Definition of Inverse Fourier Transform Definition of Fourier Transform

1 jwt - jwt
f (t ) =
2p F (w )e dw F (w ) = f (t )e 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

t F (w )
+ pF (0)d (w )
f (t )dt
jw
-

d (t ) 1

e jw 0 t 2pd (w - w 0 )

sgn (t) 2
jw

Signals & Systems - Reference Tables 1

 Fourier Transform Table
UBC M267 Resources for 2005

F (t) Fb() Notes (0)

Z
f (t) f (t)eit dt Definition. (1)

Z
1
fb()eit d fb() Inversion formula. (2)
2

fb(t) 2f () Duality property. (3)

1
eat u(t) a constant, <e(a) > 0 (4)
a + i
2a
ea|t| a constant, <e(a) > 0 (5)
a2 + 2

1, if |t| < 1, sin()
(t) = 2 sinc() = 2 Boxcar in time. (6)
0, if |t| > 1
1
sinc(t) () Boxcar in frequency. (7)

f 0 (t) i fb() Derivative in time. (8)

f 00 (t) (i)2 fb() Higher derivatives similar. (9)

d
tf (t) i fb() Derivative in frequency. (10)
d
d2
t2 f (t) i2 2 fb() Higher derivatives similar. (11)
d
ei0 t f (t) b
f ( 0 ) Modulation property. (12)
 
t t0
f keit0 fb(k) Time shift and squeeze. (13)
k

(f g)(t) fb()b
g () Convolution in time. (14)

0, if t < 0 1
u(t) = + () Heaviside step function. (15)
1, if t > 0 i

(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 Z
Convolution: (f g)(t) = f (t u)g(u) du = f (u)g(t u) du.

Z Z  
1
2  b 2
Parseval: |f (t)| dt = f () d.
2
 1 sgn(w )
j
pt

u (t ) 1
pd (w ) +
jw

Fn e jnw 0t 2p Fnd (w - nw 0 )
n = - n = -

t wt
rect ( ) tSa( )
t 2

B Bt w
Sa( ) rect ( )
2p 2 B

tri (t ) w
Sa 2 ( )
2

pt t Ap cos(wt )
A cos( )rect ( )
2t 2t 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 ) p 2
[d (w - w 0 ) - d (w + w 0 )] + 2w 2
2j w0 - w

u (t )e -at cos(w 0 t ) (a + jw )
w 02 + (a + jw ) 2

Signals & Systems - Reference Tables 2

u (t )e -at sin(w 0 t ) w0
w 02 + (a + jw ) 2

e
-a t 2a
a2 +w2
2
/( 2s 2 ) 2
w2 / 2
e -t s 2p e -s

u (t )e -at 1
a + jw

u (t )te -at 1
(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 T 2T
a0 =
T 0 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

1T
f (t ) = Fn e jwnt
, where Fn = f (t )e - jw 0 nt dt
T 0
n = -

Signals & Systems - Reference Tables 3

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 4

Useful Integrals

sin(x)
cos( x)dx
- cos(x)
sin( x)dx
cos( x) + x sin( x)
x cos( x)dx
sin( x) - x cos( x)
x sin( x)dx

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

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

ax
e dx e ax
a

ax
xe dx x 1
e ax - 2
a a

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

dx 1
a + bx b
ln a + bx

dx 1 bx
a 2 + b 2x2 tan -1 ( )
ab a

Signals & Systems - Reference Tables 5

 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

Fourier transform Fourier transform

Signal Remarks
unitary, angular frequency unitary, ordinary frequency

10 The rectangular pulse and the normalized sinc function

Dual of rule 10. The rectangular function is an idealized

11 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.

Shows that the Gaussian function exp( - at2) is its own

14 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