NDA-MEng-SYSTEMS-WEEK 4 - 2019

Week 4
DISCRETE-TIME SYSTEMS (II)

DISCRETE CONVOLUTION(I)
NDA - EEE DEPARTMENT S.M. SANI; PHD MSC(ENG), BSC(ENG), 1

CENG, MIEEE, MIEE, MNSE 04/06/2020
Week 4
DISCRETE-TIME SYSTEMS (II)

CENG, MIEEE, MIEE, MNSE 04/06/2020

• The stability factor, s , can be written as,
s = | < ∞
Thus, an LTI system is stable if its impulse response is

absolutely summable
NDA - EEE DEPARTMENT

S.M. SANI; PHD, MSC(ENG), BSC(ENG), CENG, MIEEE, MIEE, MNSE 04/06/2020 25
 The illustration below shows bounded and unbounded signals

 The illustration below shows stable and unstable systems

 Conditions for a BIBO Stable System
 If the system transfer function is a rational function, the degree of

the numerator should not be larger than the degree of the
denominator
 The poles of the system must lie inside the unit circle in the z-plane
 If a pole lies on the unit circle, it must be a single order pole; i.e., no
repeated pole lies on the unit circle

CLASSIFICATIONS OF DISCRETE SYSTEMS

 Finite Impulse Response(FIR) and Infinite Impulse
Response (IIR) Systems
 LTI discrete-time systems can be classified according to the type of

impulse response.
 If the impulse response sequence is of finite duration, the system is

called finite impulse response(FIR) system
 An example of FIR system is described by,
h[n] =
 An example of IIR system is described by,
h[n] = u[n]


 Invertible and Non-Invertible Systems
 A system is said to invertible if an inverse system exists which, when

cascaded with the original system produces an output equal to the
input of the first system
 For y[n] = 3x[n], the system is said to be invertible
 Mathematically, an invertible system is described as,
x[n] = { T (x[n]) }
 For y[n] = 2 [n], the system is said to be non-invertible
 Invertible and non-invertible systems are illustrated in the next slide

 Illustrating Invertible and Non-Invertible Systems


 If the impulse response of the original system is h[n], then the

impulse response of the inverse system is, [n] . This is illustrated
below
 From the above figure,
y[n] = x[n] h[n]
and, p[n] = y[n] [n]
= {x[n] h[n] } [n]


 From the figure as shown in previous slide,
y[n] = x[n] h[n]
and,
p[n] = y[n] [n]
= {x[n] h[n] } [n]
= x[n] { h[n] [n] }
= x[n] [n] = x[n] { h[n] [n] = [n] }


 Examples
 Accumulator or summer
y[n] =
For this system, the difference between two successive values of

the output is precisely the last input value.
 Encoding systems used in telecommunications


 Forward Difference and Backward Difference Systems
 Forward Difference System
y[n] = x[n +1] – x[n]
 Bacward Difference System
y[n] = x[n] – x[n+1]

 Representation of an Arbitrary Sequence
 Any arbitrary sequence can be represented in terms of

delayed and weighted impulse sequence, δ [n]
 Consider a finite, five(5) sample, sequence shown in the next

slide



 The sample x(0) can be obtained by multiplying the magnitude of x(0) with
unit impulse δ[n] as shown in(c ). That is,
x(0) δ[n] =
 Similarly, the sample x(-1) can be obtained by multiplying the magnitude of

x(-1) with the unit impulse advanced by one unit(i.e, δ[n+1] ) (d)
 X(-2), x(1), and x(2) can be obtained as shown in figures, (e), (f) and (g)
 x(-1) δ[n+1] =
 x(-2) δ[n+2] =
36
S.M. SANI; PHD, MSC(ENG), BSC(ENG), CENG, MIEEE, MIEE, MNSE 04/06/2020

 x(1) δ[n-1] =
 x(2) δ[n-2] =
 In this case,
x(0)δ[n] = δ[n] ; x(1) δ[n-1] = 3 δ[n-1] ; x(2) δ[n-2] = 2 δ[n-2]
x(-1) δ[n+1] = 3 δ[n+1]; x(-2) δ[n+2] = 2 δ[n+2]
x[n] = 2 δ[n+2] + 3 δ[n+1] + δ[n] + 3 δ[n-1] + 2 δ[n-2]
NDA - EEE DEPARTMENT 37


 In general, an infinite sequence x[n], can be written for -∞ n

∞ as,
 x[n] = ….+ x(-3)δ[n+3] + x(-2) δ[n+2] + x(-1)δ[n+1] + x(0) δ[n]
+ x(1)δ[n-1] + x(2) δ[n-2] + x(3) δ[n-3] + ……
Or,
x[n] = δ[n-k]
where ,
δ[n-k] is unity and zero for all other terms

NDA - EEE DEPARTMENT 38
WORKED EXAMPLES
 Example (1)
Represent the sequence ;
x[n] = { 3, 1, -2, 1, 4, 2, 5, 1 }
as sum of unit impulses
39
 Worked Examples
 Solution to Example (1)
40

 Worked Examples
 Example (2)
Test the following systems for linearity, time-invariance,

stability, and causality
y[n] =
41
 Worked Examples
42
 Worked Examples
43

 Worked Examples
 Example (3)
If a system is represented by the following difference

equation;
y[n] = 3 [n-1] – nx[n] + 4x[n-1] – x[n+1]; n 0
(i) Is the system linear ? Explain
(ii) Is the system shift-invariant? Explain
(iii) Is the system causal ? Why or why not?

44
 Worked Examples
45
 Worked Examples
 Example (4)
Test the causality and stability of the following system;
y[n] = x[n] - x[-n-1] + x[n-1]
46
 Worked Examples
47
Week 4
DISCRETE CONVOLUTION(I)

04/06/2020
8
CENG, MIEEE, MIEE, MNSE
DISCRETE CONVOLUTION(1)

 Impulse Response and Convolution Sum

 A discrete-time system performs an operation on an input signal
based on a predetermined criterion to produce a modified output
signal
 The input signal x[n] is the system excitation and the output signal
y[n] is the system response. This transform operation is illustrated
below
x[n] y[n] = T
 If the input to the system is a unit impulse, i.e. x[n] = δ[n] then, the
output of the system is known as impulse response denoted by h[n]
 Any arbitrary sequence x[n] can be represented as a weighted sum of

discrete impulses
x[n] =
NDA - EEE DEPARTMENT S.M. SANI; PHD MSC(ENG), BSC(ENG),
CENG, MIEEE, MIEE, MNSE 04/06/2020 29

Impulse Response and Convolution Sum

 The system response y[n] is given by
y[n] = T = T
 For a linear system the above equation reduces to
y[n] =
 The response due to the shifted impulse sequence can be denoted by

h[n.k] i.e.,
h[n,k] = }
 For a shift-invariant system,
Delayed output = Output due to delayed input
h[n-k] = h [n,k]
NDA - EEE DEPARTMENT S.M. SANI; PHD MSC(ENG), BSC(ENG),
CENG, MIEEE, MIEE, MNSE 04/06/2020 30

 The equation for y[n] reduces to,
y[n] =
 CONCLUSION
• For a linear time-invariant system, if the input sequence x[n]

and the impulse response h[n] are given, the output sequence
can be found using the equation:
y[n] = =
THIS IS KNOWN AS CONVOLUTION SUM and is represented as,
y[n] = x[n] h[n] = h[n] x[n]
Where, denotes the convolution operation
04/06/2020
S.M. SANI; PHD MSC(ENG), BSC(ENG), CENG, MIEEE, MIEE, MNSE 31

 Properties of Convolution

 Commutative Property: x[n] h[n] = h[n] x[n]
 Associative Property: = x[n]
 Distributed Property: x[n] = +
 Shifting Property:
If x[n] h[n] = y[n], then x[n-k] h[n-m] = y[n-k-m]
 Convolution with an Impulse: x[n] δ[n] = x[n]
04/06/2020
S.M. SANI; PHD MSC(ENG), BSC(ENG), CENG, MIEEE, MIEE, MNSE 32

NDA-MEng-SYSTEMS-WEEK 4 - 2019

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

NDA-MEng-SYSTEMS-WEEK 4 - 2019

Uploaded by

Copyright:

Available Formats

Week 4

DISCRETE-TIME SYSTEMS (II)

NDA - EEE DEPARTMENT S.M. SANI; PHD MSC(ENG), BSC(ENG), 1

DISCRETE-TIME SYSTEMS (II)

NDA - EEE DEPARTMENT S.M. SANI; PHD MSC(ENG), BSC(ENG), 2

• The stability factor, s , can be written as,

Thus, an LTI system is stable if its impulse response is

NDA - EEE DEPARTMENT

NDA - EEE DEPARTMENT

NDA - EEE DEPARTMENT

 If the system transfer function is a rational function, the degree of

NDA - EEE DEPARTMENT

 LTI discrete-time systems can be classified according to the type of

 If the impulse response sequence is of finite duration, the system is

 An example of FIR system is described by,

 An example of IIR system is described by,

NDA - EEE DEPARTMENT

 A system is said to invertible if an inverse system exists which, when

 For y[n] = 3x[n], the system is said to be invertible

 Mathematically, an invertible system is described as,

 For y[n] = 2 [n], the system is said to be non-invertible

 Invertible and non-invertible systems are illustrated in the next slide

NDA - EEE DEPARTMENT

 Illustrating Invertible and Non-Invertible Systems

NDA - EEE DEPARTMENT

 If the impulse response of the original system is h[n], then the

 From the above figure,

y[n] = x[n] h[n]

and, p[n] = y[n] [n]

= {x[n] h[n] } [n]

 From the figure as shown in previous slide,

y[n] = x[n] h[n]

p[n] = y[n] [n]

= {x[n] h[n] } [n]

= x[n] { h[n] [n] }

= x[n] [n] = x[n] { h[n] [n] = [n] }

NDA - EEE DEPARTMENT

For this system, the difference between two successive values of

 Encoding systems used in telecommunications

NDA - EEE DEPARTMENT

 Forward Difference System

y[n] = x[n +1] – x[n]

 Bacward Difference System

y[n] = x[n] – x[n+1]

NDA - EEE DEPARTMENT

 Representation of an Arbitrary Sequence

 Any arbitrary sequence can be represented in terms of

 Consider a finite, five(5) sample, sequence shown in the next

NDA - EEE DEPARTMENT

NDA - EEE DEPARTMENT

 Similarly, the sample x(-1) can be obtained by multiplying the magnitude of

x(0)δ[n] = δ[n] ; x(1) δ[n-1] = 3 δ[n-1] ; x(2) δ[n-2] = 2 δ[n-2]

x(-1) δ[n+1] = 3 δ[n+1]; x(-2) δ[n+2] = 2 δ[n+2]

x[n] = 2 δ[n+2] + 3 δ[n+1] + δ[n] + 3 δ[n-1] + 2 δ[n-2]

NDA - EEE DEPARTMENT 37

 In general, an infinite sequence x[n], can be written for -∞ n

 x[n] = ….+ x(-3)δ[n+3] + x(-2) δ[n+2] + x(-1)δ[n+1] + x(0) δ[n]

+ x(1)δ[n-1] + x(2) δ[n-2] + x(3) δ[n-3] + ……

δ[n-k] is unity and zero for all other terms

Represent the sequence ;

as sum of unit impulses

 Solution to Example (1)