Professional Documents
Culture Documents
Exam ELE 442 - 2019
Exam ELE 442 - 2019
QUESTION ONE
a. Give one example each of two-dimensional and three dimensional signal respectively (2Marks)
b. Briefly explain two advantages and one disadvantage of digital signal processing.
(3Marks)
c. Convolve x (n) and h(n) using the Matrix method
{
1
n , 0≤ n ≤ 6
x ( n )= 3
0 , elsew h ere
{
h ( n ) = 1 ,−2≤ n ≤ 2
0 ,elsew h ere
(9 Marks)
d. Apply the bilinear transformation method to find the digital equivalent of an analog filter given a
transfer function of:
1
H ( s )=
s
+1
Ωc
π
The cut-off frequency of the analog filter is Ωc =± and a sampling rate of 10 Hz is required. (11 Marks)
3
QUESTION TWO
a. In a tabular format, state five differences between finite impulse response (FIR) filters and infinite
impulse response filters (IIR). (5 Marks)
b. List the special DS processor hardware units. (3 Marks)
c. Find the finite impulse response (FIR) output for the sinusoidal input shown below:
RESTRICTED
RESTRICTED
c. With the aid of a diagram, briefly describe the architecture of a DS processor (3 Marks)
d. Given the transfer function shown below:
−1
1+ z
X ( z )= −1 −2
1−z +0.5 z
i. Plot the poles and zeros of X ( z ) in the complex z-plane (6 Marks)
ii. Determine the inverse transform of X ( z ) (10 Marks)
QUESTION FOUR
a. State the conditions for the Fourier transform of the analogue signal x (t) to exist. ( 3 Marks)
b. What is the reason for finding the Fourier transform of a signal, x (t)? (2 Marks)
c. State mathematically, the components of the Fourier transform of an analogue signal x (t). (2 Marks)
d. Explain how the Discrete Fourier Transform (DFT) relates to the Z-transform of a discrete-time
LTI system. (3
Marks)
Given the discrete-time signal x ( n )={ 1 , 2 ,3,4 }, derive the N-point Discrete Fourier Transform (DFT)
¿
e.
using the following:
i. The Discrete Fourier Transform’s (DFT’s) linear transformation property. (8 marks)
ii. Decimation in frequency FFT algorithm. (3.5 Marks)
iii. Use the Decimation-in-Time Inverse Fast Fourier Transform (IFFT) algorithm to
determine the Inverse Discrete Fourier Transform (IDFT) of the answer obtained in
question e above. (3.5 Marks)
QUESTION FIVE
a. Briefly explain the following concepts as relates to digital signal processing.
i. Sampling
ii. Quantization
iii Coding (3 Marks)
b. With the aid of diagrams, explain the concept of correlation of digital signals. (3 Marks)
c. Determine the steady state response of the system:
1
y ( n )= [ x ( n )−x ( n−2 ) ]
2
(π
)
If the input signal is x ( n )=5+3 cos n+60 ° + 4 sin( πn+ 45 °).
2
(8 Marks)
RESTRICTED
RESTRICTED
d. A digital system is represented by the difference equation:
y ( n )=0.5 y ( n−2 )+ x(n−1).
If the system has a forced input expressed by x ( n )=( 0.5 )n u ( n ) and the initial conditions is given as
x (−1 )=−1 , y (−2 )=1 , y (−1 )=0.
Calculate the total response y (n) of the system for the points 0 ≤ n ≤3 (11 Marks)
RESTRICTED
RESTRICTED
MARKING GUIDE
Question One
Question 1:
a) Two dimensional signal
i. Image 1 Mark
Three dimensional signals
i. Colour TV 1 Mark
b) Two Advantages of digital signal processing:
i. Flexibility: digital systems are programmable, modular and can be modified easily but a complete
redesign is needed to modify analog systems.
ii. Accuracy: It is very easy to determine the depth of accuracy needed when processing signals
digitally. Analog systems have very little tolerance and are very challenging to control in terms of
word length, floating points and similar factors.
iii. Storage: digital signals can be economically stored in magnetic and flash media without any
deterioration in the fidelity of the stored signal. Analog signals require very large storage spaces
due to their enormous bandwidth.
iv. Cost: digital systems in comparison with analog systems are generally cheaper to implement. This
may be because of the inherent ease in manufacturing digital systems and the added advantage of
being able to manipulate the algorithms that operate them.
v. Mathematical processing: It is very easy to manipulate digital signals. Complex mathematical
operations can be performed on digital signals with great precision. Analog signals do not lend
themselves easily to complex mathematical manipulations.
vi. Repeatability: It is easy to repeat digital operations with the same level of accuracy and obtain
exactly the same results. Analog systems degrade with time and may not be able to reproduce
exactly the same results for corresponding analog operations 2 Marks
Disadvantages of digital signal processing:
i. It is more complicated than ASP.
ii. It requires more components.
iii. Due to its increased number of components, it will cost more than using its ASP equivalence.
iv. Loss of some information in the natural signal due to the conversion from analog to digital and then
back to analog.
v. When the frequency of the natural signal becomes too high, it cannot be processed digitally
1Mark
c) For x (n):
1
Case 1: n ;0 ≤ n ≤6
3
1
When: n=0 ; x ( 0 )= × 0=0
3
1
n=1; x ( 1 )=
3
2
n=2; x ( 2 )=
3
n=3 ; x ( 3 )=1
4
n=4 ; x ( 4 )=
3
RESTRICTED
RESTRICTED
5
n=5 ; x ( 5 )=
3
n=6 ; x ( n )=2 1 Mark
Case 2: 0 , elsew h ere
{ ¿ 1 2
3 3
4 5
∴ x ( n ) = … 0,0 , 0 , , , 1 , , , 2,0 , … .
3 3 }
For h ( n ) :
Case 1: 1 ;−2 ≤ n ≤2
When n=−2 ; h ( n )=1
n=−1 ; h ( n )=1
n=0 ; h ( n )=1
n=1; h ( n )=1
n=2; h ( n )=1 1 Mark
Case2: 0 , elsew h ere
∴ h ( n )= { ….0,0,1,1 , 1 ,1,1,0,0 … . }
¿
y ( n )=x ( n )∗h(n)
i.
x (n)
¿
0 1 2 1 4 5 2
3 3 3 3
1 0 1 2 1 4 5 2
3 3 3 3
1 0 1 2 1 4 5 2
h(n) 3 3 3 3
1¿ 0 1 2 1 4 5 2
3 3 3 3
1 0 1 2 1 4 5 2
3 3 3 3
1 0 1 2 1 4 5 2
3 3 3 3
5 Marks
y (−2) y (−1) y (0) y (1) y (2) y (3) y ( 4) y (5) y (6) y (7) y (8)
y (n) 0 1 1 2 10 5 20 6 5 11 2
3 3 3 3
{ 1 10
3
20
3
11
∴ y ( n )= ..0 , , 1,2 , ,5 , , 6,5 , , 2 , … .
3 3 }
1 Mark
RESTRICTED
RESTRICTED
1 Mark
d) Prewarp the analog prototype critical frequency so as to coincide with the critical frequency of the
corresponding digital filter.
' w Ωc T
Ωc =tan =tan 1 Mark
2 2
π 1
Ωc =± ∧T = =0.1 sec 1 Mark
3 f
( )
π
× 0.1
' 3 1 Mark
∴ Ωc =tan =0.05241
2
Select the filter used and substitute the new cut-off frequency Ω'c
1 0.05241
H ( s )= =
s s+ 0.05241 2 Marks
+1
0.05241
Mark
¿−ω=0 1 Mark
Thus, y 1 ( n )=( 4 × 4 ) <0=16 1 Mark
Secondly,
RESTRICTED
RESTRICTED
Thirdly,
y 3 ( n )=x 3 ( n )| H ( e )|< H ( e ) ∧x 3 ( n )=3 cos
jω jω
( 78π )
7π
|H (e jω)| at ω= 8
will be:
7π
2+2 cosω=2+2 cos =0.152 1 Mark
8
7π
¿ H ( e ) at ω=
jω
will be:
8
−7 π
−ω= 1 Mark
8
Question Three
a) Any 3 areas in engineering where correlation can be applied.
i) Radar
ii) Sonar
iii) digital communication
iv) geology
RESTRICTED
RESTRICTED
v) seismology
vi) satellite communication 3 Marks
b) Mathematical expression for:
∞
i) X ( z )= ∑ x(n) Z−n – The Bilateral z-transform
n=∞
∞
+¿ ( z) = ∑ x (n) Z ¿
−n
❑
1
iii) x ( n )= ∮
2 πj c
n−1
X (z ) Z dz – The Inverse z-transform
W h ere :
∮ c →Integral over a closed contour within the ROC of X ( z )which encloses the origin.
x n → Discrete-time signal.
X ( z ) → Z-transform of the discrete-time signal x ( n )
Z →The complex variable.
x (n)→ The discrete time signal to be transformed. 3 Marks
c) To accelerate the execution speed of digital signal processing, DS processors are designed based on the
Harvard architecture, which originated from the Mark 1 relay-based computers built by IBM in 1944 at
Harvard University. This computer stored its instructions on punched tape and data using relay latches.
The DS processor has two separate memory spaces. One is dedicated to the program code, while the
other is employed for data. Hence, to accommodate two memory spaces, two corresponding address
buses and two data buses are used.
In this way, the program memory and data memory have their own connections to the program memory
bus and data memory bus, respectively. This means that the Harvard processor can fetch the program
instruction and data in parallel at the same time, the former via the program memory bus and the latter
via the data memory bus. 1 Mark
2 Marks
d.
i. Remove all negative powers by multiplying the numerator and denominator by the highest power of the
denominator ( z 2 ¿ :
2
z +z
X ( z )= 2 1 Mark
z −z+ 0.5
Divide both sides by z :
X ( z) z 2+ z 1
= 2 ×
z z −z +0.5 z
RESTRICTED
RESTRICTED
X ( z) z
= 2
z z −1.5 z+ 0.5
X (z ) z +1
= 2 1 Mark
z z −z +0.5
1 Mark
X (z) z +1 A B
ii) = 2 = +
z z −z +0.5 z−P1 z−P2
RESTRICTED
RESTRICTED
Recall,
z−1
( AK
1−Pk z
−1
+
A ¿k
1−P ¿
k
) =2| A k|r nk cos ( β nk + α k ) u ( n )
arg=−71. 57=α k
arg=tan −1 ( 00 .. 55 )=45=β k
j 45
Pk =0 .5+ j 0. 5=0 .7071 e 2 Marks
n
¿ 2. ( 1.58 )( 0.7071 ) cos ( 45 n−71.57 ) u ( n )
n
¿ 31 .6 ( 0 . 7071 ) cos ( 45 n−71. 57 ) u(n) 1 Mark
Question Four
a. These conditions are known as the Dirichlets conditions and its stated below
1 Mark
ii. The should have a finite number of maxima and minima within any finite interval 1
Mark
iii. can have a finite number of discontinuities within any interval. 1 Mark
b. The purpose for finding the Fourier Transform of a signal is to obtain the frequency spectrum of
the signal. The frequency spectrum of the signal consists of the Magnitude and phase of the signal. Hence the
c. The component of the spectrum of the Fourier transform of an analog signal can be represented
mathematically as:
Magnitude = or 1 Mark
Phase = 1 Mark
1 Mark
1 Mark
Comparing both equations, we can deduce that
1 Mar k
1 Mark
3 Marks
Where Twiddle matrix which the value can be derived from a unity complex Fourier
transform -plane and is given below:
2 Marks
Therefore 1 Mark
Hence 1 Mark
ii) Finding the fourier transform with the decimation in frequency method, we have
RESTRICTED
RESTRICTED
3.5 Marks
iii) Using the Decimation in Time to obtain the IFFT, we have
3.5 Marks
Question Five
a.
i. Sampling: This is the process of converting an analog signal into a discrete-time continuous
amplitude signal. It is a process that takes the highest frequency of the analog signal to
regenerate the digital signal by multiplying by a number minimum twice the highest
frequency, a phenomenon known as Shannon Sampling theorem. This process is done to
eliminate the problem of aliasing 1
mark
ii. Quantization: The process of converting a discrete-time continuous-amplitude signal into a
digital signal by expressing each sample value as a finite (instead of infinite) number of
digits is called quantization. 1 mark
iii. Coding: The coding process in an A/D converter gives a unique binary number to each
quantization level. If there are “L” levels, L different binary numbers are needed to
represent all quantized samples. Therefore if ‘b’ bits are used to represent each sample, then
b
2 different values can be coded. 1 mark
b. Correlation is a mathematical operation that closely resembles convolution in which 2 signals are
involved. The main objectives of performing correlation between 2 signals that are similar is to measure the
degree to which the signals are similar and thus to extract some information that depends on a large extent to
the application. Correlations of signals are often encountered in radar, sonar, digital communication, geology
and other areas of science and engineering.
RESTRICTED
RESTRICTED
1 mark
A specially designed antenna transmits burst of radio waves energy in a selected direction. If the
propagating waves strikes an object i.e. The airplane in the diagram, a small fraction of the energy is
reflected towards a receiver, near the transmitter. The transmitted pulse is a specific shape that is selected
by the user, which can be a triangular wave or a square wave. The received signal will consist of parts:
a). A shifted and scaled version of the of the transmitting pulse,
b). Random noise, resulting from interfering radio waves, thermal noise in electronics, etc.
From the figure, the correlation of the transmitted signal to the received signal in relation to the noise
generated can be represented by the equation given below:
y ( n )=αx ( n−D ) +ω (n)
Where α = Attenuation Factor
x(n) = Input signal
D = Round Trip Delay
ω = Additive Noise
y(n) = Output Signal 2 marks
1
c. given that y ( n )= [ x ( n )−x ( n−2 ) ], Taking the Z-Transform of both sides, we have
2
−2
Y ( Z )=0.5 X ( Z )−0.5 X ( Z ) z ½ mark
Y ( Z )= X ( Z ) { 0.5−0.5 z } ½ mark
−2
Y (Z ) −2
But the transfer function H ( Z )= =0.5−0.5 z ½ mark
X (Z )
But H ( e )=H ( Z ) ¿ z=e
jω
jω ½ mark
Therefore, the equation becomes
H ( e )=0.5−0.5 e
jω −2 jω
√
2 2
π π
|H e |= (0.5−0.5 cos(2 × 2 )) +(−0.5 sin(2 × 2 )) =√12 −02=1 ½ mark
( jω
)
π
−0.5 sin 2 ×
2
∠ H ( e jω )=tan−1 =0 ° ½ mark
π
0.5−0.5 cos 2 ×
2
For the third part when ω=π
|H ( e jω )|=√( 0.5−0.5 cos 2 π )2+ (−0.5 sin 2× π )2 =√0+ 0=0 ½ mark
−1 −0.5 sin 2 × π
∠ H ( e )=tan
jω
=0 ° ½ mark
0.5−0.5 cos 2 × π
Therefore
y ss ( n )=(5 ×0)+¿
( )
π
y ss ( n )=3 cos n+60 ° . 1 marks
2
d). The homogenous solution y h (n) is obtained by making x ( n )=0
Therefore, from the equation
y ( n ) +0.75 y ( n−1 ) +0.125 y ( n−2 )=x ( n )
y ( n ) +0.75 y ( n−1 ) +0.125 y ( n−2 )=0
n
Putting y ( n )= λ , we have ½ mark
n n−1 n−2
λ + 0.75 λ +0.125 λ =0
λ ( λ + 0.75 λ+0.125 ) =0 ½ mark
n−2 2
When n = 0
y ( 0 )=x (−1 )−0.75 y (−1 )−0.125 y (−2 )
y ( 0 )=−1−0.75−0.25=−2 … … … … … … … … … … .3 ½ mark
When n = 1
y ( 1 )=x ( 0 )−0.75 y ( 0 )−0.125 y (−1 )
y ( 1 )=1−0.75 (−2 ) −0.125 ( 1 )
y ( 1 )=1+1.5−0.125=2.375 … … … … … … … ..4 ½ mark
Substituting into equation 2, we have:
n n
y ( n )=C 1 (−0.5 ) +C2 (−0.25 ) +0.667 ¿
When n = 0
0 0
y ( 0 )=C 1 (−0.5 ) +C2 (−0.25 ) +0.667 ¿
y ( 0 )=C 1 +C2 +0.667 … … … … … … … … … … ….5 ½ mark
When n = 1
1 1
y ( 1 )=C 1 (−0.5 ) +C 2 (−0.25 ) +0.667 ¿
y ( 1 )=−0.5 C 1−0.5 C2 +0.333 … … … … … … … … ..6 ½ mark
Equating the equation 3 and 5, we have
C 1+C 2=−2.667 … … … … … … … … … … 7 ½ mark
Equating the equation 4 and 6, we have
0.5 C 1+0.25 C 2=−2.042 … … … … … … … … 8 ½ mark
Solving equation 7 and 8 simultaneously, we have
C 1=−5.495∧C 2=2.828 ½ mark
Therefore, Total response is:
n n
y ( n )=−5.495 (−0.5 ) + 2.828 (−0.25 ) + 0.667 ¿
Hence y ( 0 )=−2, y ( 1 )=2.375 , y ( 2 )=−1.0312∧ y ( 3 )=0.7266 1 marks
RESTRICTED