NDA-MEng-SYSTEMS-WEEK 3 - 2019

Week 3
DISCRETE-TIME SYSTEMS
NDA - EEE DEPARTMENT S.M. SANI; PHD MSC(ENG), BSC(ENG), 1

CENG, MIEEE, MIEE, MNSE 04/06/2020
DISCRETE SYSTEM
 DEFINITIONS

 A system may be defined as:
• an entity that acts on an input signal and transforms it into an
output signal
• a set of elements or functional blocks which are connected

together and produces an output in response to an input signal
• software realizations of operations on a signal.
 Systems are classified into:

• Continuous – Time Systems: transforms continuous-time input
signals into continuous-time signals
• Discrete-Time Systems: transforms discrete-time input signals

into discrete-time signals
 Examples of Discrete-time Systems:

• Microprocessors,
• semiconductor memories,
• shift registers, etc
NDA - EEE DEPARTMENT
S.M. SANI; PHD, MSC(ENG), BSC(ENG), CENG, MIEEE, MIEE, MNSE 04/06/202 2
DISCRETE SYSTEM
 A discrete-time system is represented by a block diagram as illustrated

below
 Mathematically, a discrete-time system is described as an operator,

T[.}, that takes a sequence x(n) called excitation and transforms it
into another sequence y[n] called response. Thus,

y(n) = T{ x[n] }

CLASSIFICATIONS OF DISCRETE SYSTEMS
 Static(memoryless) and dynamic(memory) systems
 Causal and Non-causal systems
 Linear and non-linear systems
 Time-invariant and time-variant systems
 Stable and unstable systems
 Invertible and non-invertible systems
 FIR and IIR systems


 A system is said to be static or memoryless if its response is due to

present input only
 The systems defined below are static or memoryles:
• y[n] = x[n]
• y[n] = 2 [n]
• A purely resistive electrical circuit
• A discrete-time Linear time-invariant (LTI) system whose
impulse response, h[n] = 0 for n 0
 A system is said to be dynamic or memory system if its response

depends on:
• Past inputs
• Future inputs
• Past outputs


 The systems defined below are dynamic or memory systems:
• y[n] = x[2n]
• y[n] = x[n] + x[n-2]
• y[n] + 4y[n-1] + 4y[n-2] = x[n]
• An electric circuit having inductors and/or capacitors
• A discrete-time Linear time-invariant (LTI) system

whose impulse response, h[n] is not equal to zero for
n 0
 Any discrete-time system defined by difference equation is a

dynamic system

 Causal (Non-anticipative) and Non-causal(Anticipative) Systems
 A system is said to be causal(non-anticipative), if the output of the system at

any instant, n, depends only on present and past values of the
input but not on future inputs
 For a causal system, the impulse response or output does not begin before the
input function is applied. Hence, a causal system is non-anticipatory
 Causal systems are real systems because they are physically realisable
 The impulse response of a causal system is zero for n < 0, since δ[n] exists
only at n = 0
i.e., h[n] 0 for n < 0
 Examples of a causal system:

• y[n] = nx[n]
• y[n] = x[n-2] + x[n-1] + x[n]
• A delay element

 Causal (Non-anticipative) and Non-causal(Anticipative) Systems
 A system is said to be non-causal(anticipative) if the output of the

system at any instant, n, depends on the future inputs
 They are anticipatory systems
 Non-causal systems produce an output even before the input is

applied
 They do not exist in real time. Hence, they are not physically
realisable
 Examples of a causal system:

• y[n] = x[n] + x[2n]
• y[n] = [n] + 2x[n+2]
• Image processing system


 Linear and Non-linear Systems
 A system which obeys the principle of superposition and principle of

homogeneity is called a linear system
 A system which does not obey the principle of superposition and

principle of homogeneity is called a non-linear system
 Homogeneity property means a system which produces an output,

y[n] for an input, x[n], must produce an output, ay[n] for an input
ax[n]
 Superposition property means a system which produces an output,

[n] for an input, [n] and an output, [n] for an input [n] must
produce an output , [n] + [n] for an input [n] + [n]

 A system is linear if an arbitrary input, [n] produces an output [n] and an

arbitrary input [n] produces an output, [n], then, the weighted sum of inputs;
a[n] + b[n],
produces a weighted sum of output,
a[n] + b[n],
 In other words,
L{a x1[n] + b x2[n]} = a L[x1(n)] + b L[x2[n]],
where, a and b are constants
 A system is linear if the output due to weighted sum of inputs is equal to the
weighted sum of outputs
 Examples of linear systems:

• Filters
• Communications channels

 In general, if the describing equation contains;
• square or higher order terms of input and/or output,
• product of input/output and its difference or a constant,
 Then, the system will definitely be non-linear

 Time - invariant and Time-variant Systems
 Time-invariance is the property of a system which makes the behavior of the

system independent of time
 The behavior of the system does not depend on the time at which the input is
applied
 For discrete-time systems, the time-invariance property is called shift-

invariance
 A system is said to be shift-invariant if its input/output characteristics do not

change with time
 A time shift in the input results in corresponding time shift in the output. This
is illustrated in the next slide
 If T{ x[n] } = y[n]
then, T{ x[n-k] } = y[n-k]
 A system that does not satisfy the above requirements is called time-varying
system or shift-varying system

S.M. SANI; PHD, MSC(ENG), BSC(ENG), CENG, MIEEE, MIEE, MNSE
04/06/2020 12

04/06/2020 13
 Testing the Time-invariance Property of a Discrete-time System
• Let:
 x[n] be the input and x[n-k] be the input shifted(delayed) by k

units
 y[n] = T{x[n] } be the output for the input x[n]
 y[n,k] = T{ x[n-k] } = y[n] be the output for the

delayed input x[n-k]
 y[n-k] = y[n] be the output delayed by k units
• If y[n,k] y[n-k] (i.e., delayed output is NOT equal to the output

due to delayed input)
then, the system is time-invariant

04/06/2020 14
Time - invariant and Time-variant Systems

 Testing the Time-invariance Property of a Discrete-time System
• If the discrete-time system is described by the difference

equation, the time invariance can be found by observing the coefficients of
the difference equation
 If all the coefficients of the difference equation are constants, then the
system is time-invariant
 If even one of the coefficients is a function of time, then the system is

time-invariant
 The system described by; y[n] + 3y[n-1] + 5y[n-2] = 2x[n]

is a time-variant system because all the coefficients are constants
 The system described by; y[n] – 2ny[n-1] + 3 y[n-2] = x[n] + x[n-1]

is a time-varying system because all the coefficients are NOT constants
(two are functions of time)
 The systems which satisfy both linearity and time-invariance

conditions are called linear, time-invariant (LTI) systems

TYPES OF DISCRETE SYSTEMS
 Linear Time-Invariant (LTI) System
 A linear system in which an input-output pair, x(n) and y(n), is

invariant to a shift k in time is called a linear time-invariant
system i.e.,
y(n) = L[x(n)] L[x(n-k)] = y(n-k)
 For an LTI system, the L[.] and the shifting operators are
reversible as shown figure 2.3
x[n] L[.] y[n] Shift by k y[n-k]
x[n] Shift by k x[n-k] L[.] y[n-k]

TYPES OF DISCRETE SYSTEMS
 Linear Time Invariant (LTI) System (continued)
 An LTI system is denoted by the operator , LTI[.].
 Let x(n) and y(n) be the input-output pair of an LTI system.
 Then the time-varying function, h(n,k) becomes a time-invariant

function h(n-k),
 the output, y(n) = is called a linear convolution sum and is

denoted by,
y(n) x(n) * h(n)
 Hence, an LTI system is completely characterized in the time

domain by the impulse response h(n).
x(n) h(n) y(n) = x(n) * h(n)

Stable and Unstable Systems

 A bounded signal is a signal whose magnitude is always a finite value
i.e.;
|x[n]| M; where M is a positive finite number
 For example, a sinewave is a bounded signal.
 A system is said to be bounded-input, bounded-output (BIBO) stable, if

and only if every bounded input produce bounded output.
 The output of such a system does not diverge or does not grow
unreasonably large
 Let The input signal, x[n], be bounded (finite) i.e.,
| x[n] | < ∞ for all n
where, is a positive real number


 If,
| y[n] | < ∞ for all n (i.e., if output is also bounded),
Then,
the system is BIBO stable. Otherwise, the system is unstable
 A system is unstable even if one bounded input produces an unbounded

output
 Stability indicates usefulness of the system
 The stability can be found from the impulse response of the system (i.e.,
the output of the system for a unit impulse input)
 If the impulse response is absolutely summable for a discrete-time

system, then the system is stable


 BIBO Stability Criterion
 The necessary and sufficient condition for a discrete-time system to

be BIBO stable is given by the following expression,
< ∞
where, h[n] is the impulse response of the system
 Proof
• Consider a linear time-invariant system having impulse

response h[n]
• Let x[n] be the input sequence to the system

• According to the definition of convolution, the output of such a
system can expressed as,
y[n] = (1)
Equation (1) can also be written as,
y[n] = (2)
• A discrete-time sequence is said to be bounded if the absolute

value of every element is less than some finite number
• Thus, x[n] will be bounded if |x[n]| is less than some finite

number
• Let us denote this finite number as
• Then, for the input signal to be bounded the following condition

must be satisfied,
|x[n]| (3)
• Since is a finite number, then its value must be less than
infinity

Thus, Equation (3) can also be written as,
|x[n]| < ∞ (4)
• Taking absolute values of both sides of equation(2) yield,
| y[n] | = | | (5)
• The RHS of equation(5) can be read as the absolute value of

summation terms
• Rearranging, equation(5) can written as,
| (6)
• Equation (6) is the summation of absolute value of terms

04/06/2020 22

• Absolute value of some of terms is always equal to, or less than, the sum
of absolute values of terms. i.e.
|| | (7)
• From equation(5), the LHS of equation (7) is |y[n]|
• Hence,
|y[n]| | (8)
• x[n-k] is a delayed input signal. If input is bounded then, its delayed

version is also bounded. This delay or shifting operation on a signal
does not change its magnitude

04/06/2020 23

• For bounded input we have,
|x[n]|
therefore, | x[n-k] |
Putting this value into equation(8) yields,
|y[n]| |
Or,
|y[n]| | (9)
• We want output y[n] to be bounded. Then |y[n]| must be finite
24
S.M. SANI; PHD, MSC(ENG), BSC(ENG), CENG, MIEEE, MIEE, MNSE 04/06/2020

• From equation(9), in order to obtain finite output, then,
| < ∞ (10)
• In this case, h[k] = h[n] is the impulse response of LTI system.

Consequently, equation(10) gives the condition for stability in
terms of the impulse response of the system
• The stability factor, s , can be written as,
s = | < ∞
Thus, an LTI system is stable if its impulse response is

absolutely summable


NDA-MEng-SYSTEMS-WEEK 3 - 2019

Uploaded by

Document Information

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 3 - 2019

Uploaded by

Copyright:

Available Formats

Week 3

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

• a set of elements or functional blocks which are connected

• software realizations of operations on a signal.

 Systems are classified into:

• Discrete-Time Systems: transforms discrete-time input signals

 Examples of Discrete-time Systems:

 A discrete-time system is represented by a block diagram as illustrated

 Mathematically, a discrete-time system is described as an operator,

NDA - EEE DEPARTMENT

 Static(memoryless) and dynamic(memory) systems

 Causal and Non-causal systems

 Linear and non-linear systems

 Time-invariant and time-variant systems

 Stable and unstable systems

 Invertible and non-invertible systems

 FIR and IIR systems

NDA - EEE DEPARTMENT

 A system is said to be static or memoryless if its response is due to

 The systems defined below are static or memoryles:

 A system is said to be dynamic or memory system if its response

NDA - EEE DEPARTMENT

 The systems defined below are dynamic or memory systems:

• y[n] = x[n] + x[n-2]

• y[n] + 4y[n-1] + 4y[n-2] = x[n]

• An electric circuit having inductors and/or capacitors

• A discrete-time Linear time-invariant (LTI) system

 Any discrete-time system defined by difference equation is a

NDA - EEE DEPARTMENT

 Causal (Non-anticipative) and Non-causal(Anticipative) Systems

 A system is said to be causal(non-anticipative), if the output of the system at

i.e., h[n] 0 for n < 0

 Examples of a causal system:

• y[n] = x[n-2] + x[n-1] + x[n]

 A system is said to be non-causal(anticipative) if the output of the

 They are anticipatory systems

 Non-causal systems produce an output even before the input is

 Examples of a causal system:

• y[n] = [n] + 2x[n+2]

• Image processing system

NDA - EEE DEPARTMENT

 A system which obeys the principle of superposition and principle of

 A system which does not obey the principle of superposition and

 Homogeneity property means a system which produces an output,

 Superposition property means a system which produces an output,

NDA - EEE DEPARTMENT

 A system is linear if an arbitrary input, [n] produces an output [n] and an

produces a weighted sum of output,

L{a x1[n] + b x2[n]} = a L[x1(n)] + b L[x2[n]],

where, a and b are constants

 Examples of linear systems:

NDA - EEE DEPARTMENT

 Linear and Non-linear Systems

 In general, if the describing equation contains;

• square or higher order terms of input and/or output,

• product of input/output and its difference or a constant,

 Then, the system will definitely be non-linear

NDA - EEE DEPARTMENT

 Time-invariance is the property of a system which makes the behavior of the

 For discrete-time systems, the time-invariance property is called shift-

 A system is said to be shift-invariant if its input/output characteristics do not

then, T{ x[n-k] } = y[n-k]

NDA - EEE DEPARTMENT