Tables of Common Transform Pairs

2012 by Marc Ph. Stoecklin marc

a 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
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. Nev-
ertheless, 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 z = a jb

Real part <e {f (t)} = 1

2
[f (t) + f (t)]

Imaginary part 1
=m {f (t)} = 2j [f (t) f (t)]
(
1, n = 0
Dirac delta/Unit impulse [n] =
0, n 6= 0
(
1, n 0
Heaviside step/Unit step u[n] =
0, n < 0
ejx ejx ejx +ejx
Sine/Cosine sin (x) = 2j
cos (x) = 2

sin(x)
Sinc function sinc (x) x
(unnormalized)
(
T
1 if |t| 6
Rectangular function rect( Tt ) = 2
T
0 if |t| > 2

|t|
t
1

|t| 6 T
= rect( Tt ) rect( Tt ) =


Triangular function triang T
T 0 |t| > T
R +
Convolution continuous-time: (f g)(t) =
f ( ) g (t )d
P
discrete-time: (u v)[n] = m= u[m] v [n m]
R + R +
Parseval theorem general statement:
f (t)g (t)dt =
F (f )G (f )df
R + R +
continuous-time:
|f (t)|2 dt =
|F (f )|2 df
P+ R +
discrete-time: n= |x[n]|2 = 1
2
|X(ej )|2 d

1xn+1
P Pn
Geometric series k=0 xk = 1
1x k=0 xk = 1x

xm xn+1
Pn
in general: k=m xk = 1x

1
Marc Ph. Stoecklin TABLES OF TRANSFORM PAIRS v1.5.3 2

Table of Continuous-time Frequency Fourier Transform Pairs

R + F R +
f (t) = F 1 {F (f )} = f (t)ej2f t df == F (f ) = F {f (t)} = f (t)ej2f t dt

F
transform f (t) == F (f )
F
time reversal f (t) == F (f ) frequency reversal
F
complex conjugation f (t) == F (f ) reversed conjugation
F
reversed conjugation f (t) == F (f ) complex conjugation
F
f (t) is purely real == F (f ) = F (f ) even/symmetry
F
f (t) is purely imaginary == F (f ) = F (f ) odd/antisymmetry
F
even/symmetry f (t) = f (t) == F (f ) is purely real
F
odd/antisymmetry f (t) = f (t) == F (f ) is purely imaginary
F
time shifting f (t t0 ) == F (f )ej2f t0
F
f (t)ej2f0 t == F (f
 f0) frequency shifting
F
time scaling f (af ) == 1
|a|
F fa
 
1 f F
|a|
f a
== F (af ) frequency scaling
F
linearity af (t) + bg(t) == aF (f ) + bG(t)
F
time multiplication f (t)g(t) == F (f ) G(f ) frequency convolution
F
frequency convolution f (t) g(t) == F (f )G(f ) frequency multiplication
F
delta function (t) == 1
F
shifted delta function (t t0 ) == ej2f t0
F
1 == (f ) delta function
F
ej2f0 t == (f f0 ) shifted delta function
F 2a
two-sided exponential decay ea|t| a>0 == a2 +4 2 f 2
2 F 2
et == ef
2 F 1 2
ejt == ej( 4 f )
F j
ej (f + f0 ) ej (f f0 )
 
sine sin (2f0 t + ) == 2
F 1
ej (f + f0 ) + ej (f f0 )
 
cosine cos (2f0 t + ) == 2
F j
sine modulation f (t) sin (2f0 t) == 2
[F (f + f0 ) F (f f0 )]
F 1
cosine modulation f (t) cos (2f0 t) == 2
[F (f + f0 ) + F (f f0 )]
F 1
sin2 (t) 2(f ) f 1 f + 1



squared sine == 4
F 1
cos2 (t) 2(f ) + f 1 + f + 1



squared cosine == 4

t

1 |t| 6 T F
rectangular rect T
= 0 |t| > T
2 == T sinc T f
2

1 |t| |t| 6 T

t F
triangular triang T
= T == T sinc2 T f
0 |t| > T

1 t > 0 F 1
step u(t) = 1[0,+] (t) = == j2f
+ (f )
0 t<0

1 t>0 F 1
signum sgn (t) = == jf
1 t<0
 
F 1 f 1
sinc sinc (Bt) == B
rect B
= 1
B [ B ,+ B ]
(f )
  2 2
F 1 f
squared sinc sinc2 (Bt) == B
triang B

dn F
n-th time derivative dtn
f (t) == (j2f )n F (f )
F 1 dn
n-th frequency derivative tn f (t) == (j2)n df n
F (f )
1 F 2|f |
1+t2
== e
Marc Ph. Stoecklin TABLES OF TRANSFORM PAIRS v1.5.3 3

Table of Continuous-time Pulsation Fourier Transform Pairs

R + F R +
x(t) = F1 {X()} = x(t)ejt d
== X() = F {x(t)} = x(t)ejt dt

F
transform x(t) == X()
F
time reversal x(t) == X() frequency reversal
F
complex conjugation x (t) == X () reversed conjugation
F
reversed conjugation x (t) == X () complex conjugation
F
x(t) is purely real == X(f ) = X () even/symmetry
F
x(t) is purely imaginary == X(f ) = X () odd/antisymmetry
F
even/symmetry x(t) = x (t) == X() is purely real
F
odd/antisymmetry x(t) = x (t) == X() is purely imaginary
F
time shifting x(t t0 ) == X()ejt0
F
x(t)ej0 t == X( 0 ) frequency shifting
F 1

X


time scaling x (af ) == |a| a
F
 
1
|a|
x fa
== X(a) frequency scaling
F
linearity ax1 (t) + bx2 (t) == aX1 () + bX2 ()
F 1
time multiplication x1 (t)x2 (t) == X ()
2 1
X2 () frequency convolution
F
frequency convolution x1 (t) x2 (t) == X1 ()X2 () frequency multiplication
F
delta function (t) == 1
F
shifted delta function (t t0 ) == ejt0
F
1 == 2() delta function
F
ej0 t == 2( 0 ) shifted delta function
F 2a
two-sided exponential decay ea|t| a>0 == a2 + 2
F 1
exponential decay eat u(t) <{a} > 0 == a+j
F 1
reversed exponential decay eat u(t) <{a} > 0 == aj
t2 F 2 2
e 22
== 2e 2
F
j ej ( + 0 ) ej ( 0 )
 
sine sin (0 t + ) ==
F
ej ( + 0 ) + ej ( 0 )
 
cosine cos (0 t + ) ==
F j
sine modulation x(t) sin (0 t) == 2
[X ( + 0 ) X ( 0 )]
F 1
cosine modulation x(t) cos (0 t) == 2
[X ( + 0 ) + X ( 0 )]
F
squared sine sin2 (0 t) == 2 [2(f ) ( 0 ) ( + 0 )]
F
squared cosine cos2 (0 t) == 2 [2() + ( 0 ) + ( + 0 )]

t

1 |t| 6 T F

T

rectangular rect T
= 0 |t| > T
2 == T sinc 2
2

1 |t| |t| 6 T

F
 
t T
triangular triang T
= T == T sinc2 2
0 |t| > T

1 t > 0 F 1
step u(t) = 1[0,+] (t) = == (f ) + j
0 t<0

1 t>0 F 2
signum sgn (t) = == j
1 t<0
F 1

= T1


sinc sinc (T t) == T
rect 2T
1[T,+T ] (f )
F 1
sinc2 (T t)


squared sinc == T
triang 2T

dn F
n-th time derivative dtn
f (t) == (j)n X()
F dn
n-th frequency derivative tn f (t) == j n df n X()
1 F
time inverse t
== jsgn()
Marc Ph. Stoecklin TABLES OF TRANSFORM PAIRS v1.5.3 4

Table of z-Transform Pairs

1 Z P+
x[n] = Z 1 {X(z)} = X(z)z n1 dz x[n]z n
H
2j
== X(z) = Z {x[n]} = n= ROC

Z
transform x[n] == X(z) Rx
Z
time reversal x[n] == X( z1 ) 1
Rx
Z
complex conjugation x [n] == X (z ) Rx
Z
reversed conjugation x [n] == X ( z1 ) 1
Rx

Z 1
real part <e{x[n]} == 2
[X(z) + X (z )] Rx
Z 1
imaginary part =m{x[n]} == 2j
[X(z) X (z )] Rx
Z
time shifting x[n n0 ] == z n0 X(z) Rx
Z z
an x[n]


scaling in Z == X a
|a|Rx
Z
 1
 j2
N 1
1
X WNk z N WN = e
P
downsampling by N x[N n], N N0 == N k=0
N Rx
Z
linearity ax1 [n] + bx2 [n] == aX1 (z) + bX2 (z) Rx Ry
Z 1
H z

1
time multiplication x1 [n]x2 [n] == 2j
X1 (u)X2 u u du Rx Ry
Z
frequency convolution x1 [n] x2 [n] == X1 (z)X2 (t) Rx Ry
Z
delta function [n] == 1 z
Z
shifted delta function [n n0 ] == z n0 z
Z z
step u[n] == z1
|z| > 1
Z z
u[n 1] == z1
|z| < 1
Z z
ramp nu[n] == (z1)2
|z| > 1
Z z(z+1)
n2 u[n] == (z1)3
|z| > 1
Z z(z+1)
n2 u[n 1] == (z1)3
|z| < 1
Z z(z 2 +4z+1)
n3 u[n] == (z1)4
|z| > 1
Z z(z 2 +4z+1)
n3 u[n 1] == (z1)4
|z| < 1
Z z
(1)n == z+1
|z| < 1
Z z
exponential an u[n] == za
|z| > |a|
Z z
an u[n 1] == za
|z| < |a|
Z 1
an1 u[n 1] == za
|z| > |a|
Z az
nan u[n] == (za)2
|z| > |a|
Z az(z+a
n2 an u[n] == (za)3
|z| > |a|
Z z
ean u[n] == zea
|z| > |ea |
(
an n = 0, . . . , N 1 Z 1aN z N
exp. interval == 1az 1
|z| > 0
0 otherwise
Z z sin(0 )
sine sin (0 n) u[n] == z 2 2 cos(0 )z+1
|z| > 1
Z z(zcos(0 ))
cosine cos (0 n) u[n] == z 2 2 cos(0 )z+1
|z| > 1
Z za sin(0 )
an sin (0 n) u[n] == z 2 2a cos(0 )z+a2
|z| > a
Z z(za cos(0 ))
an cos (0 n) u[n] == z 2 2a cos(0 )z+a2
|z| > a
Z dX(z)
differentiation in Z nx[n] == z dz Rx
x[n] Z R X(z)
integration in Z Qm n
== 0z z dz Rx
i=1 (ni+1) Z z
am m!
am u[n] == (za)m+1

Note:
z 1
=
z1 1 z 1
Marc Ph. Stoecklin TABLES OF TRANSFORM PAIRS v1.5.3 5

Table of Common Discrete Time Fourier Transform (DTFT) Pairs

1
R + DT F T P+
x[n] = 2 X(ej )ejn d == X(ej ) = n= x[n]ejn

DT F T
transform x[n] == X(ej )
DT F T
time reversal x[n] == X(ej )
DT F T
complex conjugation x [n] == X (ej )
DT F T
reversed conjugation x [n] == X (ej )
DT F T
x[n] is purely real == X(ej ) = X (ej ) even/symmetry
DT F T
x[n] is purely imaginary == X(ej ) = X (ej ) odd/antisymmetry
DT F T
even/symmetry x[n] = x [n] == X(ej ) is purely real
DT F T
odd/antisymmetry x[n] = x [n] == X(ej ) is purely imaginary
DT F T
time shifting x[n n0 ] == X(ej )ejn0
DT F T
x[n]ej0 n == X(ej(0 ) ) frequency shifting
DT F T PN 1 2k
downsampling by N 
x[N n] N N0 == 1
N k=0 X(ej N )
x n

n = kN DT F T
upsampling by N 0
N == X(ejN )
otherwise
DT F T
linearity ax1 [n] + bx2 [n] == aX1 (ej ) + bX2 (ej )
DT F T
time multiplication x1 [n]x2 [n] == X1 (ej ) X2 (ej ) = frequency convolution
1
R + j() )X (ej )d
2
X 1 (e 2
DT F T
frequency convolution x1 [n] x2 [n] == X1 (ej )X2 (ej ) frequency multiplication
DT F T
delta function [n] == 1
DT F T
shifted delta function [n n0 ] == ejn0
DT F T
1 == () delta function
DT F T
ej0 n == ( 0 ) shifted delta function
DT F T j j
sine sin (0 n + ) == 2
[e ( + 0 + 2k) e+j ( 0 + 2k)]
DT F T 1 j
cosine cos (0 n + ) == 2
[e ( + 0 + 2k) + e+j ( 0 + 2k)]

n

1 |n| 6 M DT F T sin[ (M + 1
2 )]
rectangular rect M
= == sin(/2)
0 otherwise
DT F T 1
step u[n] == 1ej
+ 12 ()
DT F T 1
decaying step an u[n] (|a| < 1) == 1aej
DT F T 1
special decaying step (n + 1)an u[n] (|a| < 1) ==
(1aej )2
sin(c n) c DT F T

  1
|| < c
sinc n
=
sinc (c n) == rect c
=
0 c < || <

1 0 6 n 6 M DT F T sin[(M +1)/2] jM/2
n 1


MA rect M
=2
== sin(/2)
e
0 otherwise
  1 0 6 n 6 M 1
n DT F T sin[M/2] j(M 1)/2
MA rect M 1
12 = == sin(/2)
e
0 otherwise
DT F T d
derivation nx[n] == j d X(ej )
DT F T
difference x[n] x[n 1] == (1 ej )X(ej )
an sin[0 (n+1)] DT F T 1
u[n] |a| < 1 ==
sin 0 12a cos(0 ej )+a2 ej2

Note:
+
X +
() = ( + 2k)
X

rect() = rect( + 2k)
k=
k=
Parseval:
+ Z +
X 1
|x[n]|2 = |X(ej )|2 d
n=
2
Marc Ph. Stoecklin TABLES OF TRANSFORM PAIRS v1.5.3 6

Table of Laplace Transform Pairs

1
R c+jT L R +
f (t) = L1 {F (s)} = 2j
limT cjT F (s)est ds == F (s) = L {f (t)} = f (t)est dt

L
transform f (t) == F (s)
L
complex conjugation f (t) == F (s )
L
time shifting f (t a) t>a>0 == aas F (s)
L
eat f (t) == F (s + a) frequency shifting
L 1
time scaling f (at) == |a|
F ( as )
L
linearity af1 (t) + bf2 (t) == aF1 (s) + bF2 (s)
L
time multiplication f1 (t)f2 (t) == F1 (s) F2 (s) frequency convolution
L
time convolution f1 (t) f2 (t) == F1 (s)F2 (s) frequency product
L
delta function (t) == 1
L
shifted delta function (t a) == eas exponential decay
L 1
unit step u(t) == s
L 1
ramp tu(t) == s2
L 2
parabola t2 u(t) == s3
L n!
n-th power tn == sn+1

L 1
exponential decay eat == s+a
L 2a
two-sided exponential decay ea|t| == a2 s2
L 1
teat == (s+a)2
L s
(1 at)eat == (s+a)2
L a
exponential approach 1 eat == s(s+a)

L
sine sin (t) == s2 + 2
L s
cosine cos (t) == s2 + 2
L
hyperbolic sine sinh (t) == s2 2
L s
hyperbolic cosine cosh (t) == s2 2
L
exponentially decaying sine eat sin (t) == (s+a)2 + 2
L s+a
exponentially decaying cosine eat cos (t) == (s+a)2 + 2

L
frequency differentiation tf (t) == F 0 (s)
L
frequency n-th differentiation tn f (t) == (1)n F (n) (s)

d L
time differentiation f 0 (t) = dt
f (t) == sF (s) f (0)
d2 L
time 2nd differentiation f 00 (t) = dt 2 f (t) == s2 F (s) sf (0) f 0 (0)
dn L
time n-th differentiation f (n) (t) = dt n f (t) == sn F (s) sn1 f (0) . . . f (n1) (0)
Rt L 1
time integration 0 f ( )d = (u f )(t) == F (s)
1 L Rs
frequency integration t
f (t) == s F (u)du

L F (s)f 1
time inverse f 1 (t) == s
L F (s) f 1 (0) f 2 (0) f n (0)
time differentiation f n (t) == s n + sn + sn1
+ ... + s