LECTURE 5 – DISCRETE-TIME SYSTEMS

LECTURE 5 – PROPERTIES OF DISCRETE-TIME SYSTEM

System Causality:
A system property that is important for real-time applications is causality, which is defined as
follows:
A system is said to be causal if, for any no, the response of the system at time no depends only
on the input up to time n = no.

Example:

Example:
LECTURE 5 – PROPERTIES OF DISCRETE-TIME SYSTEM

System stability:
In many applications, it is important for a system to have a response, y(n), that is bounded in
amplitude whenever the input is bounded. A system with this property is said to be stable in the
bounded input-bounded output (BIBO) sense. Specifically,
A system is said to be stable in the bounded input-bounded output sense if, for any input that is
bounded,

the output will be bounded,

Example:

Example:
LECTURE 5 – PROPERTIES OF DISCRETE-TIME SYSTEM

Linear Systems:
A system that is both additive and homogeneous is said to be linear. Thus,
A system is said to be linear if

for any two inputs xl(n) and x2(n) and for any complex constants a1 and a2.
LECTURE 5 – PROPERTIES OF DISCRETE-TIME SYSTEM

Linear Systems:
If the input is x1(n), the output will be y1(n)
If the input is x2(n), the output will be y2(n),
If the input is [x1(n)+x2(n)], then the output will be y(n)= [y1(n)+ y2(n)] if the system is linear
Example:
LECTURE 5 – PROPERTIES OF DISCRETE-TIME SYSTEM

Time invariant system:

The system called Time-invariant if its input-output characteristic do not change
with time.
Shift the input x(n-n0)
Shift the Output y(n-n0)
If y(n-n0)= y(n) then the system is Time-invariant

Example:
 LECTURE 5 – PROPERTIES OF DISCRETE-TIME SYSTEM

If the system is linear and Time invariant system, the system is called
Linear Time Invariant system (LTI system)
LTI system can easily be characterized by its output response to the input
impulse signal

 n T{‧} h n

The input-output relationship can be given by Convolution

   
y  n  = T   x  k   n − k  =  x  k T   n − k  = x k  h n − k  = x n  h n
k =−  k =− k =−
LECTURE 5 – CONVOLUTION

Methods of Convolution
1- Graphical Method.
2- Slide Rule Method , ---- etc
Graphical Convolution

• There are four basic steps to the

calculation:

• The operation has a simple graphical

interpretation:
Calculating Successive Values

• We can calculate each output point by

shifting the impulse response one
sample at a time:


y[n] =  x[k ] h[n − k ]
k = −

• y[n] = 0 for n < ???

y[-1] =
y[0] =
y[1] =
…
y[n] = 0 for n > ???
• Can we generalize this result?
Graphical Convolution
Graphical Convolution (Cont.)
HW1 solution
REFERENCES

 Discrete-Time Signal Processing, 2e, by Oppenheim, Schafer, and Buck ©1999-2000 Prentice Hall, Inc.
 Veton Këpuska’s slides