Tables of Common Transform Pairs

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
find 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 verified its correctness. Nevertheless, it is still possible that you may find 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

Real part

<e {f (t)} =

Imaginary part

1
=m {f (t)} = 2j
[f (t) f (t)]
(
1, n = 0
[n] =
0, n 6= 0
(
1, n 0
u[n] =
0, n < 0

Dirac delta/Unit impulse

Heaviside step/Unit step

z = a jb

1
2

[f (t) + f (t)]

ejx ejx
2j

Sine/Cosine

sin (x) =

Sinc function

sinc (x)

sin(x)
x

cos (x) =

(unnormalized)
if |t| 6
if |t| >

1
0

ejx +ejx
2

T
2
T
2

Rectangular function

rect( Tt ) =

Triangular function

triang

Convolution

continuous-time:

(f g)(t) =

R +

discrete-time:

(u v)[n] =

Parseval theorem

t
T

= rect( Tt ) rect( Tt ) =

general statement:

R +

continuous-time:

R +

k=0

xk =

|t|
T

|t| 6 T
|t| > T

Pn

k=m

m=

1xn+1
1x

xk =

xk =

xm xn+1
1x

u[m] v [n m]
R +

R +

|x[n]|2 =

Pn

k=0

f ( ) g (t )d

|f (t)|2 dt =

n=

1
1x

in general:

f (t)g (t)dt =

P+

discrete-time:
Geometric series

1
2

F (f )G (f )df

|F (f )|2 df
R +

|X(ej )|2 d

Marc Ph. Stoecklin TABLES OF TRANSFORM PAIRS v1.5.3

Table of Continuous-time Frequency Fourier Transform Pairs

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

R +

R +

f (t)ej2f t dt

f (t)ej2f t df

==

f (t)

==

time reversal

f (t)

==

complex conjugation

f (t)

==

F (f )

reversed conjugation

reversed conjugation

f (t)

==

F (f )

complex conjugation

f (t) is purely real

==

F (f ) = F (f )

F (f ) = F (f )

transform

f (t) is purely imaginary

==

f (t) = f (t)

==

f (t) = f (t)

==

f (t t0 )

==

f (t)ej2f0 t

==

even/symmetry
odd/antisymmetry
time shifting
time scaling

f (af )
 

1
f
|a|

linearity

f
a

af (t) + bg(t)

two-sided exponential decay

==
F

==
F

==
F

==

(t)

==

(t t0 )

==

ea|t|

F
F

==
F

squared sine

sin2 (t)

==

squared cosine

cos2 (t)

==

1 |t| 6 T
t
2
=
T
0 |t| > T
2

1 |t| |t| 6 T
t
T
=
T
0
|t| > T

1 t > 0
1[0,+] (t) =
0 t<0

1
t>0

rect

squared sinc
n-th time derivative
n-th frequency derivative

t<0

sinc (Bt)
sinc2 (Bt)
dn
f (t)
dtn
tn f (t)
1
1+t2

==

ej2f t0
(f )

delta function

ej (f + f0 ) ej (f f0 )

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

==

shifted delta function

==

frequency multiplication

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

==

frequency convolution

F (f )G(f )

sin (2f0 t + )

==

sinc

F (f ) G(f )

2
1
ej( 4 f )

==

sgn (t) =
1

aF (f ) + bG(t)

==

signum

frequency scaling

2a
a2 +4 2 f 2
2
ef

==

frequency shifting

F (af )

f (t) sin (2f0 t)

u(t) =

F (f
 f0)
1
F fa
|a|

==

f (t) cos (2f0 t)

step

F (f )ej2f t0

a>0

cosine modulation

triang

F (f ) is purely imaginary

(f f0 )

2
ejt

+ (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
2|f
|
e

==
==
F

==

even/symmetry
odd/antisymmetry

F (f ) is purely real

==

sine modulation

triangular

frequency reversal

==

cos (2f0 t + )

rectangular

F (f )

F (f )

ej2f0 t

cosine

==

et

sine

f (t)g(t)

delta function
shifted delta function

f (t) g(t)

time multiplication
frequency convolution

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


1



Marc Ph. Stoecklin TABLES OF TRANSFORM PAIRS v1.5.3

Table of Continuous-time Pulsation Fourier Transform Pairs

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

R +

x(t)ejt d

==

x(t)

==

transform

time reversal

x(t)

==

complex conjugation

x (t)

==

reversed conjugation

x (t)

==

x(t) is purely real

==

X(f ) = X ()

X(f ) = X ()

==

x(t)ej0 t

==

x (af )
 
1
x fa
|a|

==

==

==

x1 (t)x2 (t)

==

x1 (t) x2 (t)

==

(t)

==

(t t0 )

==

shifted delta function

ea|t|

two-sided exponential decay

ax1 (t) + bx2 (t)

delta function

==

ej0 t

==

a>0

==

eat u(t)

<{a} > 0

==

eat u(t)

<{a} > 0

==

exponential decay
reversed exponential decay

x(t t0 )

frequency convolution

t2

e 22

F
F

==

sine

sin (0 t + )

==

cosine

cos (0 t + )

==

sine modulation

x(t) sin (0 t)

==

x(t) cos (0 t)

==

squared sine

sin2 (0 t)

==

squared cosine

cos2 (0 t)

==

cosine modulation

rectangular
triangular
step

triang
u(t) =

signum
sinc
squared sinc
n-th time derivative
n-th frequency derivative
time inverse

1 |t| 6 T
t
2
=
T
0 |t| > T
2

1 |t| |t| 6 T
t
T
=
T
0
|t| > T

1 t > 0
1[0,+] (t) =
0 t<0

1
t>0

rect

sgn (t) =
1

t<0

sinc (T t)

frequency reversal
complex conjugation

==

time multiplication

X()
X ()

x(t) = x (t)

linearity

X()

==

time scaling

x(t)ejt dt

reversed conjugation

x(t) = x (t)

time shifting

X ()

==

odd/antisymmetry

R +

x(t) is purely imaginary

even/symmetry

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

even/symmetry
odd/antisymmetry

X() is purely real

X() is purely imaginary
X()ejt0
X( 0 )


1
X
|a|
a

frequency shifting

X(a)

frequency scaling

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

X2 () frequency convolution

X1 ()X2 ()

frequency multiplication

1
ejt0
2()

delta function

2( 0 )

shifted delta function

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
j

= T1
2T

triang 2T

rect

sinc2 (T t)

==

dn
f (t)
dtn
tn f (t)

==

(j)n X()

d
j n df
n X()

1
t

==

==
F

jsgn()

1[T,+T ] (f )

Marc Ph. Stoecklin TABLES OF TRANSFORM PAIRS v1.5.3

Table of z-Transform Pairs

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

1
2j

P+

x[n]z n

X(z)z n1 dz

==

x[n]

==

X(z)

Rx

X( z1 )

1
Rx

transform

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

n=

ROC

time reversal

x[n]

==

complex conjugation

x [n]

==

X (z )

Rx

reversed conjugation

x [n]

==

X ( z1 )

1
Rx

<e{x[n]}

==

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

Rx

real part

imaginary part

=m{x[n]}

==

time shifting

x[n n0 ]

==

z n0 X(z)


z

an x[n]

==

downsampling by N

x[N n], N N0

==

1
N

linearity

ax1 [n] + bx2 [n]

==

scaling in Z

time multiplication
frequency convolution

x1 [n]x2 [n]

==

x1 [n] x2 [n]

==

[n]

==

delta function
shifted delta function

==
Z

==

Z
Z

(1)n

==

an u[n]

==

Z
Z

==
Z

1]

==

nan u[n]

==

n2 an u[n]

==

ean u[n]

==

n = 0, . . . , N 1
otherwise

==

sin (0 n) u[n]

==

an
an

sin (0 n) u[n]

X1 (z)X2 (t)

Rx Ry

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

nx[n]

==

i=1 (ni+1)
am m!

Rx Ry

==

integration in Z
Qm

cos (0 n) u[n]

differentiation in Z

z
1
=
z1
1 z 1

==

cos (0 n) u[n]

Note:

==

==

cosine

Rx Ry

aX1 (z) + bX2 (z)

H

1
z
1
X1 (u)X2 u
u du
2j

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

n3 u[n 1]

sine

Rx

==

an1 u[n

j2
N

nu[n]

an u[n 1]

WN = e

n3 u[n]

exponential



1
X WNk z N

z n0

n2 u[n]
1]

k=0

==

n2 u[n

a
P
N 1

Rx
|a|Rx

u[n]

ramp

an
0

==

u[n 1]

exp. interval

[n n0 ]

step

Rx

x[n]
n

==

am u[n]

==

dX(z)

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

|z| > 1
|z| < 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 Ph. Stoecklin TABLES OF TRANSFORM PAIRS v1.5.3

Table of Common Discrete Time Fourier Transform (DTFT) Pairs

1
2

R +

DT F T

P+

x[n]ejn

X(ej )ejn d

==

X(ej ) =

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

x [n]

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

DT F T

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

x[n] is purely real

x[n] is purely imaginary
x[n] = x [n]
x[n] = x [n]

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

DT F T

X(ej ) = X (ej )
X(ej ) = X (ej )
X(ej ) is purely real
X(ej ) is purely imaginary

x[n n0 ]
x[n]ej0 n

==
DT F T
==

DT F T

X(ej )ejn0
X(ej(0 ) )

x[N n] N N0

n = kN
otherwise

==

ax1 [n] + bx2 [n]

x1 [n]x2 [n]

==
DT F T
==

frequency convolution

x1 [n] x2 [n]

==

delta function
shifted delta function

[n]
[n n0 ]
1
ej0 n

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

sin (0 n + )

==

x[n] =

transform
time reversal
complex conjugation
reversed conjugation

even/symmetry
odd/antisymmetry
time shifting

downsampling by N


x n
N
0

upsampling by N
linearity
time multiplication

sine
cosine

cos (0 n + )

rectangular

rect

n
M

=
0

DT F T

X1 (ej )X2 (ej )

DT F T

DT F T
DT F T

==
==

u[n]

==

DT F T

DT F T
DT F T

==
==

sinc (c n)

==

DT F T

(|a| < 1)

2k
N

aX1 (ej ) + bX2 (ej )

X1 (ej ) X2 (ej ) =
frequency convolution
R +
1
j() )X (ej )d
X
(e
1
2
2

(|a| < 1)

sin(c n)
n

X(ej

DT F T

==

special decaying step (n + 1)an u[n]

sinc

k=0

frequency shifting

X(ejN )

an u[n]

decaying step

PN 1

even/symmetry
odd/antisymmetry

DT F T

|n| 6 M
otherwise

step

1
N

n=

DT F T

DT F T

frequency multiplication

1
ejn0

()
0 )
(

delta function
shifted delta function

j j
[e
(
2
1 j
[e
(
2

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

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

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

+ 12 ()
1ej
1
1aej
1
(1aej )2
  1

rect
=
c
0

|| < c
c < || <

MA
MA

rect
rect

n
M 1

1 0 6 n 6 M
=
0 otherwise

1 0 6 n 6 M 1
12 =
0 otherwise
n
M

1
2

derivation

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

difference

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

Note:

()
=

+
X

( + 2k)

n=

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

e
sin(/2)

DT F T

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

e
sin(/2)

DT F T

d
X(ej )
j d

==
==
DT F T

==
DT F T
==

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

+
X
k=

Parseval:
|x[n]|2 =

DT F T

rect()
=

k=

+
X

==

1
2

|X(ej )|2 d

rect( + 2k)

Marc Ph. Stoecklin TABLES OF TRANSFORM PAIRS v1.5.3

Table of Laplace Transform Pairs

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

1
2j

limT

R c+jT

==

f (t)

==

f (t)

==

t>a>0

==

eat f (t)

==

F (s + a)

f (at)

==

1
F ( as )
|a|

af1 (t) + bf2 (t)

==

f1 (t)f2 (t)

==

f1 (t) f2 (t)

==

(t)

==

(t a)

==

eas

u(t)

==

tu(t)

==

t2 u(t)

==

tn

==

1
s
1
s2
2
s3
n!
sn+1

eat

==

ea|t|

==

teat

==

(1 at)eat

==

1 eat

==

sin (t)

==

transform
complex conjugation
f (t a)

time shifting
time scaling
linearity
time multiplication
time convolution
delta function
shifted delta function
unit step
ramp
parabola
n-th power
exponential decay
two-sided exponential decay

exponential approach

F (s)est ds

cjT

sine

F (s )

aas F (s)

L
L
L
L

==

hyperbolic sine

sinh (t)

==

hyperbolic cosine

cosh (t)

==

exponentially decaying sine

eat sin (t)

==

exponentially decaying cosine

eat cos (t)

==

tf (t)

==

frequency differentiation

==

f (n) (t) =

exponential decay

1
s+a
2a
a2 s2
1
(s+a)2
s
(s+a)2
a
s(s+a)

s2 + 2
s
s2 + 2

s2 2
s
s2 2

(s+a)2 + 2
s+a
(s+a)2 + 2

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

==

time inverse

f 1 (t)

==

time differentiation

f n (t)

==

frequency integration

frequency product

(1)n F (n) (s)

f ( )d = (u f )(t)

time n-th differentiation

frequency convolution

F1 (s)F2 (s)

F 0 (s)

==

f (t)est dt

frequency shifting

F1 (s) F2 (s)

aF1 (s) + bF2 (s)

==

f 00 (t) =

d
f (t)
dt
d2
f
(t)
2
dt
dn
f
(t)
n
dt

f 0 (t) =

Rt

==

time 2nd differentiation

time integration

tn f (t)

frequency n-th differentiation

time differentiation

R +

F (s)

cos (t)

cosine

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

L
L

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

f 2 (0)
sn1

+ ... +

f n (0)
s