You are on page 1of 6

FINAL EXAMINATION

SEMESTER /SESSION
COURSE

:
: DIGITAL SIGNAL PROCESSING

PROGRAMME
COURSE CODE

TABLE 1: Properties of the N-Sample DFT

Property

Signal

DFT

Shift

x[n no]

X DFT k e j 2 k no

Shift

x[n 0.5N]

Modulation

x ne

1k X DFT k
X DFT k ko

Modulation

1n xn

X DFT k 0.5N

Folding

x[ n]

X DFT k

Product

x[n]y[n]

1
X DFT k YDFT k
N

Convolution

x[n] y[n]

X DFT k YDFT k

Correlation

x[n] y[n]

*
k
X DFT k YDFT

Central Ordinates

x0

Central Ordinates

j 2 n ko / N

1 N 1
X DFT k ,
N k 0

N 1

X DFT 0 xn

n 0

N 1 N 1
x 1 X DFT k (N even),
2 N k 0
n

N N 1
X DFT 1 xn (N even)
2 n 0

: BEJ
: BEB 30503

FINAL EXAMINATION
SEMESTER /SESSION
COURSE

:
: DIGITAL SIGNAL PROCESSING

PROGRAMME
COURSE CODE

TABLE 2: Properties of z-transform.

Property

Signal

z-transform

Linearity

a1x1(n) + a2x2(n)

a1X1(z) + a2X2(z)

Time reversal

x( n)

X(z-1)

Time shifting

i) x(n k)
ii) x(n + k)

i) z-kX(z)
ii) zkX(z)

Convolution

x1(n) x2(n)

X1(z)X2(z)

Correlation

rx1x2 l

x nx n l

Rx1x2 z X 1 z X 2 z 1

Scaling

anx(n)

X(a-1z)

Differentiation

nx(n)

z 1

Time
differentiation

x(n) x(n 1)

X(z)(1 - z-1)

Time integration

X k
k 0

z
X z

z 1

Initial value
theorem

lim
xn
n0

lim
X z
z

Final value
theorem

lim
xn
n

lim z 1

X z
z 1 z

10

dX z
dX z
or z
1
dz
dz

: BEJ
: BEB 30503

FINAL EXAMINATION
SEMESTER /SESSION
COURSE

:
: DIGITAL SIGNAL PROCESSING

PROGRAMME
COURSE CODE

TABLE 3: Laplace Transform

Signal x(t)
(t)

Laplace Transform X(s)


1
1
s
1
s2
2
s3
n!
s n1
1
s
1
s 2
n!
s n1

u(t)
r(t) = tu(t)
t2u(t)
tnu(t)
e -tu(t)
te -tu(t)
tne -tu(t)

11

: BEJ
: BEB 30503

FINAL EXAMINATION
SEMESTER /SESSION
COURSE

:
: DIGITAL SIGNAL PROCESSING

PROGRAMME
COURSE CODE

: BEJ
: BEB 30503

TABLE 4: Digital to Digital Frequency Transformations

Form

Band
Edges

Mapping z

Lowpass to lowpass

z
1 z

Lowpass to highpass

z
1 z

Lowpass to bandpass [1, 2]

Parameters

sin 0.5 D C
sin 0.5 D C

z 2 A1 z A2
A2 z 2 A1 z 1

cos0.5 D C
cos0.5 D C

cos0.5 2 1
cos0.5 2 1

A1
Lowpass to bandstop [1, 2]

A1 z A2
A2 z 2 A1 z 1
2

2K
K 1
, A2
K 1
K 1

K = tan(0.5D)tan[0.5(2 - 1)]
cos0.5 2 1

cos0.5 2 1

A1

12

tan 0.5 D
tan 0.5 2 1

2
1 K
, A2
1 K
K 1

FINAL EXAMINATION
SEMESTER /SESSION
COURSE

:
: DIGITAL SIGNAL PROCESSING

PROGRAMME
COURSE CODE

: BEJ
: BEB 30503

TABLE 5: Direct Analog to Digital Transformations for Bilinear Design.

Mapping s

Form

Band Edges

Lowpass to
lowpass

z 1
C z 1

C = tan(0.5C)

Lowpass to
highpass

C z 1
z 1

C = tan(0.5C)

Lowpass to 1 < 0 < 2


bandpass

z 2 2z 1
C z 2 1

C = tan[0.5(2 - 1)], = cos0 or


cos0.5 2 1

cos0.5 2 1

Lowpass to 1 < 0 < 2


bandstop

C z 2 1
z 2 2z 1

Parameters

C = tan[0.5(2 - 1)], = cos0 or


cos0.5 2 1

cos0.5 2 1

TABLE 6: Windows for FIR filter design.

Window
Boxcar
Cosine
Riemann
Bartlett
Von Hann (Hanning)
Hamming

Expression wN [n],
0.5(N 1) n 0.5(N 1)
1
n
cos

N 1
2n
sinc L
, L > 0
N 1
2n
1
N 1
2n
0.5 0.5 cos

N 1
2n
0.54 0.46 cos

N 1

13

FINAL EXAMINATION
SEMESTER /SESSION
COURSE

:
: DIGITAL SIGNAL PROCESSING

PROGRAMME
COURSE CODE

Finite Summation Formula


nn 1
2
k 0
n
nn 12n 1
2

6
k 0
n

3
k 0

n 2 n 1
4

1 n1
1 , 1
k 0
n
1 n 1 n n n1
k
k

1 2
k 0
n

1 n 12 n 2n 2 2n 1 n1 n 2 n2
k

1 3
k 0
n

Infinite Summation Formula

k 0

1
1 ,

1 ,
k 1

k k

1 2 ,
k 1

2
2 k
k

1 3 ,
k 1

1 e

1 e ,

1
1

1
1

14

: BEJ
: BEB 30503

You might also like