Table of Fourier Transform Pairs

Function, f(t)
Definition of Inverse Fourier Transform

Fourier Transform, F(w)

Definition of Fourier Transform

1 f (t ) = 2p
f (t - t 0 )

F (w )e

jwt

dw

F (w ) =

f (t )e

- jw t

dt

F (w )e - jwt0 F (w - w 0 )

f (t )e jw 0t

f (at )

1 w F( ) a a 2pf (-w ) ( jw ) n F (w )

F (t ) d n f (t ) dt n (- jt ) n f (t )

d n F (w ) dw n

f (t )dt

F (w ) + pF (0)d (w ) jw
1 2pd (w - w 0 ) 2 jw

d (t )
e jw 0 t
sgn (t)

Signals & Systems - Reference Tables

Fourier Transform Table

UBC M267 Resources for 2005

F (t)

F ( ) f (t)eit dt

Notes Denition.

(0)

f (t)

(1)

1 2

f ( )eit d

f ( ) 2f ( ) 1 a + i a2 2a + 2 sin( )

Inversion formula. Duality property. a constant, e(a) > 0 a constant, e(a) > 0 Boxcar in time. Boxcar in frequency. Derivative in time. Higher derivatives similar. Derivative in frequency. Higher derivatives similar. Modulation property. Time shift and squeeze. Convolution in time. Heaviside step function. Assumes f continuous at t0 . Useful for sin(0 t), cos(0 t).
2

(2)

f (t) eat u(t) ea|t| (t) = 1, 0, if |t| < 1, if |t| > 1

(3) (4)

(5)

2 sinc( ) = 2 ( )

(6)

1 sinc(t) f (t) f (t) tf (t) t2 f (t) ei0 t f (t) f t t0 k

(7) (8) (9) (10) (11) (12)

i f ( ) (i )2 f ( ) d i f ( ) d d2 i2 2 f ( ) d f ( 0 ) keit0 f (k ) f ( )g ( ) 1 + ( ) i eit0 f (t0 ) 2( 0 )

(13)

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

(14)

(15)

(t t0 )f (t) ei0 t

(16) (17)

Convolution:

(f g)(t) =

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

f (u)g(t u) du.

Parseval:

1 |f (t)| dt = 2

f ( ) d .

1 pt

sgn(w )

u (t )

pd (w ) +

1 jw

n = -

Fn e jnw 0t

2p

n = -

Fnd (w - nw 0 )
wt ) 2

t rect ( ) t

tSa(

B Bt Sa( ) 2p 2 tri (t )

w rect ( ) B w Sa 2 ( ) 2

A cos(

pt t )rect ( ) 2t 2t

Ap cos(wt ) t (p ) 2 - w 2 2t
p [d (w - w 0 ) + d (w + w 0 )]

cos(w 0 t ) sin(w 0 t )

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

u (t ) cos(w 0 t )

u (t ) sin(w 0 t )

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

(a + jw )
2 w0 + (a + jw ) 2

Signals & Systems - Reference Tables

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

w0
2 w0 + (a + jw ) 2

-a t

2a a2 +w2

e -t

/( 2s 2 )

s 2p e -s

w2 / 2

u (t )e -at

1 a + jw 1 (a + jw ) 2

u (t )te -at

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 ) =

n = -

Fn e

jwnt

, where

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

Signals & Systems - Reference Tables

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)dx x cos( x)dx x sin( x)dx x x e

2

sin( x)

- cos( x)
cos( x) + x sin( x) sin( x) - x cos( x) 2 x cos( x) + ( x 2 - 2) sin( x) 2 x sin( x) - ( x 2 - 2) cos( x) e ax a

cos( x)dx sin( x)dx dx

ax

xe x

ax

dx

x 1 e ax - 2 a a x 2 2x 2 e ax - 2 - 3 a a a
1 ln a + bx b

2 ax

e dx

a + bx
a 2 + b 2x2
dx

dx

bx 1 tan -1 ( ) ab a

Signals & Systems - Reference Tables

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 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. tri is the triangular function

11

12

13

Dual of rule 12. Shows that the Gaussian function exp( - a t2) is its own Fourier transform. For this to be integrable we must have Re(a) > 0.

14

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