Discrete Time Systems
• A discrete-time system is any processing block that takes an input sequence
of samples and produces an output sequence of samples. The actual processing
can be performed sample by sample or as a sequence of transformations of data
blocks.
• A discrete system is a system with a countable number of states.
xa(t) = Analog Signal
x(nT) = Sampled Signal at
T= Sampling Interval = 1 (time between samples)
Fig 3.23 Constant Time Signal
Fig 3.24 Discrete Time Signal
• A discrete-time system is any processing block that takes an input sequence
of samples and produces an output sequence of samples. The actual processing
can be performed sample by sample or as a sequence of transformations of data
blocks.
• A discrete system is a system with a countable number of states.
1
• A device/system which performs some prescribed equations on discrete time
signals is DT systems.
Fig 3.26 Discrete Time System
y(n) = H [ x(n)] H=any operator
3.5 Representation of Discrete Time Systems
3.5.1 Graphical Representation
Fig 3.25 Graphical Representation
3.5.2 Functional Representation
2
3.5.3 Tabular Function
3.5.4 Sequential Representation
3
3.7 Classes of Discrete Time Systems
➢ Static / Dynamic Systems
➢ Time Invariant / Variant
➢ Linear / Non-Linear
➢ Causal / Non-Causal
➢ Stable / Unstable
3.7.1 Static / Dynamic DT System
• Static (memory less) means output y(n) only depends upon present
values (not past or future values).
Fig 3.27
y(n) = ax(n) + bx 3 (n) Only Present values
• If y (n) depends on present, past and future values then the system is
dynamic.
• Requires memory.
Example 3.1:
y (n) = x(n) + 3x(n − 1)
Fig 3.28
Dynamic System
4
3.7.2 Time Variant / Invariant
• The system is said to be time invariant if its input-output characteristics
do not change with time.
• The shape of signal at the output does not change with the delay in time.
If,
Then,
Time Invariant System
Example 3.2:
y (n) = nx(n)
Check whether the system is Time Variant or Invariant.
• Delay input and pass from the system
x(n − k ) = nx(n − k ) = y (n, k )
• Delay output by k
y ( n − k ) = ( n − k ) x( n − k ) Not equal, Time Variant
Example 3.3:
y (n) = x(n) − x(n − 1)
Check whether the system is Time Variant or Invariant.
Fig 3.10
• Delay input and pass from the system x(n-k)
y (n, k ) = x(n − k ) − x(n − k − 1)
• Delay output by k,
y (n − k ) = x(n − k ) − x(n − k − 1) Time Invariant
5
3.7.3 Linear / Non-Linear Systems
• A linear system is that which satisfies the properties of superposition
theorem.
6
• If a system produces a nonzero output with a zero input, the system is
said to be non-linear.
[a1 x1 (n) + a 2 x 2 (n)] = a1 [ x1 (n)] + a 2 [ x 2 (n)]
(Linear DT System)
Example 3.4:
y (n) = nx(n) Check for Linearity.
x(n) input
y (n) output
Fig 3.8
Fig 3.9
7
8
3.7.4 Causal / Non-Causal DT Systems
• Causal systems are those systems which depend upon its present value and its
past value.
• The system depending upon the future value is called non-causal systems.
• Causal: Present + Past
• Non-Causal: Future
3.7.5 Stable / Unstable DT Systems
• Stable System: If the output of a system remains at rest unless excited
by an external source and will return to rest if excitation is removed.
• Unstable: If system output grows without limit (i.e) diverges from a
bounded input, the system is unstable.
• Every bound input produces a bounded output is called (BIBO)
Example 3.5:
y(n) = y 2 (n − 1) + x(n)
Find out its stability if, x(n) = c (n) ?
Since;
y(n) = y 2 (n − 1) + c (n) Since y(-1) = 0
For n=0;
Y(0) = Y2(-1) + c (0)
Y(0) = (0)2 + c(1)
Y(0) = c
For n=1;
Y(1) = Y2(1-1) + c (1)
Y(1) = Y2(0) + c*(0)
Y(1) = (c)2 + c*(0)
Y(1) = c2
For n=2;
Y(2) = Y2(2-1) + c* (2)
Y(2) = Y2(1) + c*(0)
Y(2) = (c2)2 + c*(0)
9
Y(2) = c4
𝒏
Y(n) = 𝐜 𝟐
If ‘n’ varies from 0 to infinity the output will be unbounded.
10
11
12
