Digital Signal Processing I/ 4th Class/ 2020-2021 Dr. Abbas Hussien & Dr. Ammar Ghalib

Digital Signal Processing I/ 4th Class/ 2020-2021 Dr. Abbas Hussien & Dr.
Ammar Ghalib
Example: Given the linear systems:

a. y(n) = 2x(n − 5)
b. y(n) = 2x(3n)
c. y(n) = n x(n)
Determine whether each of the following systems is time-invariant.
sol.
a. Let the input and output be x1(n) and y1(n), respectively; then the system output is y1(n) =
2x1(n − 5). Again, let x2(n) = x1(n − n0) be the shifted input and y2(n) be the output due to the
shifted input. We determine the system output using the shifted input as
y2(n) = 2x2(n −5) = 2x1(n − n0 − 5):
Meanwhile, shifting y1(n) = 2x1(n − 5) by n0 samples leads to
y1(n − n0) = 2x1(n − 5 − n0)
We can verify that y2(n) = y1(n − n0). Thus the shifted input of n0 samples causes the system
output to be shifted by the same n0 samples, thus, the system is time-invariant.
b. Let the input and output be x1(n) and y1(n), respectively; then the system output is y1(n)
=2x1(3n). Again, let the input and output be x2(n) and y2(n), where x2(n) = x1(n − n0), a
shifted version, and the corresponding output is y2(n). We get the output due to the shifted
input x2(n) = x1(n − n0) and note that x2(3n) = x1(3n − n0):
y2(n) = 2x2(3n) = 2x1(3n − n0):
On the other hand, if we shift y1(n) by n0 samples, which replaces n in
y1(n) = 2x1(3n) by n − n0, it yield
y1(n − n0) = 2x1(3(n − n0)) = 2x1(3n − 3n0):
Clearly, we know that y2(n) ≠ y1(n − n0). Since the system output y2(n) using the input
shifted by n0 samples is not equal to the system output y1(n) shifted by the same n0 samples,
thus, the system is not time-invariant (time-varying system).
23
Digital Signal Processing I/ 4th Class/ 2020-2021 Dr. Abbas Hussien & Dr. Ammar Ghalib
c. Let the input and output be x1(n) and y1(n), respectively; then the output is y1(n) =n x1(n).
Again, let the input and output be x2(n) and y2(n), where x2(n) = x1(n − n0), a shifted version,
and the corresponding output is y2(n). We get the output due to the shifted input x2(n) = x1(n
− n0) and note that x2(n) = n x1(n − n0):
y2(n) = n x2(n) = n x1(n − n0):
On the other hand, if we shift y1(n) by n0 samples, which replaces n in
y1(n) = n x1(n) by n − n0, it yield
y1(n − n0) = (n-n0) x1(n − n0):
Clearly, we know that y2(n) ≠ y1(n − n0). Since the system output y2(n) using the input
shifted by n0 samples is not equal to the system output y1(n) shifted by the same n0 samples,
thus, the system is not time-invariant (time-varying system).
Note: Linear Time Invariant System (LTI) is the system that satisfies both the linearity and the
time-invariance properties. Such systems are mathematically easy to analyze, and easy to
design.
Causal and Non-Causal Systems:

A causal system is one in which the output y(n) at time n depends only on the current
input x(n) at time n, its past input sample values such as x(n − 1), x(n− 2), . . . For example y[n]
= αx[n] + βx[n-1]. Otherwise, if a system output depends on the future input values, such as x(n
+ 1), x(n + 2), . . . , the system is noncausal. For example y[n] =αx[n]+ βx[n +1]. The noncausal
system cannot be realized in real time.
Example: Given the linear systems:

a. y(n) = 0.5x(n) + 2.5x(n − 2), for n ≥ 0
b. y(n) = 0.25x(n − 1) + 0.5x(n + 1) − 0.4y(n − 1), for n ≥ 0,
2
c. y (n)   h(k ) x(n  k )
k  2
Determine whether each is causal.
sol.
a. Since for n ≥ 0, the output y(n) depends on the current input x(n) and its past value x(n−2),
the system is causal.
b. Since for n ≥ 0, the output y(n) depends on the input’s future value x(n+1), the system is
noncausal.
c. Since for n ≥ 0, the output y(n) depends on the input’s future values x(n+1) and x(n+2),
the system is noncausal.
24
Stable and Unstable Systems:

A system is said to be bounded input-bounded output (BIBO) stable if and only if
every bounded input produces the bounded output. It means, that there exist some finite
numbers say Mx and My, such that
For all n, If for some bounded input sequence x(n), the output y(n)is unbounded (infinite), the
system is classified as unstable.
Note: The system is stable, if its transfer function vanishes after a sufficiently long time. For a
stable system:
Where h(k) = unit impulse response.
Example: Given the systems:

a. y[n] = (x[n])2
n
b. Accumulator system y[n]   x[k ] ,
k  
c. y[n]  e x[n]
Determine whether each is stable.
sol.
a. If |x[n]| ≤ Bx < ∞ for all n, then |y[n]| ≤ By= B x2 < ∞ for all n. Thus, the system is stable.
0 n  0
b. If x[n]  u[n]   : bounded
1 n  0
n n 0 n0
Then y[n]   x[k ]   u[k ]  n  1 n0
: not bounded
k   k   
Thus, the accumulator system is unstable.
c. If |x[n]| ≤ Bx < ∞ for all n, then |y[n]| ≤ By= e B x < ∞ for all n. i.e., it is guaranteed that if the
input is bounded by a positive number Bx, the output is bounded by a positive number e B x .
Thus, the system is stable.
n 0 n0
Note:  u[k ]  n  1 n0
k   
25
System Representation Using Its Impulse Response:

Any discrete-time can be characterized by one of the representations:
1) Difference Equation
2) Impulse Response h(n)
3) Transfer Function H(z)
4) Frequency Response H(W)
In this section, a Linear Time-Invariant (LTI) system will be represented by its impulse
response (h(n)).
A LTI system can be completely described by its unit-impulse response, which is
defined as the system response due to the impulse input δ(n) with zero initial conditions,
depicted in the following figure. Here x(n) = δ(n) and y(n) = h(n).
Note: The unit step function u[n] is the running sum of the unit impulse δ[n], so the step
response S[n] of a LTI processor is the running sum of its impulse response. Therefore, if we
denote the step response by S[n], we have
n
S[n]  y[n] x[ n]  u[ n]   h[m ]
m  
Alternatively, h[n] is the first order difference of S[n]
h[n]  y[n] x[n] [n]  S[n]  S[n  1]
Example: For a LTI system described by the following difference equation:

y(n) = 0.8y(n-1) + x(n)
a. Find and sketch the first four sample values of the impulse and step responses.
b. Determine the final value of the step response as n ∞.
sol.
a. By setting x(n)=δ(n) in the system difference equation, then y(n)=h(n) so,
h(n)=0.8h(n-1)+δ(n)
for n=0, h(0)=(0.8)h(-1)+δ(0)=1
for n=1, h(1)=(0.8)h(0)+ δ(1)=0.8
for n=2, h(2)=(0.8)h(1)+δ(2)=(0.8)2=0.64
for n=3, h(3)=(0.8)h(2)+δ(3)=(0.8)3=0.512
26

Digital Signal Processing I/ 4th Class/ 2020-2021 Dr. Abbas Hussien & Dr. Ammar Ghalib

Uploaded by

Copyright:

Available Formats

Digital Signal Processing I/ 4th Class/ 2020-2021 Dr. Abbas Hussien & Dr. Ammar Ghalib

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

Digital Signal Processing I/ 4th Class/ 2020-2021 Dr. Abbas Hussien & Dr. Ammar Ghalib

Uploaded by

Copyright:

Available Formats

Digital Signal Processing I/ 4th Class/ 2020-2021 Dr. Abbas Hussien & Dr.

Example: Given the linear systems:

Causal and Non-Causal Systems:

Example: Given the linear systems:

Stable and Unstable Systems:

Where h(k) = unit impulse response.

Example: Given the systems:

System Representation Using Its Impulse Response:

Alternatively, h[n] is the first order difference of S[n]

h[n]  y[n] x[n] [n]  S[n]  S[n  1]

Example: For a LTI system described by the following difference equation:

You might also like