2022-2023 Session Past Question Solution

Group 10 Members
Olabode Oluwashina Ayomide - 231450
Olabosipo Emmanuel Ayomide - 237900
Oladipupo Ridwan Tunde - 231451
Olaniyan David Oluwabusola - 231452
Olasunkanmi Abdlazeez Adedimeji - 231453

July 20, 2025

1
Question 1
(a) Explain the following terms:
(i) Signal: A signal is a function that conveys information about a physical phenomenon. It represents
a quantity that varies with one or more independent variables, such as time (e.g., a sound wave),
space (e.g., an image), or others. Signals can be continuous, having a value at every instant of
time, or discrete, having values only at specific, separate instants.
(ii) Memory-less System (Static System): A system is described as memory-less (or static) if its
output at any given time depends only on the input at that same instant. It does not depend on
past or future values of the input. For a discrete-time system, this means the output y(n) is solely
a function of the input x(n).
(iii) Non-Linear System: A system is non-linear if it does not satisfy the superposition principle.
The superposition principle states that for a linear system, the response to a weighted sum of
inputs is the weighted sum of the responses to each individual input. If a system violates this (e.g.,
y(t) = x2 (t)), it is non-linear.
(iv) Time-Invariant System: A system is time-invariant if its input-output characteristics do not
change over time. This means that if an input signal x(t) produces an output y(t), then a time-
shifted input x(t − t0 ) will produce an identically time-shifted output y(t − t0 ). The behavior of
the system is consistent, regardless of when the input is applied.

(b) Sketch the waveforms of the following Signals:

(i) x(t) = 4e−2t u(t + 10)P14 (t − 6)
The signal is the product of a decaying exponential 4e−2t , a unit step u(t + 10) (on for t ≥ −10), and a
rectangular pulse P14 (t − 6) (on for −1 < t < 13). The resulting signal is non-zero only on the interval
−1 < t < 13, where it takes the shape of the decaying exponential.

Sketch of x(t)
30
x(t)

20

10

t
−2 2 4 6 8 10 12 14

(ii) z(t) = 6u(−3 − t)Sinc(t)

This signal is the product of a unit step u(−3 − t) (on for t ≤ −3) and a scaled sinc function 6 sin(πt)
πt .
The signal is zero for t > −3 and follows the sinc waveform for t ≤ −3.

(iii) y(n) = −4u(n + 2) + 4u(n − 5) − 2δ(n + 8)

This is a discrete-time signal. The term −4u(n + 2) + 4u(n − 5) creates a rectangular pulse of amplitude
-4 from n = −2 to n = 4. The term −2δ(n + 8) adds an impulse of height -2 at n = −8.

2
 Sketch of z(t)
2
z(t)

t
−10 −8 −6 −4 −2 2

−1

−2

Sketch of y(n)

y(n)
n
−9−8−7−6−5−4−3−2−1 1 2 3 4 5 6

−2

−4

(iv) x(n) = 3δ(n − 2) − 4u(n) + 2u(n − 4)2 u(n − 8)

Simplifying the expression: u(n − 4)2 = u(n − 4), and u(n − 4)u(n − 8) = u(n − 8). So, x(n) =
3δ(n − 2) − 4u(n) + 2u(n − 8). The output is -4 from n = 0 to n = 7, except at n = 2 where it is
3 − 4 = −1. For n ≥ 8, the output is −4 + 2 = −2.

Sketch of x(n)

x(n)
n
−2 −1 1 2 3 4 5 6 7 8 9 10

−2

−4

3
(c) Determine the convolution of
(i) f (t) = P2 (t − 2) and h(t) = 3P1 (t)
f (t) is a rectangular pulse of width 2 centered at t = 2. It is 1 for 1 < t < 3. h(t) is a rectangular pulse of
width 1 centered at t = 0, with amplitude 3. It is 3 for −0.5 < t < 0.5. The convolution y(t) = f (t) ∗ h(t)
is the area of overlap between f (τ ) and h(t − τ ). The result is a trapezoidal shape. The width of the
result is Wf + Wh = 2 + 1 = 3. The center of the result is Cf + Ch = 2 + 0 = 2. The peak amplitude is
Af × Ah × min(Wf , Wh ) = 1 × 3 × 1 = 3. The convolution is non-zero from t = 0.5 to t = 3.5. It ramps
up from t = 0.5 to t = 1.5, is constant at 3 from t = 1.5 to t = 2.5, and ramps down from t = 2.5 to
t = 3.5.

(ii) f (n) = 2u(n + 1) − 2u(n − 2) − δ(n − 3) and h(n) = δ(n) + δ(n − 3)

First, define the sequence f (n): It’s a pulse of amplitude 2 from n = −1 to n = 1, minus an impulse at
n = 3. f (n) = { 2 , 2 , 2 , 0, 0, −1 }. The convolution is y(n) = f (n)∗h(n) = f (n)∗(δ(n)+δ(n−3)) =
n=−1 n=0 n=1 n=3
f (n) + f (n − 3).

f (n) = {. . . , 0, 2, 2, 0, −1, 0, . . . } (origin at n = 0)

↑

f (n − 3) = {. . . , 0, 0, 0, 0, 2, 2, 2, 0, −1, . . . }
↑

Adding them term by term: y(n) = { 2 , 2 , 2 , 2 , 1 , 2 , 0 , −1 }.

n=−1 n=0 n=1 n=2 n=3 n=4 n=5 n=6

4
Question 2
(a) Obtain from first principle the Discrete Fourier Series of the periodic
Discrete-time signal shown in Fig Q2(a).
The signal f (n) shown in Fig Q2(a) is periodic with fundamental period N = 8. One period of the
signal, from n = −4 to n = 3, can be described as: f (n) = { 1 , 0, −1 , 0, 4 , 1 , −4 , 0}
n=−4 n=−2 n=0 n=1 n=2
The Discrete Fourier Series (DFS) coefficients F [k] are given by the analysis formula:
N −1
1 X 2π
F [k] = f (n)e−j N kn
N n=0

We can choose the summation interval from n = −4 to n = 3.

3 3
1 X 2π 1 X π
F [k] = f (n)e−j 8 kn = f (n)e−j 4 kn
8 n=−4 8 n=−4

Expanding the sum for the non-zero values of f (n):

1h π π π π
i
F [k] = f (−4)e−j 4 k(−4) + f (−2)e−j 4 k(−2) + f (0)e0 + f (1)e−j 4 k(1) + f (2)e−j 4 k(2)
8
1 π π π 
F [k] = (1)ejπk + (−1)ej 2 k + (4)(1) + (1)e−j 4 k + (−4)e−j 2 k
8
Simplifying the terms:
1 π π π 
(−1)k − ej 2 k + 4 + e−j 4 k − 4e−j 2 k
F [k] =
8
This is the general expression for the DFS coefficients F [k] for k = 0, 1, . . . , 7.

(b) Obtain the Fourier Transform of the non-periodic Discrete-time signal

shown in Fig Q2(b).
The non-periodic discrete-time signal shown in Fig Q2(b) is given by:

f (n) = 5δ(n) + 3δ(n − 1) + 2δ(n − 2)

The Discrete-Time Fourier Transform (DTFT) is given by the formula:

∞
X
F (ejω ) = f (n)e−jωn
n=−∞

Substituting the given signal f (n) into the formula:

∞
X
F (ejω ) = [5δ(n) + 3δ(n − 1) + 2δ(n − 2)]e−jωn
n=−∞
P
Using the sifting property of the delta function, n g(n)δ(n − n0 ) = g(n0 ), we evaluate the sum at the
locations of the impulses:
F (ejω ) = 5e−jω(0) + 3e−jω(1) + 2e−jω(2)
F (ejω ) = 5 + 3e−jω + 2e−j2ω
This is the Fourier Transform of the given discrete-time signal.

5
Question 3
(a) Explain what you understand by the term ”Region of Convergence”.
The **Region of Convergence (ROC)** is a fundamental concept associated with the Z-Transform. It is
defined as the set of all values of the complex variable z for which the Z-Transform summation converges
to a finite value.
The Z-Transform of a discrete-time signal f (n) is given by:
∞
X
F (z) = f (n)z −n
n=−∞

The ROC consists of all the values of z for which this infinite sum is not infinite. The ROC is crucial
because the Z-Transform’s algebraic expression alone is not enough to uniquely identify the signal f (n).
Different signals can have the same mathematical expression for F (z) but will have different ROCs.
Therefore, a complete Z-Transform representation of a signal includes both the algebraic expression and
its corresponding ROC. The properties of the ROC (e.g., whether it is inside, outside, or an annulus
between circles in the z-plane) determine key characteristics of the signal, such as causality and stability.

(b) Determine the Z Transform of f (n) = 2n2 u(n). State the region of conver-
gence.
We can find this transform by applying the differentiation in z property of the Z-Transform, which states
d
that if Z{x(n)} = X(z), then Z{nx(n)} = −z dz X(z).

1. Start with the Z-Transform of the unit step function, u(n).

1 z
Z{u(n)} = −1
= , ROC: |z| > 1
1−z z−1

2. Find the Z-Transform of nu(n).

     
d z (z − 1)(1) − z(1) −1 z
Z{nu(n)} = −z = −z = −z =
dz z − 1 (z − 1)2 (z − 1)2 (z − 1)2

The ROC remains |z| > 1.

3. Now, find the Z-Transform of n2 u(n) = n · (nu(n)).

(z − 1)2 (1) − z(2(z − 1))

   
d z
Z{n2 u(n)} = −z = −z
dz (z − 1)2 (z − 1)4
   
z − 1 − 2z −z − 1 z(z + 1)
= −z 3
= −z 3
=
(z − 1) (z − 1) (z − 1)3
The ROC remains |z| > 1.

4. Finally, by the linearity property, the Z-Transform of f (n) = 2n2 u(n) is:

2z(z + 1)
F (z) = 2 · Z{n2 u(n)} =
(z − 1)3

The **Region of Convergence** is determined by the location of the poles and the nature of the signal.
Since f (n) is a right-sided sequence (due to u(n)), the ROC is the exterior of a circle passing through
the outermost pole. The pole is at z = 1, so the ROC is |z| > 1.

6
 8
(c) Given that G(z) = z 2 −7z+12
, obtain and sketch the Inverse Z Transform.
First, we find the poles of G(z) by factoring the denominator:

z 2 − 7z + 12 = (z − 3)(z − 4) = 0

The poles are at z = 3 and z = 4. Since the ROC is not specified, there are three possibilities. We
will assume the system is causal, which is the most common case. For a causal system, the ROC is the
region outside the outermost pole, so ROC: |z| > 4.
We perform partial fraction expansion on G(z):

8 A B
G(z) = = +
(z − 3)(z − 4) z−3 z−4
8
A = (z − 3)G(z)|z=3 = = −8
3−4
8
B = (z − 4)G(z)|z=4 = =8
4−3
So,
−8 8
G(z) = +
z−3 z−4
To find the inverse transform, we rewrite this in terms of z −1 to match standard transform pairs:

−8z −1 8z −1
G(z) = +
1 − 3z −1 1 − 4z −1
z −1
Using the transform pair Z{an−1 u(n − 1)} = 1−az −1 , we find the inverse Z-Transform:

g(n) = −8(3n−1 )u(n − 1) + 8(4n−1 )u(n − 1)

This can be written as g(n) = 8(4n−1 − 3n−1 )u(n − 1).

Sketch of the Inverse Z Transform g(n): Let’s calculate the first few values for n ≥ 1:
• g(1) = 8(40 − 30 ) = 8(1 − 1) = 0

• g(2) = 8(41 − 31 ) = 8(1) = 8

• g(3) = 8(42 − 32 ) = 8(16 − 9) = 56
• g(4) = 8(43 − 33 ) = 8(64 − 27) = 296

Sketch of the Inverse Z-Transform g(n)

300
g(n)

200

100

n
1 2 3 4

7
Question 4
Determine the Z Transform of
(i) f (n) = nu(n)
z
As derived in Question 3(b), using the differentiation property on Z{u(n)} = z−1 :

z z −1
F (z) = =
(z − 1)2 (1 − z −1 )2

ROC: Since this is a right-sided sequence with a pole at z = 1, the ROC is |z| > 1.

(ii) f (n) = e2n u(n)

This is of the form an u(n) with a = e2 . Using the standard transform pair:
1
F (z) =
1 − e2 z −1
ROC: For a right-sided sequence, the ROC is outside the pole at z = e2 . The ROC is |z| > e2 .

(iii) f (n) = cos(ωn)u(n)

ejθ +e−jθ
Using Euler’s identity, cos(θ) = 2 , we have:

1 jωn 1
f (n) = (e )u(n) + (e−jωn )u(n)
2 2
Taking the Z-Transform of each term:
 
1 1 1
F (z) = +
2 1 − ejω z −1 1 − e−jω z −1

Combining the fractions:

1 1 − e−jω z −1 + 1 − ejω z −1 1 − 12 (ejω + e−jω )z −1

 
F (z) = −1 −jω −1
=
jω
2 (1 − e z )(1 − e z ) 1 − (ejω + e−jω )z −1 + z −2

1 − cos(ω)z −1
F (z) =
1 − 2 cos(ω)z −1 + z −2
ROC: The poles are at z = e±jω , which have magnitude |z| = 1. Since it’s a right-sided sequence, the
ROC is |z| > 1.

(iv) f (n) = δ(n − 4)

Using the definition of the Z-Transform:
∞
X
F (z) = δ(n − 4)z −n
n=−∞

The sum is non-zero only at n = 4.

F (z) = z −4
ROC: The transform is finite for all values of z except at z = 0 where it becomes infinite. Therefore,
the ROC is the entire z-plane except for the origin, z = 0.

8
Question 5
(a) Explain very briefly what you understand by the following terms:
(i) Quantization: In image processing, quantization is the process of reducing the number of distinct
intensity or color values in an image. It maps a continuous or large range of values to a smaller,
finite set of discrete values (e.g., mapping continuous light intensity to 256 distinct gray levels). It
is a core step in digitizing an analog image.
(ii) Pixel: A pixel (short for ”picture element”) is the smallest individual element or point of a digital
image. Each pixel has a specific location (coordinates) and a value that represents its intensity or
color.
(iii) Colour Model: A color model is an abstract mathematical system for representing colors as a set
of numbers (or ”color components”). It provides a standardized way to describe colors. Common
examples include RGB (Red, Green, Blue) for displays, and CMYK (Cyan, Magenta, Yellow,
Key/Black) for printing.

(b) State the number of bits that is required to represent

(i) black and white image: A black and white image has only two possible values (black or white)
for each pixel. This can be represented by a single bit (0 for black, 1 for white, or vice versa). So,
1 bit per pixel.
(ii) gray level image: A typical grayscale image uses 256 distinct shades of gray. Since 28 = 256,
this requires 8 bits per pixel.
(iii) RGB full colour image: In the RGB model, each pixel’s color is a combination of red, green,
and blue intensities. If each of these three channels is represented by 8 bits (a standard ”true color”
system), the total is 3 × 8 = 24 bits. So, 24 bits per pixel.

(c) For Image A, compute

 
20 211 180
Image A =  15 75 124. Assume an 8-bit grayscale range of [0, 255].
189 255 109

(i) the contrast: Contrast is the difference between the maximum and minimum pixel intensities.

Imax = 255, Imin = 15

Contrast = Imax − Imin = 255 − 15 = 240

(ii) the brightness: Brightness is the average intensity of all pixels.

Sum of intensities = 20 + 211 + 180 + 15 + 75 + 124 + 189 + 255 + 109 = 1178

Number of pixels = 9
1178
Brightness = ≈ 130.89
9
(iii) the negative: The negative is found using the transformation s = (L − 1) − r, where L = 256 and
r is the input pixel value. So, s = 255 − r.
   
255 − 20 255 − 211 255 − 180 235 44 75
Negative(A) =  255 − 15 255 − 75 255 − 124 = 240 180 131
255 − 189 255 − 255 255 − 109 66 0 146

9
(d)
(i) What is Image Enhancement? Image enhancement is the process of manipulating a digital
image to make it more suitable for a specific application or more visually appealing to a human
observer. It is a subjective process that aims to improve features like contrast, brightness, or to
remove noise.
(ii) What is the goal of Image Enhancement? The primary goal is to improve the quality of an
image, making it easier for humans to interpret or for other automated systems to analyze. This
can involve highlighting certain features, reducing ambiguity, or suppressing irrelevant details.

(iii) Suggest a transformation (an arithmetic expression) that will make Image A brighter.
To brighten the image, we can add a constant value to each pixel intensity. Let s be the output
pixel value and r be the input.
s=r+C
where C is a positive constant, for example, s = r + 50. The result should be clipped to the range
[0, 255].
(iv) Suggest a transformation (an arithmetic expression) that will make Image A darker.
To darken the image, we can subtract a constant value from each pixel intensity.

s=r−C

where C is a positive constant, for example, s = r − 50. The result should be clipped to the range
[0, 255].

10