4(c) Given h ( n )=[ 6 ,5 , 4 , 3 ,2 , 1 ] as impulse response, and x ( n )=[ 1 ,1 , 1 ,1 ] as an input

sequence
To find
∞
y ( n )= ∑ x (k ) h ( n−k )=x ( n )∗h ( n ) .
k=−∞

n
For n=0, y ( 0 )=∑ x (k ) h (−k ) = x (0) h ( 0 ) = 1 ×6=6.
k=0

n
For n=1, y ( 1 )=∑ x (k)h ( 1−k ) = x ( 0 ) h (1 )+ x (1)h ( 0 )
k=0

¿ ( 1 ×6 )+ (1 ×5 )=11.
n
For n=2, y ( 2 )=∑ x (k)h ( 2−k ) = x ( 0 ) h (2 )+ x ( 1 ) h (1 )+ x (2)h ( 0 )
k=0

¿ ( 1 ×4 ) + ( 1 ×5 ) + ( 1 ×5 ) =15.
n
For n=3, y ( 3 )=∑ x(k )h ( 3−k ) = x ( 0 ) h (3 )+ x ( 1 ) h ( 2 )+ x ( 2 ) h ( 1 )+ x (3)h ( 0 )
k =0

¿ ( 1 ×3 ) + ( 1 × 4 ) + ( 1 ×5 ) + ( 1 ×6 )=18.
4
For n=4 , y ( 4 )=∑ x ( k) h ( 4−k ) = x ( 0 ) h ( 4 )+ x ( 1 ) h (3 )+ x ( 2 ) h ( 2 ) + x ( 3 ) h ( 1 ) + x (3)h ( 1 )
k=0

¿ ( 1 ×2 ) + ( 1 ×3 ) + ( 1 × 4 ) + ( 1 ×5 ) + ( 1 ×6 )=20.
5
For n=5, y ( 5 )=∑ x (k )h ( 5−k )=10 .
k=0

6
For n=6, y ( 6 )=∑ x (k ) h (6−k )=6.
k=0

7
For n=7, y ( 7 )=∑ x (k ) h ( 7−k )=3.
k=0

8
For n=8, y ( 8 )=∑ x (k ) h ( 8−k )=1.
k=0

9
For n=9, y ( 9 )=∑ x (k ) h ( 9−k )=0.
k=0

Note that y (−1 )=0.

Therefore, y ( n )=x ( n )∗h ( n )= { 0 ,0 , 6 , 11, 15 ,18 ,20 , 10 , 6 ,3 ,1 , 0 , 0 } .
5(a)(i) Finite Impulse Response (FIR) Linear Time Invariant (LTI) system is the system that has

{
1 for n=−1, 0
a finite duration impulse response. For example, h ( n ) = 2 for n=1
0 otherwise

5(a)(ii) Infinite Impulse Response (IIR) system is an LTI system that has an impulse response for
infinite duration. For example, h ( n )=an u ( n )
5(b) Characterizing a LTI system that has FIR is only feasible with convolution summation
equation. On the other hand, difference-equation can be employed as a general solution to
represent both IIR and FIR LTI system.

5(c) A linear difference-equation can be given as:

M L
y ( n )=∑ ak x ( n−k )−∑ b k y ( n−k ) ,
k=0 k=1

where y ( n ) is output response and x ( n ) represents the input sequence,

a k and b k are filler coefficient to be chosen so that the filter will have desired characteristics.

5(d) Recall that:

M L
y ( n )=∑ ak x ( n−k )−∑ b k y ( n−k ) ,
k=0 k=1

Take the Z transform of difference-equation to obtain

[∑ ]
∞ M L
Y ( z )= ∑ a k x ( n−k )−∑ bk y ( n−k ) z −n ,
n=−∞ k=0 k=1

m L
Y ( z )=∑ ak z X ( z )−∑ bk z−k Y ( z ) ,
−k

k=0 k=1

[ ]
L m
Y ( z ) 1+ ∑ bk z−k =∑ ak z−k X ( z ) ,
k=1 k=0

Y (z )
∑ ak z−k
k =0
H ( z )= =
X (z) L
1+ ∑ b k z
−k

k=1

m
5(d) H ( z ) can be classified for FIR digital filter when b k =0. Therefore, H ( z )=∑ a k z −k
k=0
 2
0.1(5 z −1) Y (z)
6(a) Given H ( z )= 2 =
z −1.625 z +0.934 X (z)
Therefore, 0.5 z 2 X ( z )−0.1 X ( z )=z 2 Y ( z ) −1.625Y ( z ) +0.934 Y ( z)
0.5 0.1 1 1.625
Hence, y ( n )= x ( n+2 )− x ( n )− y ( n+2 ) + y (n+1)
0.934 0.934 0.934 0.934
The Direct form one design for the digital filter with impulse response
2
0.1(5 z −1)
H ( z )= 2 is given in Figure 6 (a).
z −1.625 z +0.934

2
0.1(5 z −1)
Figure 6(a): digital filter with impulse response H ( z )= 2
z −1.625 z +0.934
.
z
6(b) Given X ( z )= −1
1−0.5 z
2
z z n
X ( z )= −1
= =z +0.5+0.25 (0.5) .
1−0.5 z z−0.5
n
x ( n )=δ ( n+1 ) +0.5 δ ( n )+ 0.25 ( 0.5 )

6(b) Given x ( n )=0.5 n u(n)

∞ ∞

∑ 0.5n u(n) z−n=∑ ( 0.5 z−1) .

n
X ( z )=
n=−∞ n=0

∞
1
Recall that ∑ x = , which converges at the |x|<1. Threfore,
n

0 1−x
 1
X ( z )= −1
,
1−0.5 z
which converges at |x|>0.5

7(a) A Discrete-Time Fourier Transform can be mathematically defined as

∞
X ( ω )= ∑ x (n)z− jωn
n=− ∞

and
¿¿

7(b) A Discrete-Time response x (n) can be recovered from its spectrum as follows:
π
1
x ( n )= ∫ X (ω)e jωn dω,
2 π −π
π
1
Where ∫ X (ω)e jωn dω is termed as the Inverse Discrete Fourier Transform (IDFT).
2 π −π

This can be further expressed in terms of physical frequency as

fs
2 f
1 j2π n
x ( n )= ∫ X (f )e
f
df s

f s −f s
2

7(c) A Discrete Fourier Transform (DFT) of a signal x ( n ) can be defined as an N-point DFT
N −1 −j ( 2Nπk )n,
X ( k )= ∑ x (n)e
n=0

where k =0 , 1 ,… , N −1,
N −1
X ( k )= ∑ x (n)W kn
N,
n=0

2π
−j n
where W kn=e N
N

7(d) An Inverse Discrete Fourier Transform (IDFT) can be obtained from its X ( k ) signal as:

1
N−1 j ( 2Nπk )n for n=0 , 1, … , N−1
x ( n )=
N
∑ X (k )e
k=0
 N−1
1
x ( n )=
N
∑ X (k )W −kn
k=0

Resent Class Works

8 Obtain the x ( n ) if
7 −1 1 −2
4− z + z
4 4
X ( z )= (5 marks)
3 1
1− z−1 + z−2
4 8
Solution
7 −1 1 −2 1 −1
4− z + z 2− z
4 4 4
Apply remainder theorem on X ( z )= =2+
3 1
1− z−1 + z−2
4 8
1
2
1
1− z−1 1− z−1
4 ( )( )
A1 A2
X ( z )=2+ +
Then, solve it by using partial fraction expansion
(1− 12 z ) (1− 14 z )
−1 −1

|
1 −1
2− z
A 1=
4
( 1 −1
× 1− z ) =3
( 1 −1
1− z
2 )(
1 −1
1− z
4 ) 2
z=
1
2

|
1 −1
2− z
and A2=
4
( 1 −1
× 1− z ) =−1
( 1 −1
1− z
2
1− z
4 )(
1 −1
) 4
z=
1
4

3 1
X ( z )=2+ −
() ()
n n
1 ( ) 1 ( )
Hence,
( 1 −1
1− z
2 ) (
1− z
4 )
1 −1 . Therefore, x ( n )=2 δ ( n )+ 3
2
u n−
4
un

9 Assess the time-invariant or time-variant nature of the following systems:

(i) y ( n )=x ( n ) + x ( n−1 ) . (2 marks)
(ii) y ( n )=x ( 2 n ) (2 marks)

9 (i) Given y ( n )=x ( n ) + x ( n−1 )

 We know that y ( n )=T [ x ( n ) ] =x ( n )+ x ( n−1 )

If input is delayed by k unit in the time, we have y ( n , k )=T [ x ( n−k ) ]

y ( n , k )=x ( n−k ) + x ( n−k −1 )

If we delay the output by k units in time, then

y ( n−k )=x ( n−k ) + x ( n−k −1 )

Hence, y ( n−k )= y ( n , k ) , so the system is TIME INVARIANT

9 (ii) Given y ( n )=x ( 2 n )

We know that y ( n )=T [ x ( n ) ] =x ( 2 n )

If input is delayed by k unit in the time, we have y ( n , k )=T [ x ( n−k ) ]

y ( n , k )=x ( 2 n−k )
Then, if we delay the output by k units in time, then
y ( n−k )=x ( 2 ( n−k ) ) + x ( 2 n−2 k )

Since y ( n , k ) ≠ x ( 2 n−k ), the system is TIME VARIANT

10. Ascertain the stability of the system defined by y ( n )=e x (n) .

Solution

For y ( n )=e x (n) , if x ( n ) is bounded, say |x ( n )|< M , then y ( n )=e|M|< ∞,

that is the system y ( n )=e x (n) produces bounded output for bounded input.
So it is BIBO stable.

11. Ascertain the causality of the system defined by

y ( n )=x ( n2 ) is causal (1 mark)

Solutions

y ( n )=x ( n2 )
For n=−1, y (−1 )=x ( 1 )
For n=0, y ( 0 )=x ( 0 )
 For n=1, y ( 1 )=x (1 )
For negative values of n, the system depends on future inputs. So the system is non-causal.