Tables of Transform Pairs

2005 by Marc Stoecklin marc

Students and engineers in communications and mathematics are confronted with transformations such as the z-Transform, the Fourier transform, or the Laplace transform. Often it is
quite hard to quickly find the appropriate transform in a book or the Internet, much less to
have a good overview of transformation pairs and corresponding properties.
In this document I present a handy collection of the most common transform pairs and
properties of the
. continuous-time frequency Fourier transform (2f ),
. continuous-time pulsation Fourier transform (),
. z-Transform,
. discrete-time Fourier transform DTFT, and
. Laplace transform
arranged in a table and ordered by subject. The properties of each transformation are indicated
in the first part of each topic whereas specific transform pairs are listed afterwards.
Please note that, before including a transformation pair in the table, I verified their correctness. However, it is still possible that there might be some mistakes due to typos. Id be
grateful to everyone for dropping me a line and indicating me erroneous formulas.

Some useful conventions and formulas

sinc (x)

sin(x)
x

Convolution

f g(t) =

R +

Parseval theorem

R +

R +

f ( )g (t )d

f (t)g (t)dt =
|f (t)|2 dt =
1
2

Real part

<e{f (t)} =

Imaginary part

=m{f (t)} =

Sine / Cosine

sin (x) =

Geometric sequences

k=0

F (f )G (f )df

|F (f )|2 df

[f (t) + f (t)]

1
2

[f (t) f (t)]

1
1x

General case :

R +

ejx ejx
2j

xk =

R +

cos (x) =
Pn

k=0

Pn

k=m

ejx +ejx
2

xk =

xk =

1xn+1
1x

xm xn+1
1x

Marc Stoecklin : TABLES OF TRANSFORM PAIRS

Table of Continuous-time Frequency Fourier Transform Pairs

R +

==

f (t)

==

f (t)

==

f (t)

==

f (t) is purely real

==

f (t) is purely imaginary

==

even/symmetry
odd/antisymmetry

F (f ) = F (f )

F (f ) = F (f )

f (t t0 )

==

==
F

f (af )

1
f fa
|a|

==

af (t) + bg(t)

==

f (t)g(t)

==

f (t) g(t)

==

(t)

==

==
F

F
F

F (af )

aF (f ) + bG(t)
F (f ) G(f )
F (f )G(f )
1
ej2f t0

==

(f f0 )

a>0

==

2a
a2 +4 2 f 2
2
ef

==

2
1
ej( 4 f )

j
2
1
2
j
2
1
2
1
4
1
4

==

sin (2f0 t + )

==

cos (2f0 t + )

==

f (t) sin (2f0 t)

==

f (t) cos (2f0 t)

==

sin2 (t)

==

cos2 (t)

T
2
T
2

|t| 6
|t| >
|t| 6 T
|t| > T
8
<1 t > 0
u(t) = 1[0,+] (t) = :
0 t<0
8
<1
t>0
sgn (t) = :
1 t < 0
sinc (Bt)
sinc2 (Bt)
dn
f (t)
dtn
n
t f (t)
1
1+t2

(f )

2
ejt

==
F

==

e
(f + f0 ) ej (f f0 )
j

e
(f + f0 ) + ej (f f0 )
[F (f + f0 ) F (f f0 )]
[F (f + f0 ) + F (f f0 )]

`
2(f ) f 1 f +

`
2(f ) + f 1 + f +

T sinc T f

T sinc2 T f

1
j2f

1
jf

1
B
1
B

==
==
==
==
F

==

frequency shifting

frequency scaling

ej2f0 t

et

= 1[ T ,+ T ] (t) = :
2
2
0
8
` t <1 |t|
T
triang T = :
0

F (f
f0)
f
1
F
|a|
a

==

+ (f )

rect

f
B

f
B

triang

1
1
(f )
,+ B
]
B [ B
2
2

(j2f )n F (f )

1
dn
F (f )
(j2)n df n
e2|f |

==
==
F

==

odd/antisymmetry

F (f )ej2f t0

ea|t|

even/symmetry

F (f ) is purely imaginary

==
F

f (t)ej2f t dt

F (f ) is purely real

(t t0 )

F (f )

R +

F (f )
F (f )

==

8
<1

F (f ) = F {f (t)} =

==

f (t) =

time scaling

f (t) = f (t)

f (t)ej2f0 t

`t

f (t)

time shifting

rect

f (t)ej2f t df

Marc Stoecklin : TABLES OF TRANSFORM PAIRS

Table of Continuous-time Pulsation Fourier Transform Pairs

R +

==

x(t)

==

x(t)

==

x (t)

==

x(t) is purely real

==

x(t) is purely imaginary

==

even/symmetry
odd/antisymmetry

X(f ) = X ()

X(f ) = X ()

x(t t0 )

==

x(t)ej0 t

==
F

x (af )

1
x fa
|a|

==

ax1 (t) + bx2 (t)

==

x1 (t)x2 (t)

==

==

F
F

x1 (t) x2 (t)

==

(t)

==

(t t0 )

==

ea|t|

a>0

==
F

==
F

==
F

eat u(t)

<{a} > 0

==

eat u(t)

<{a} > 0

==

t2
2 2

==

sin (0 t + )

==

cos (0 t + )

==

x(t) sin (0 t)

==

x(t) cos (0 t)

==

sin2 (0 t)

==

cos2 (0 t)

==

8
<1

|t| 6 T2
|t| > T2
|t| 6 T
|t| > T
8
<1 t > 0
u(t) = 1[0,+] (t) = :
0 t<0
8
<1
t>0
sgn (t) = :
1 t < 0

= 1[ T ,+ T ] (t) = :
2
2
0
8
` t <1 |t|
T
triang T = :
0

sinc (T t)

even/symmetry
odd/antisymmetry

X() is purely imaginary

frequency shifting

frequency scaling

aX1 () + bX2 ()
1
X ()
2 1

X2 ()

X1 ()X2 ()
1
ejt0
2()
2( 0 )
2a
a2 + 2
1
a+j
1
aj

2 2
2e 2

j ej ( + 0 ) ej ( 0 )

ej ( + 0 ) + ej ( 0 )
j
2
1
2

[X ( + 0 ) X ( 0 )]
[X ( + 0 ) + X ( 0 )]

2 [2(f ) ( 0 ) ( + 0 )]

2 [2() + ( 0 ) + ( + 0 )]

==

==

==

T sinc

T sinc2

2
j

1
T
1
T

==

T
2

(f ) +

==

T
2

= 1
2T
` T
triang 2T

rect

(T t)

==

f (t)

==

(j)n X()

d
j n df
n X()

==
F

==

1
j

dn
dtn

1
t

x(t)ejt dt

X() is purely real

sinc2

tn f (t)

X()

R +

X()
X ()

==

X() = F {x(t)} =

==

x(t) =

ej0 t

x(t) = x (t)

time scaling

`t

x (t)

time shifting

rect

x(t)ejt d

jsgn()

1[2T,+2T ] (f )

Marc Stoecklin : TABLES OF TRANSFORM PAIRS

Table of Z-Transform Pairs

1
2j

==

X(z)

Rx

x[n]

==

X( z1 )

1
Rx

x [n]

==

X (z )

Rx

x [n]

==

X ( z1 )

1
Rx

<e{x[n]}

==

1
[X(z) + X (z )]
2
1
[X(z) X (z )]
2j

Rx

x[n n0 ]

==
Z

==

ax1 [n] + bx2 [n]

==

x1 [n]x2 [n]

==

x1 [n] x2 [n]

==

[n]

==

[n n0 ]

==

u[n]

==

==
Z

==
Z

an u[n]

==

==
Z

1]

==
==

n2 an u[n]

==

ean u[n]

==

n = 0, . . . , N 1
otherwise

==

sin (0 n) u[n]

==

Qm

i=1 (ni+1)
am m!

z 1
1z 1

j2
N

Rx
Rx Ry

aX1 (z) + bX2 (z)

R x Ry

X1 (z)X2 (t)

Rx Ry

z
z1
z
z1
z
(z1)2
z(z+1)
(z1)3
z(z 2 +4z+1)
(z1)4
z
z+1

==

nx[n]

WN = e

(1)n

cos (0 n) u[n]

Rx
|a|Rx

==

sin (0 n) u[n]

Rx

nan u[n]

an

z n0 X(z)
`
X az

1
1 PN 1
k N
k=0 X WN z
N

ROC

z n0

==

cos (0 n) u[n]

n=

n3 u[n]

an1 u[n

X(z) = Z {x[n]} =

n2 u[n]

an u[n 1]

==

N N0

x[N n]

nu[n]

z
z1

==

u[n 1]

Please note :

an x[n]

an

x[n]z n

x[n]

time shifting

(
an
0

P+

==

=m{x[n]}

downsampling by N

X(z)z n1 dz

Z
Z

z
za
z
za
1
za
az
(za)2
az(z+a
(za)3
z
zea

1aN z N
1az 1

z sin(0 )
z 2 2 cos(0 )z+1
z(zcos(0 ))
z 2 2 cos(0 )z+1
za sin(0 )
z 2 2a cos(0 )z+a2
z(za cos(0 ))
z 2 2a cos(0 )z+a2

==
Z

==
Z

==
Z

==
Z

x[n]
n

==

am u[n]

==

d
z dz
X(z)
R z X(z)
0 z dz
z
(za)m+1

|z| > 1
|z| < 1
|z| > 1
|z| > 1
|z| > 1
|z| < 1
|z| > |a|
|z| < |a|
|z| > |a|
|z| > |a|
|z| > |a|
|z| > |ea |
|z| > 0
|z| > 1
|z| > 1
|z| > a
|z| > a
Rx
Rx

Marc Stoecklin : TABLES OF TRANSFORM PAIRS

Table of Discrete Time Fourier Transform (DTFT) Pairs

R +

DT F T

P+

x[n]ejn

X(ej )ejn d

==

X(ej ) =

x[n]
x[n]
x [n]

==
DT F T
==
DT F T
==

DT F T

X(ej )
X(ej )
X (ej )

x[n] is purely real

==
DT F T
==
DT F T
==
DT F T
==

DT F T

X(ej ) = X (ej ) even/symmetry

x[n n0 ]
x[n]ej0 n

==
DT F T
==

DT F T

downsampling by 8
N x[N n] N N0

<x n
n = kN
upsampling by N : N
0
otherwise

==

X(ej )ejn0
X(ej(0 ) ) frequency shifting
j 2k
1 PN 1
N
)
k=0 X(e
N

x[n] =

time shifting

DT F T

X(ejN )

DT F T

aX1 (ej ) + bX2 (ej )

DT F T

X1 (ej )X2 (ej )

==

ax1 [n] + bx2 [n]

==
DT F T
==

x1 [n] x2 [n]

==

[n]
[n n0 ]
1

==
DT F T
==
DT F T
==

ej0 n

==

DT F T

DT F T

DT F T

u[n]

==

(|a| < 1)

==

(n + 1)an u[n]

==

sin (0 n + )

==

an u[n]

sin(c n)
n

DT F T

DT F T

DT F T

DT F T

DT F T

cos (0 n + )

==

= c sinc (c n)

==

DT F T

<1 |n| 6 M
=:
0 otherwise
8
`n
<1 0 6 n 6 M
1
MA : rect M 2 = :
0 otherwise

8
<1 0 6 n 6 M 1
n
1
MA : rect M 1 2 = :
0 otherwise

Window :

rect

n
M

nx[n]
x[n] x[n 1]
|a| < 1

an sin[0 (n+1)]
u[n]
sin 0

n=

DT F T

==

1
ejn0
P

()
= +
k= ( + 2k)
0 ) = P+ ( 0 + 2k)
(
k=

+ 21 ()
1ej
1
1aej
1
(1aej )2
j j
[e
(
2
1 j
[e
(
2

+ 0 + 2k) e+j ( 0 + 2k)]

<1
=:
0
sin[ (M + 1
)]
2

rect

|| < c
c < || <

sin(/2)

==

DT F T

sin[(M +1)/2] jM/2

DT F T

sin[M/2] j(M 1)/2

DT F T

d
j d
X(ej )

==
==
DT F T

==
DT F T
==

(1 ej )X(ej )
1
12a cos(0 ej )+a2 ej2

Some remarks

()
=

+
X

( + 2k)

rect()
=

k=

k=

Parseval :
+
X
n=

|x[n]|2 =

+
X

1
2

|X(ej )|2 d

rect( + 2k)

Marc Stoecklin : TABLES OF TRANSFORM PAIRS

Table of Laplace Transform Pairs

1
2j

R c+j
cj

f (t a)

==

f (t)

==

L
L

t>a>0

==

eat f (t)

==
L

a>0

==

af1 (t) + bf2 (t)

==

f1 (t)f2 (t)

==

f1 (t) f2 (t)

==

(t)

==

==

f (at)

L
L

==

eat

==

teat

==

eat

==

t
a

1
a

1
e
a
`

at
1e

==

sin (t)

==

==
L

cos (t)

==

sinh (t)

==

cosh (t)

==

eat sin (t)

==

eat cos (t)

==

tn

==

f 00 (t) =
f (n) (t)

=
Rt
0

L
L

tn f (t)

==

d
f (t)
dt
2
d
f (t)
dt2
dn
f (t)
dtn

==

f (u)du

==

f 0 (t) =
In general :

F (s)est ds

F (s) = L {f (t)} =

R +

f (t)est dt

F (s)
aas F (s)
F (s + a)
1
F ( as )
a

aF1 (s) + bF2 (s)

s2 + 2
s
s2 + 2

s2 2
s
s2 2

(s+a)2 + 2
s+a
(s+a)2 + 2
n!
s+n+1
(1)n F (n) (s)

sF (s) f (0)

s2 F (s) sf (0) f 0 (0)

sn F (s) sn1 f (0) . . . f (n1) (0)

1
F (s)
Rs
s F (u)du

==
==

1
f (t)
t

==

f 1 (t)

==

f n (t)

==

L
L

F (s)f 1
s
F (s)
f 1 (0)
+ sn
sn

f 2 (0)
sn1

+ ... +

f n (0)
s