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 (2⇡f ),
. 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 j2 = 1
Complex conjugate z = a + jb ! z⇤ = a jb

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

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 e jx ejx +e jx
Sine/Cosine sin (x) = 2j
cos (x) = 2

sin(x)
Sinc function sinc (x) ⌘ x
(unnormalized)
(
1 if |t| 6 T
Rectangular function rect( Tt ) = 2
T
0 if |t| > 2
8
|t|
t
>
<1 |t| 6 T
Triangular function triang T
= rect( Tt ) ⇤ rect( Tt ) = > T
:0 |t| > T
R +1
Convolution continuous-time: (f ⇤ g)(t) = 1
f (⌧ ) g ⇤ (t ⌧ )d⌧
P1
discrete-time: (u ⇤ v)[n] = m= 1 u[m] v ⇤ [n m]
R +1 R +1
Parseval theorem general statement: 1
f (t)g ⇤ (t)dt = 1
F (f )G⇤ (f )df
R +1 R +1
continuous-time: 1
|f (t)|2 dt = 1
|F (f )|2 df
P+1 R +⇡
discrete-time: n= 1 |x[n]|2 = 1
2⇡ ⇡
|X(ej! )|2 d!
P1 Pn 1 xn+1
Geometric series k=0 xk = 1
1 x k=0 xk = 1 x

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

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

Table of Continuous-time Frequency Fourier Transform Pairs

1
R +1 F R +1
f (t) = F {F (f )} = 1 f (t)ej2⇡f t df (==) F (f ) = F {f (t)} = 1 f (t)e j2⇡f 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 j2⇡f t0
time shifting f (t t0 ) (==) F (f )e
F
f (t)ej2⇡f0 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 j2⇡f t0
shifted delta function (t t0 ) (==) e
F
1 (==) (f ) delta function
F
ej2⇡f0 t (==) (f f0 ) shifted delta function

a|t| F 2a
two-sided exponential decay e a>0 (==) a2 +4⇡ 2 f 2
⇡t2 F 2
e (==) e ⇡f
2 F 1 f 2)
ej⇡t (==) ej⇡( 4
F j ⇥ j
⇤
sine sin (2⇡f0 t + ) (==) 2
e (f + f0 ) ej (f f0 )
F 1
⇥ j
⇤
cosine cos (2⇡f0 t + ) (==) 2
e (f + f0 ) + ej (f f0 )
F j
sine modulation f (t) sin (2⇡f0 t) (==) 2
[F (f + f0 ) F (f f0 )]
F 1
cosine modulation f (t) cos (2⇡f0 t) (==) 2
[F (f + f0 ) + F (f f0 )]
F 1
⇥ 1 1
⇤
squared sine sin2 (t) (==) 4
2 (f ) f ⇡
f+ ⇡
F 1
⇥ 1 1
⇤
squared cosine cos2 (t) (==) 4
2 (f ) + f ⇡
+ f+ ⇡
8
<1 |t| 6 T F
t 2
rectangular rect T
= :0 |t| > T
(==) T sinc T f
8 2
|t|
t
<1 |t| 6 T F
triangular triang T
=: T (==) T sinc2 T f
0 |t| > T
8
<1 t > 0 F 1
step u(t) = 1[0,+1] (t) = : (==) j2⇡f
+ (f )
0 t<0
8
<1 t>0 F 1
signum sgn (t) = : (==) j⇡f
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) (==) (j2⇡f )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 +1 F R +1
x(t) = F! 1 {X(!)} = 1 x(t)ej!t d! !
(==) X(!) = F! {x(t)} = 1 x(t)e j!t 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! j!t0
time shifting x(t t0 ) (==) X(!)e
F!
x(t)ej!0 t (==) X(! !0 ) frequency shifting
F! 1 !
time scaling x (af ) (==) |a|
X 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! j!t0
shifted delta function (t t0 ) (==) e
F!
1 (==) 2⇡ (!) delta function
F!
ej!0 t (==) 2⇡ (! !0 ) shifted delta function

a|t| F! 2a
two-sided exponential decay e a>0 (==) a2 +! 2
at u(t) F! 1
exponential decay e <{a} > 0 (==) a+j!
at u( F! 1
reversed exponential decay e t) <{a} > 0 (==) a j!
t2 F!
p 2 !2
e2 2 (==) 2⇡e 2

F!
⇥ ⇤
sine sin (!0 t + ) (==) j⇡ e j (! + !0 ) ej (! !0 )
F!
⇥ ⇤
cosine cos (!0 t + ) (==) ⇡ e j (! + !0 ) + ej (! !0 )
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 )]
8
<1 |t| 6 T F
⇣ ⌘
t 2 ! !T
rectangular rect T
= :0 |t| > T
(==) T sinc 2
8 2
|t| ⇣ ⌘
t
<1 |t| 6 T F! !T
triangular triang T
=: T (==) T sinc2 2
0 |t| > T
8
<1 t > 0 F! 1
step u(t) = 1[0,+1] (t) = : (==) ⇡ (f ) + j!
0 t<0
8
<1 t>0 F! 2
signum sgn (t) = : (==) j!
1 t<0
F 1 !
sinc sinc (T t) !
(==) T
rect 2⇡T
= T1 1[ ⇡T,+⇡T ] (f )
F! 1 !
squared sinc sinc2 (T t) (==) T
triang 2⇡T

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

Table of z-Transform Pairs

1 1
H Z P+1
x[n] = Z {X(z)} = 2⇡j
X(z)z n 1 dz (==) X(z) = Z {x[n]} = n= 1 x[n]z 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 n0 X(z)
time shifting x[n n0 ] (==) z Rx
Z z
scaling in Z an x[n] (==) X |a|Rx
a
PN ⇣ 1
⌘ j2!
Z 1 1
downsampling by N x[N n], N 2 N0 (==) N k=0 X WNk z N WN = e N Rx
Z
linearity ax1 [n] + bx2 [n] (==) aX1 (z) + bX2 (z) Rx \ Ry
Z 1
H z 1 du
time multiplication x1 [n]x2 [n] (==) 2⇡j
X1 (u)X2 u u Rx \ Ry
Z
frequency convolution x1 [n] ⇤ x2 [n] (==) X1 (z)X2 (t) R x \ Ry
Z
delta function [n] (==) 1 8z
Z n0
shifted delta function [n n0 ] (==) z 8z
Z z
step u[n] (==) z 1
|z| > 1
Z z
u[ n 1] (==) z 1
|z| < 1
Z z
ramp nu[n] (==) (z 1)2
|z| > 1
Z z(z+1)
n2 u[n] (==) (z 1)3
|z| > 1
Z z(z+1)
n2 u[ n 1] (==) (z 1)3
|z| < 1
Z z(z 2 +4z+1)
n3 u[n] (==) (z 1)4
|z| > 1
Z z(z 2 +4z+1)
n3 u[ n 1] (==) (z 1)4
|z| < 1
Z z
( 1)n (==) z+1
|z| < 1
Z z
exponential an u[n] (==) z a
|z| > |a|
Z z
an u[ n 1] (==) z a
|z| < |a|
Z 1
an 1 u[n 1] (==) z a
|z| > |a|
Z az
nan u[n] (==) (z a)2
|z| > |a|
Z az(z+a
n2 an u[n] (==) (z a)3
|z| > |a|
an u[n] Z z a|
e (==) z e a
|z| > |e
(
an n = 0, . . . , N 1 Z 1 aN z N
exp. interval (==) 1 az 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(z cos(!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(z a cos(!0 ))
an cos (!0 n) u[n] (==) z 2 2a cos(!0 )z+a2
|z| > a
Z dX(z)
di↵erentiation in Z nx[n] (==) z dz Rx
x[n] Z R z X(z)
integration in Z Qm n
(==) 0 z
dz Rx
i=1 (n i+1) Z z
am m!
am u[n] (==) (z a)m+1

Note:
z 1
= 1
z 1 1 z
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+1
x[n] = 2⇡ ⇡ X(ej! )ej!n d! (==) X(ej! ) = n= 1 x[n]e j!n

DT F T
transform x[n] (==) X(ej! )
DT F T
time reversal x[ n] (==) X(e j! )
DT F T
complex conjugation x⇤ [n] (==) X ⇤ (e j! )
⇤ DT F T
reversed conjugation x [ n] (==) X ⇤ (ej! )
DT F T
x[n] is purely real (==) X(ej! ) = X ⇤ (e j! ) even/symmetry
DT F T
x[n] is purely imaginary (==) X(ej! ) = X ⇤ (e j! ) 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! )e j!n0
DT F T
x[n]ej!0 n (==) X(ej(! !0 ) ) frequency shifting
DT F T PN 1 ! 2⇡k
downsampling by N 8 ⇥
x[N n] N 2 N0 (==) 1
k=0 X(ej N )
⇤ 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 ] (==) e j!n0
DT F T
1 (==) ˜(!) delta function
DT F T
ej!0 n (==) ˜(! !0 ) shifted delta function
DT F T j
sine sin (!0 n + ) (==) [e j ˜ (! + !0 + 2⇡k) e+j ˜ (! !0 + 2⇡k)]
2
DT F T
cosine cos (!0 n + ) (==) 1
[e j ˜ (! + !0 + 2⇡k) + e+j ˜ (! !0 + 2⇡k)]
2
8
n
<1 |n| 6 M DT F T sin[! (M + 1
2 )]
rectangular rect M
=: (==) sin(!/2)
0 otherwise
DT F T
step u[n] (==) 1
1 e j!
+ 12 ˜(!)
DT F T 1
decaying step an u[n] (|a| < 1) (==) 1 ae j!
DT F T 1
special decaying step (n + 1)an u[n] (|a| < 1) (==)
(1 ae j! )2 8
⇣ ⌘ <1 |!| < !c
sin(!c n) !c DT F T
˜ !
sinc ⇡n
= ⇡
sinc (!c n) (==) rect !c
=:
0 !c < |!| < ⇡
8
n 1
<1 06n6M DT F T sin[!(M +1)/2]
MA rect M 2
=: (==) sin(!/2)
e j!M/2
0 otherwise
8
⇣ ⌘ <1 06n6M 1
n 1 DT F T sin[!M/2]
MA rect M 1 2
=: (==) sin(!/2)
e j!(M 1)/2
0 otherwise
DT F T d
derivation nx[n] (==) j d! X(ej! )
DT F T j! )X(ej! )
di↵erence x[n] x[n 1] (==) (1 e
an sin[!0 (n+1)] DT F T 1
u[n] |a| < 1 (==)
sin !0 1 2a cos(!0 e j! )+a2 e j2!

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

Table of Laplace Transform Pairs

1 1
R c+jT L R +1
f (t) = L {F (s)} = 2⇡j
limT !1 c jT F (s)est ds (==) F (s) = L {f (t)} = 1 f (t)e st dt

L
transform f (t) (==) F (s)
L
complex conjugation f ⇤ (t) (==) F ⇤ (s⇤ )
L
time shifting f (t a) t>a>0 (==) a as F (s)

at f (t) L
e (==) 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 as
shifted delta function (t a) (==) e 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

at L 1
exponential decay e (==) s+a
a|t| L 2a
two-sided exponential decay e (==) a 2 s2
at L 1
te (==) (s+a)2
at L s
(1 at)e (==) (s+a)2
at L a
exponential approach 1 e (==) 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
at L !
exponentially decaying sine e sin (!t) (==) (s+a)2 +! 2
at L s+a
exponentially decaying cosine e cos (!t) (==) (s+a)2 +! 2

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

d L
time di↵erentiation f 0 (t) = dt
f (t) (==) sF (s) f (0)
d2 L
time 2nd di↵erentiation f 00 (t) = dt 2 f (t) (==) s2 F (s) sf (0) f 0 (0)
dn L
time n-th di↵erentiation f (n) (t) = dt n f (t) (==) sn F (s) sn 1 f (0) ... f (n 1) (0)

Rt L 1
time integration 0 f (⌧ )d⌧ = (u ⇤ f )(t) (==) F (s)
1 L Rs 1
frequency integration t
f (t) (==) s F (u)du

1 (t) L F (s) f 1
time inverse f (==) s
n (t) L F (s) f 1 (0) f 2 (0) f n
(0)
time di↵erentiation f (==) s n + sn + sn 1
+ ... + s