Introduction to Signal Processing

361-1-3321

Transform tables

Fourier series (FS)

x(t) =

ak e

1
ak =
T

jk0 t

k=

Z
x(t)ejk0 t dt
T

Property/signal

Time domain

Transform domain

Linearity

Ax(t) + By(t)

Aak + Bbk

Time shifting

x(t )

ejk0 ak

Time reversal

x(t)

ak

x(at), a > 0 (periodic

Time scaling

T
a)

ak

Conjugation

x (t)

ak

Symmetry

x(t) real

ak = ak

Differentiation

d
x(t)
Rdtt
x(t)dt,

jk0 ak

Integration

Convolution

x( ) y(t )d

Multiplication

x(t)y(t)

Cosine

2A cos(0 t + B)
R
1
2
T T |x(t)| dt

Parseval

ak
jk0

a0 = 0

T ak bk
P

m= am bkm
a1 = AejB , a1 =
P
2
k= |ak |

AejB

Fourier transform (FT)

1
x(t) =
2

X(j)e

jt

X(j) =

x(t)ejt dt

Property/signal

Time domain

Transform domain

Linearity

ax(t) + by(t)

aX(j) + bY (j)

Time shifting

x(t )

ej X(j)

Time scaling

x(at)

Conjugation

x (t)

1
|a| X(j/a)

X (j)

Symmetry

x(t) real

X(j) = X (j)

Differentiation

jX(j)

Convolution

d
x(t)
Rdtt
x( )d
R

x( )y(t )d

Integration

1
j X(j)

+ X(0)()

Multiplication

x(t)y(t)

X(j)Y (j)
R
1
2 X(ju)Y (j ju)du

Delta

(t)

One

2()

j0 t

Exponent

Cosine

cos(w0 t)

[( 0 ) + ( + 0 )]

Sine

sin(w0 t)

Unit step

u(t)

Decaying step

u(t)eat , a > 0

Rectangular pulse

t
)
( 2T

j [( 0 ) ( +
1
j + ()
1
a+j
2 sin(T )

( 2W
)
R

1
2
2 |X(j)| d

Sinc (normalized)
Parseval
25 March 2007

2( 0 )

sin(W t)

R t

|x(t)|2 dt

0 )]

Introduction to Signal Processing

361-1-3321

Transform tables

Discrete-time Fourier transform (DTFT)

1
x[n] =
2

Z
X(ej )ejn d

X(ej ) =

x[n]ejn

n=

Property/signal

Time domain

Transform domain

Linearity

ax[n] + by[n]

aX(ej ) + bY (ej )

Time shifting

x[n n0 ]

ejn0 X(ej )

Time reversal

x[n]

X(ej )

Conjugation

x [n]

X (ej )

Symmetry

x[n] real
P

X(ej ) = X (ej )

Multiplication

x[n]y[n]

X(ej )Y (ej )
R
1
j
j()
)d
2 2 X(e )Y (e

Delta

[n]

One

Convolution

m=

x[m]y[n m]

j0 n

Exponent

Cosine

cos[w0 n]

Sine

sin[w0 t]

Decaying step

u[n]an , |a| < 1

Rectangular pulse

N [n]

Sinc (normalized)

sin[W n]
Pn

n=

Parseval

P
m=

( 2m)

2 m= ( 0 2m)
P
m= [( 0 2m) + ( + 0 2m)]
P

m= [( 0 2m) ( + 0 2m)]
j

|x[n]|2

1
1aej
sin[(N + 12 )]
sin(/2)
P
2m
m= ( 2W )
R
1
j 2
2 2 |X(e )|

Discrete Fourier transform (DFT)

x[n] =

N 1
2
1 X
X(k)ej N nk
N

X(k) =

N
1
X

x[n]ej N nk

n=0

k=0

Property/signal

Time domain

Transform domain

Linearity

ax[n] + by[n]

Time shifting

x[n n0 ]modN

aX(k) + bY (k)
2
ej ( N n0 k) X(k)

Time reversal

x [n]modN

X (k)

Conjugation

x [n]

X (k)modN

Symmetry

x[n] real
PN 1
m=0 x[m]modN y[n m]modN

X(k) = X (k)modN

Convolution
Multiplication
Parseval

25 March 2007

x[n]y[n]
PN 1
2
n=0 |x[n]|

X(k)Y (k)
PN 1
1
l=0 X(l)modN Y (k l)modN
N
PN 1
1
2
k=0 |X(k)|
N

Introduction to Signal Processing

361-1-3321

Transform tables

Laplace transform
x(t) =

1
2j

+j

Z
X(s)est ds

X(s) =

x(t)est dt

Property/signal

Time domain

Transform domain

Linearity

ax(t) + by(t)

aX(s) + bY (s)

Time shifting

x(t )

es X(s)

time scaling

x(at)

Conjugation

x (t)

1
|a| X(s/a)

X (s )

Differentiation

sX(s)

Convolution

d
x(t)
Rdtt
x( )d
R

x( )y(t

Delta

(t)

Unit step

u(t)

1
s

Integration

Decaying step

at

1
s X(s)

)d

X(s)Y (s)

u(t)

at

Decaying step

u(t)

Causal Cosine

cos(w0 t)u(t)

Causal Sine

sin(w0 t)u(t)

(Re{s} > 0)

1
s+a (Re{s} > a)
1
s+a (Re{s} < a)
s
(Re{s} > 0)
s2 +02
0
(Re{s} > 0)
s2 +02

Z transform
1
x[n] =
2j

I
X(z)z n1 dz

X(z) =

x[n]z n

n=

Property/signal

Time domain

Transform domain

Linearity

ax[n] + by[n]

aX(z) + bY (z)

Time shifting

x[n n0 ]

z n0 X(z)

time reversal

x[n]

X(z 1 )

Conjugation

x [n]
P

X (z )

Convolution

m=

x[m]y[n m]

X(z)Y (z)

Delta

[n]

Unit step

u[n]

1
1z 1
1
1az 1
1
1az 1

Decaying step

a u[n]

Decaying step

25 March 2007

a u[n 1]

(|z| > 1)
(|z| > a)
(|z| < a)

Introduction to Signal Processing

361-1-3321

Transform tables

General
Description
Rectangular pulse in continuous-time

Rectangular pulse in discrete-time

Unit step in continuous-time

Unit step in discrete-time

Sinc in continuous-time
Sine-sine product
Cosine-cosine product
Cosine-sine product

25 March 2007

Equation

|x| < 12

1
1
(x) =
|x| = 12
2

0 elsewhere
(
1
|n| N
N [n] =
0 elsewhere

x>0

1
1
u(x) =
x=0
2

0 elsewhere
(
1
n0
u[n] =
0 elsewhere
sin(x)
x
sin(a) sin(b) = 12 cos(a b) 12 cos(a + b)
cos(a) cos(b) = 12 cos(a b) + 12 cos(a + b)
cos(a) sin(b) = 12 sin(a + b) 12 sin(a b)

sinc(x) =