Tables of Common Transform Pairs

2012 by Marc Ph. Stoecklin marca stoecklin.net http://www.stoecklin.net/ 2012-12-20 version v1.5.3
Engineers and students 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
nd the appropriate transform in a book or the Internet, much less to have a comprehensive overview
of transformation pairs and corresponding properties.
In this document I compiled 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.
Please note that, before including a transformation pair in the table, I veried its correctness. Nev-
ertheless, it is still possible that you may nd errors or typos. I am very grateful to everyone dropping
me a line and pointing out any concerns or typos.
Notation, Conventions, and Useful Formulas
Imaginary unit j
2
= 1
Complex conjugate z = a + jb z

= a jb
Real part e {f(t)} =
1
2
[f(t) + f

(t)]
Imaginary part m{f(t)} =
1
2j
[f(t) f

(t)]
Dirac delta/Unit impulse [n] =

1, n = 0
0, n = 0
Heaviside step/Unit step u[n] =

1, n 0
0, n < 0
Sine/Cosine sin (x) =
e
jx
e
jx
2j
cos (x) =
e
jx
+e
jx
2
Sinc function sinc (x)
sin(x)
x
(unnormalized)
Rectangular function rect(
t
T
) =

1 if |t|
T
2
0 if |t| >
T
2
Triangular function triang

t
T

= rect(
t
T
) rect(
t
T
) =

1
|t|
T
|t| T
0 |t| > T
Convolution continuous-time: (f g)(t) =

f() g

(t )d
discrete-time: (u v)[n] =

m=
u[m] v

[n m]
Parseval theorem general statement:

f(t)g

(t)dt =

F(f)G

(f)df
continuous-time:

|f(t)|
2
dt =

|F(f)|
2
df
discrete-time:

+
n=
|x[n]|
2
=
1
2

|X(e
j
)|
2
d
Geometric series

k=0
x
k
=
1
1x

n
k=0
x
k
=
1x
n+1
1x
in general:

n
k=m
x
k
=
x
m
x
n+1
1x
1
Marc Ph. Stoecklin TABLES OF TRANSFORM PAIRS v1.5.3 2
Table of Continuous-time Frequency Fourier Transform Pairs
f(t) = F
1
{F(f)} =
_
+

f(t)e
j2ft
df
F
== F(f) = F {f(t)} =
_
+

f(t)e
j2ft
dt
transform f(t)
F
== F(f)
time reversal f(t)
F
== F(f) frequency reversal
complex conjugation f

(t)
F
== F

(f) reversed conjugation

reversed conjugation f

(t)
F
== F

(f) complex conjugation

f(t) is purely real
F
== F(f) = F

(f) even/symmetry
f(t) is purely imaginary
F
== F(f) = F

(f) odd/antisymmetry
even/symmetry f(t) = f

(t)
F
== F(f) is purely real
odd/antisymmetry f(t) = f

(t)
F
== F(f) is purely imaginary
time shifting f(t t
0
)
F
== F(f)e
j2ft
0
f(t)e
j2f
0
t
F
== F(f f
0
) frequency shifting
time scaling f (af)
F
==
1
|a|
F
_
f
a
_
1
|a|
f
_
f
a
_
F
== F(af) frequency scaling
linearity af(t) +bg(t)
F
== aF(f) +bG(t)
time multiplication f(t)g(t)
F
== F(f) G(f) frequency convolution
frequency convolution f(t) g(t)
F
== F(f)G(f) frequency multiplication
delta function (t)
F
== 1
shifted delta function (t t
0
)
F
== e
j2ft
0
1
F
== (f) delta function
e
j2f
0
t
F
== (f f
0
) shifted delta function
two-sided exponential decay e
a|t|
a > 0
F
==
2a
a
2
+4
2
f
2
e
t
2 F
== e
f
2
e
jt
2 F
== e
j(
1
4
f
2
)
sine sin (2f
0
t +)
F
==
j
2
_
e
j
(f +f
0
) e
j
(f f
0
)
_
cosine cos (2f
0
t +)
F
==
1
2
_
e
j
(f +f
0
) +e
j
(f f
0
)
_
sine modulation f(t) sin (2f
0
t)
F
==
j
2
[F (f +f
0
) F (f f
0
)]
cosine modulation f(t) cos (2f
0
t)
F
==
1
2
[F (f +f
0
) +F (f f
0
)]
squared sine sin
2
(t)
F
==
1
4
_
2(f)
_
f
1

_
f +
1

__
squared cosine cos
2
(t)
F
==
1
4
_
2(f) +
_
f
1

_
+
_
f +
1

__
rectangular rect
_
t
T
_
=

1 |t|
T
2
0 |t| >
T
2
F
== T sinc Tf
triangular triang
_
t
T
_
=

1
|t|
T
|t| T
0 |t| > T
F
== T sinc
2
Tf
step u(t) = 1
[0,+]
(t) =

1 t 0
0 t < 0
F
==
1
j2f
+(f)
signum sgn (t) =

1 t 0
1 t < 0
F
==
1
jf
sinc sinc (Bt)
F
==
1
B
rect
_
f
B
_
=
1
B
1
[
B
2
,+
B
2
]
(f)
squared sinc sinc
2
(Bt)
F
==
1
B
triang
_
f
B
_
n-th time derivative
d
n
dt
n
f(t)
F
== (j2f)
n
F(f)
n-th frequency derivative t
n
f(t)
F
==
1
(j2)
n
d
n
df
n
F(f)
1
1+t
2
F
== e
2|f|
Marc Ph. Stoecklin TABLES OF TRANSFORM PAIRS v1.5.3 3
Table of Continuous-time Pulsation Fourier Transform Pairs
x(t) = F
1

{X()} =
_
+

x(t)e
jt
d
F

== X() = F

{x(t)} =
_
+

x(t)e
jt
dt
transform x(t)
F

== X()
time reversal x(t)
F

== X() frequency reversal

complex conjugation x

(t)
F

== X

() reversed conjugation
reversed conjugation x

(t)
F

== X

() complex conjugation
x(t) is purely real
F

== X(f) = X

() even/symmetry
x(t) is purely imaginary
F

== X(f) = X

() odd/antisymmetry
even/symmetry x(t) = x

(t)
F

== X() is purely real

odd/antisymmetry x(t) = x

(t)
F

== X() is purely imaginary

time shifting x(t t
0
)
F

== X()e
jt
0
x(t)e
j
0
t
F

== X(
0
) frequency shifting
time scaling x(af)
F

==
1
|a|
X
_

a
_
1
|a|
x
_
f
a
_
F

== X(a) frequency scaling

linearity ax
1
(t) +bx
2
(t)
F

== aX
1
() +bX
2
()
time multiplication x
1
(t)x
2
(t)
F

==
1
2
X
1
() X
2
() frequency convolution
frequency convolution x
1
(t) x
2
(t)
F

== X
1
()X
2
() frequency multiplication
delta function (t)
F

== 1
shifted delta function (t t
0
)
F

== e
jt
0
1
F

== 2() delta function

e
j
0
t
F

== 2(
0
) shifted delta function
two-sided exponential decay e
a|t|
a > 0
F

==
2a
a
2
+
2
exponential decay e
at
u(t) {a} > 0
F

==
1
a+j
reversed exponential decay e
at
u(t) {a} > 0
F

==
1
aj
e
t
2
2
2
F

==

2e

2
2
sine sin (
0
t +)
F

== j
_
e
j
( +
0
) e
j
(
0
)
_
cosine cos (
0
t +)
F

==
_
e
j
( +
0
) +e
j
(
0
)
_
sine modulation x(t) sin (
0
t)
F

==
j
2
[X ( +
0
) X (
0
)]
cosine modulation x(t) cos (
0
t)
F

==
1
2
[X ( +
0
) +X (
0
)]
squared sine sin
2
(
0
t)
F

==
2
[2(f) (
0
) ( +
0
)]
squared cosine cos
2
(
0
t)
F

==
2
[2() + (
0
) + ( +
0
)]
rectangular rect
_
t
T
_
=

1 |t|
T
2
0 |t| >
T
2
F

== T sinc
_
T
2
_
triangular triang
_
t
T
_
=

1
|t|
T
|t| T
0 |t| > T
F

== T sinc
2
_
T
2
_
step u(t) = 1
[0,+]
(t) =

1 t 0
0 t < 0
F

== (f) +
1
j
signum sgn (t) =

1 t 0
1 t < 0
F

==
2
j
sinc sinc (Tt)
F

==
1
T
rect
_

2T
_
=
1
T
1
[T,+T]
(f)
squared sinc sinc
2
(Tt)
F

==
1
T
triang
_

2T
_
n-th time derivative
d
n
dt
n
f(t)
F

== (j)
n
X()
n-th frequency derivative t
n
f(t)
F

== j
n d
n
df
n
X()
time inverse
1
t
F

== jsgn()
Marc Ph. Stoecklin TABLES OF TRANSFORM PAIRS v1.5.3 4
Table of z-Transform Pairs
x[n] = Z
1
{X(z)} =
1
2j
_
X(z)z
n1
dz
Z
== X(z) = Z {x[n]} =

+
n=
x[n]z
n
ROC
transform x[n]
Z
== X(z) R
x
time reversal x[n]
Z
== X(
1
z
)
1
R
x
complex conjugation x

[n]
Z
== X

(z

) R
x
reversed conjugation x

[n]
Z
== X

(
1
z

)
1
R
x
real part e{x[n]}
Z
==
1
2
[X(z) +X

(z

)] R
x
imaginary part m{x[n]}
Z
==
1
2j
[X(z) X

(z

)] R
x
time shifting x[n n
0
]
Z
== z
n
0
X(z) R
x
scaling in Z a
n
x[n]
Z
== X
_
z
a
_
|a|R
x
downsampling by N x[Nn], N N
0
Z
==
1
N

N1
k=0
X
_
W
k
N
z
1
N
_
W
N
= e

j2
N R
x
linearity ax
1
[n] +bx
2
[n]
Z
== aX
1
(z) +bX
2
(z) R
x
R
y
time multiplication x
1
[n]x
2
[n]
Z
==
1
2j
_
X
1
(u)X
2
_
z
u
_
u
1
du R
x
R
y
frequency convolution x
1
[n] x
2
[n]
Z
== X
1
(z)X
2
(t) R
x
R
y
delta function [n]
Z
== 1 z
shifted delta function [n n
0
]
Z
== z
n
0
z
step u[n]
Z
==
z
z1
|z| > 1
u[n 1]
Z
==
z
z1
|z| < 1
ramp nu[n]
Z
==
z
(z1)
2
|z| > 1
n
2
u[n]
Z
==
z(z+1)
(z1)
3
|z| > 1
n
2
u[n 1]
Z
==
z(z+1)
(z1)
3
|z| < 1
n
3
u[n]
Z
==
z(z
2
+4z+1)
(z1)
4
|z| > 1
n
3
u[n 1]
Z
==
z(z
2
+4z+1)
(z1)
4
|z| < 1
(1)
n
Z
==
z
z+1
|z| < 1
exponential a
n
u[n]
Z
==
z
za
|z| > |a|
a
n
u[n 1]
Z
==
z
za
|z| < |a|
a
n1
u[n 1]
Z
==
1
za
|z| > |a|
na
n
u[n]
Z
==
az
(za)
2
|z| > |a|
n
2
a
n
u[n]
Z
==
az(z+a
(za)
3
|z| > |a|
e
an
u[n]
Z
==
z
ze
a
|z| > |e
a
|
exp. interval
_
a
n
n = 0, . . . , N 1
0 otherwise
Z
==
1a
N
z
N
1az
1
|z| > 0
sine sin (
0
n) u[n]
Z
==
z sin(
0
)
z
2
2 cos(
0
)z+1
|z| > 1
cosine cos (
0
n) u[n]
Z
==
z(zcos(
0
))
z
2
2 cos(
0
)z+1
|z| > 1
a
n
sin (
0
n) u[n]
Z
==
za sin(
0
)
z
2
2a cos(
0
)z+a
2
|z| > a
a
n
cos (
0
n) u[n]
Z
==
z(za cos(
0
))
z
2
2a cos(
0
)z+a
2
|z| > a
dierentiation in Z nx[n]
Z
== z
dX(z)
dz
R
x
integration in Z
x[n]
n
Z
==
_
z
0
X(z)
z
dz R
x

m
i=1
(ni+1)
a
m
m!
a
m
u[n]
Z
==
z
(za)
m+1
Note:
z
z 1
=
1
1 z
1
Marc Ph. Stoecklin TABLES OF TRANSFORM PAIRS v1.5.3 5
Table of Common Discrete Time Fourier Transform (DTFT) Pairs
x[n] =
1
2
_
+

X(e
j
)e
jn
d
DTFT
== X(e
j
) =

+
n=
x[n]e
jn
transform x[n]
DTFT
== X(e
j
)
time reversal x[n]
DTFT
== X(e
j
)
complex conjugation x

[n]
DTFT
== X

(e
j
)
reversed conjugation x

[n]
DTFT
== X

(e
j
)
x[n] is purely real
DTFT
== X(e
j
) = X

(e
j
) even/symmetry
x[n] is purely imaginary
DTFT
== X(e
j
) = X

(e
j
) odd/antisymmetry
even/symmetry x[n] = x

[n]
DTFT
== X(e
j
) is purely real
odd/antisymmetry x[n] = x

[n]
DTFT
== X(e
j
) is purely imaginary
time shifting x[n n
0
]
DTFT
== X(e
j
)e
jn
0
x[n]e
j
0
n
DTFT
== X(e
j(
0
)
) frequency shifting
downsampling by N x[Nn] N N
0
DTFT
==
1
N

N1
k=0
X(e
j
2k
N )
upsampling by N

x
_
n
N
_
n = kN
0 otherwise
DTFT
== X(e
jN
)
linearity ax
1
[n] +bx
2
[n]
DTFT
== aX
1
(e
j
) +bX
2
(e
j
)
time multiplication x
1
[n]x
2
[n]
DTFT
== X
1
(e
j
) X
2
(e
j
) = frequency convolution
1
2
_
+

X
1
(e
j()
)X
2
(e
j
)d
frequency convolution x
1
[n] x
2
[n]
DTFT
== X
1
(e
j
)X
2
(e
j
) frequency multiplication
delta function [n]
DTFT
== 1
shifted delta function [n n
0
]
DTFT
== e
jn
0
1
DTFT
==

() delta function
e
j
0
n
DTFT
==

(
0
) shifted delta function
sine sin (
0
n +)
DTFT
==
j
2
[e
j
( +
0
+ 2k) e
+j
(
0
+ 2k)]
cosine cos (
0
n +)
DTFT
==
1
2
[e
j
( +
0
+ 2k) +e
+j
(
0
+ 2k)]
rectangular rect
_
n
M
_
=

1 |n| M
0 otherwise
DTFT
==
sin[(M+
1
2
)]
sin(/2)
step u[n]
DTFT
==
1
1e
j
+
1
2

()
decaying step a
n
u[n] (|a| < 1)
DTFT
==
1
1ae
j
special decaying step (n + 1)a
n
u[n] (|a| < 1)
DTFT
==
1
(1ae
j
)
2
sinc
sin(
c
n)
n
=

c

sinc (
c
n)
DTFT
==

rect
_

c
_
=

1 || <
c
0
c
< || <
MA rect
_
n
M

1
2
_
=

1 0 n M
0 otherwise
DTFT
==
sin[(M+1)/2]
sin(/2)
e
jM/2
MA rect
_
n
M1

1
2
_
=

1 0 n M 1
0 otherwise
DTFT
==
sin[M/2]
sin(/2)
e
j(M1)/2
derivation nx[n]
DTFT
== j
d
d
X(e
j
)
dierence x[n] x[n 1]
DTFT
== (1 e
j
)X(e
j
)
a
n
sin[
0
(n+1)]
sin
0
u[n] |a| < 1
DTFT
==
1
12a cos(
0
e
j
)+a
2
e
j2
Note:

() =
+

k=
( + 2k)

rect() =
+

k=
rect( + 2k)
Parseval:
+

n=
|x[n]|
2
=
1
2
_
+

|X(e
j
)|
2
d
Marc Ph. Stoecklin TABLES OF TRANSFORM PAIRS v1.5.3 6
Table of Laplace Transform Pairs
f(t) = L
1
{F(s)} =
1
2j
lim
T
_
c+jT
cjT
F(s)e
st
ds
L
== F(s) = L{f(t)} =
_
+

f(t)e
st
dt
transform f(t)
L
== F(s)
complex conjugation f

(t)
L
== F

(s

)
time shifting f(t a) t a > 0
L
== a
as
F(s)
e
at
f(t)
L
== F(s +a) frequency shifting
time scaling f(at)
L
==
1
|a|
F(
s
a
)
linearity af
1
(t) +bf
2
(t)
L
== aF
1
(s) +bF
2
(s)
time multiplication f
1
(t)f
2
(t)
L
== F
1
(s) F
2
(s) frequency convolution
time convolution f
1
(t) f
2
(t)
L
== F
1
(s)F
2
(s) frequency product
delta function (t)
L
== 1
shifted delta function (t a)
L
== e
as
exponential decay
unit step u(t)
L
==
1
s
ramp tu(t)
L
==
1
s
2
parabola t
2
u(t)
L
==
2
s
3
n-th power t
n
L
==
n!
s
n+1
exponential decay e
at
L
==
1
s+a
two-sided exponential decay e
a|t|
L
==
2a
a
2
s
2
te
at
L
==
1
(s+a)
2
(1 at)e
at
L
==
s
(s+a)
2
exponential approach 1 e
at
L
==
a
s(s+a)
sine sin (t)
L
==

s
2
+
2
cosine cos (t)
L
==
s
s
2
+
2
hyperbolic sine sinh (t)
L
==

s
2

2
hyperbolic cosine cosh (t)
L
==
s
s
2

2
exponentially decaying sine e
at
sin (t)
L
==

(s+a)
2
+
2
exponentially decaying cosine e
at
cos (t)
L
==
s+a
(s+a)
2
+
2
frequency dierentiation tf(t)
L
== F

(s)
frequency n-th dierentiation t
n
f(t)
L
== (1)
n
F
(n)
(s)
time dierentiation f

(t) =
d
dt
f(t)
L
== sF(s) f(0)
time 2nd dierentiation f

(t) =
d
2
dt
2
f(t)
L
== s
2
F(s) sf(0) f

(0)
time n-th dierentiation f
(n)
(t) =
d
n
dt
n
f(t)
L
== s
n
F(s) s
n1
f(0) . . . f
(n1)
(0)
time integration
_
t
0
f()d = (u f)(t)
L
==
1
s
F(s)
frequency integration
1
t
f(t)
L
==
_

s
F(u)du
time inverse f
1
(t)
L
==
F(s)f
1
s
time dierentiation f
n
(t)
L
==
F(s)
s
n
+
f
1
(0)
s
n
+
f
2
(0)
s
n1
+. . . +
f
n
(0)
s