NATIONAL UNIVERSITY OF SCIENCE AND TECHNOLOGY

FACULTY OF APPLIED SCIENCES

APRIL 2009 EXAMINATIONS

SUBJECT: DIGITAL SIGNALS PROCESSING

INSTRUCTIONS TO CANDIDATES
1. Answer any five questions only.
2. Each question carries equal marks.
3. Show all your steps clearly in any calculation.
4. Start the answers for each question on a fresh page.
3 HOURS

QUESTION ONE

(a) Draw and describe a typical analogue to digital system and adigital to analogue system
.Explain the operation of each block in the system (12)

(b) State three properties of convolution. (3)

(c) Give the major difference between the finite impulse response filter and the infinite
impulse response filter. (2)

(d) Give three specific signals found in digital signal processing .Give the characteristic s of
each signal. (3 )

QUESTION TWO

The difference equation describing the input –output relationship of a discrete time linear
time invariant system is given by

y[n] − y[n − 1] + 0.5 y[n − 2] = x[n] + x[n − 1].

(a) Determine the transfer function H(z). (5)

(b) Determine the impulse response h[n] (7)

(c) Obtain the output response when a unit step function is applied at n=0. (8)
QUESTIN THREE

(a) Given that the the sequence x1[n]=[4.2, 40 , -10 ,0. ,5 ] and sequence x2[n ]= [6 , 36 ,0 ,3
.—2 ]. Generate thre other sequences. y1[n] =x1[n ].x2 [n ],y2(n]= x1[n] +x2[n] and
y3[n]=5/2x2[n] (6)

(b) Show a block diagram that will produce the sequence output y[n] from x[n].

y[n]=b0x[n] +b1x[n-1] +b2x[n-2] + b3x[n- 3] +a1y[n-1]+ a2y[n-2]. (8)

QUESTION FOUR

(a) Using an 8-point sequence explain the efficient computation of the Fast Fourier Transform
algorithm. What is its advantage.? (14)

(b) Draw a block diagram to represent the input and output of the discrete time linear system
1 1 1
described by the equation y[n] = y[n − 1] + x[n] + x[n − 1] where x[n] is the input and
4 2 2
y[n] is the output of the system. (6)

QUESTION FIVE

Find the convolution of two signals

x[n]={4,3,2,1}

h[n]={1,2,3,4}.

Determine y[n]=x[n]*h[n]. Show the steps numerically and graphically within

a window. (20)

QUESTION SIX

(a) Draw the block diagram that would represent a simplified hardware architecture for a
special purpose digital signal processor. Give an explanation of the diagram. (14 marks )

(b) State at least four characteristics that would be included in the specification of a digital
filter. (4)

(c) Give the major difference between the finite impulse response digital filter and the infinite
impulse response filter. (2)

2
QUESTION SEVEN

(a) Give at least six advantages of a digital filter when compared with an analogue filter.

(6)

(b) Show the realisation structure of the following Finite Impulse Response filters

(i) Transversal filter (3)

(ii) Frequency sampling filter (4)

(iii) Fast convolution filter (6)

(c) Explain the term pipelining when used in digital signal processing operations . (1)

QUESTION EIGHT

(a) A sinusoidal signal with a peak to peak amplitude of plus minus five volts is digitalised

with sixteen bits analogue to digital converter. Determine the quantization step size, the

quantization noise power and the maximum theoretical maximum signal to quantisation

noise ratio. (12)

(b) Give at least three benefits of oversampling in analogue to digital conversion. (3)

(c) Give at least five factors that influence the choice of sampling . (5)

(5) A high throughput noise reduction system requiring a sharp magnitude frequency response
filter.

(6) A real time biomedical signal processing with minimal distortion. (12)

(b) Calculate the discrete Fourier transform of the sequence [1,0,0,1] using the decimation in
time FFT algorithm. ( 8)

3
4
f (t ) TABLE OF LAPLACE TRANSFORM F(s)
f1 (t ) + f 2 (t ) Linearity F1 ( s ) + F2 ( s )
∞
f (t ) Definition ∫ 0
f (t )e − st dt
Kf (t ) Linearity KF(s)
df (t )
Differention sF(s) - f(0)
dt
d n f (t ) d n −1 f (0)
Differentiation s n F ( s ) − s n −1 f (0) − ..... − ..
dt n dt n −1
t 1
∫0
f (t )dt Integration
s
F(s)

dF ( s )
tf (t ) Complex differentiation −
ds
e − at f (t ) Complex translation F(s + a)
f(t - a)u(t - a) Real translation e -sa F ( s )
F1 ( s )
f (t ) Periodic function
1 − e − sT

∫0
x(τ )h(t − τ ) Convolution H(s)X(s)
δ (t ) 1
1
u(t)
s
1
e − at u (t )
s+a
β
sin βtu (t )
s +β22

s
cos βtu (t )
s +β2
2

β
e − at sin βtu (t )
(s + a) 2 + β 2
s+a
e − at cos βtu (t )
(s + a) 2 + β 2
1
tu(t)
s2
n!
t n u (t )
s n +1
1
te − at u (t )
(s + a) 2
n!
t n e − at u (t )
(s + a) n +1