Digital Signal Processing

Lecture 3 – Discrete-Time Systems

Alp Ertürk
[email protected]
Discrete-Time Systems
 Discrete-Time Systems
• Ideal Delay System:

𝑇
𝑥 𝑛 ՜ 𝑥 𝑛 − 𝑛0
 Discrete-Time Systems
• Moving Average System:

𝑀2
𝑇 1
𝑥𝑛 ՜ ෍ 𝑥[𝑛 − 𝑘]
𝑀1 + 𝑀2 + 1
𝑘=−𝑀1
 Discrete-Time Systems
• Accumulator System:

𝑛
𝑇
𝑥 𝑛 ՜ ෍ 𝑥[𝑘]
𝑘=−∞

𝑛 𝑛−1

𝑦 𝑛 = ෍ 𝑥[𝑘] = 𝑥 𝑛 + ෍ 𝑥[𝑘] = 𝑥 𝑛 + 𝑦[𝑛 − 1]

𝑘=−∞ 𝑘=−∞
 System Properties
1) Memory

• A system is memoryless if its output for each value of the

independent variable is dependent on the input at only that
instant (same independent variable value)

• A system with memory is dependent on the input at different

times
 System Properties
• Memoryless system examples:

𝑦 𝑛 = 2 2𝑥 𝑛 − 𝑥 2 [𝑛] 2

𝑦 𝑛 = 𝑎𝑛−1 𝑥[𝑛]

𝑦 𝑛 = 𝑥 𝑛 + 5𝑢[𝑛 − 1]
 System Properties
• Examples to systems with memory:

𝑦 𝑛 = 𝑥 𝑛 + 𝑥[𝑛 + 5]

𝑦 𝑛 = ෍ 𝑥[𝑘]
𝑘=−∞
 System Properties
2) Causality

• A system is causal if the output depends on the input signal’s

values only at that instant or at the earlier instants

• In other words, the output of a causal system does not depend

on the input’s future values

• All real-time systems are causal

 System Properties
• Causal system examples:

𝑦 𝑛 = 2 2𝑥 𝑛 − 𝑥 2 [𝑛] 2

𝑦 𝑛 = 𝑎𝑛−1 𝑥[𝑛]

𝑦 𝑛 = 𝑥 𝑛 + 5𝑢[𝑛 − 1]

𝑦 𝑛 = 𝑥 𝑛 + 𝑥[𝑛 − 5]
 System Properties
• An example for a system which is not causal:

𝑦 𝑛 = 𝑥 𝑛 + 𝑥[𝑛 + 5]
 System Properties
3) Invertibility

• A system is invertible if distinct inputs lead to distinct outputs

• If a system is invertible, then an inverse system exists that,

when cascaded with the original system, yields an output
equal to the input of the first system

x  n D y  n D-1 x  n
 System Properties
• Invertible system examples:

𝑦 𝑛 =𝑥 𝑛+5 ՜ 𝑥 𝑛 = 𝑦[𝑛 − 5]

𝑦 𝑛 = 𝑎𝑛−1 𝑥 𝑛 ՜ 𝑥 𝑛 = 𝑦 𝑛 Τ𝑎𝑛−1

𝑦 𝑛 = ෍ 𝑥[𝑘] ՜ 𝑥 𝑛 = 𝑦 𝑛 − 𝑦[𝑛 − 1]
𝑘=−∞
 System Properties
• Non-invertible system examples:

𝑦 𝑛 = 𝑥2 𝑛

𝑦 𝑛 = 5𝑢[𝑛 − 1]
 System Properties
4) Stability

• A system is stable if every bounded input sequence produces a

bounded output sequence.

• Bounded input: 𝑥[𝑛] ≤ 𝑆𝑥 < ∞

• Bounded output: 𝑦[𝑛] ≤ 𝑆𝑦 < ∞

 System Properties
• Stable system example:

𝑦 𝑛 =𝑥 𝑛+5

• Unstable system example:

𝑦 𝑛 = ෍ 𝑥[𝑘]
𝑘=−∞

Example: y[n] = σ𝑛𝑘=−∞ 𝑢[−𝑘] = σ0𝑘=−∞ 1 ՜ ∞

 System Properties
5) Linearity

• A system is linear if it possesses the superposition property

• If the input of a linear system consists of the weighted sum of

several signals, then the ouput is the weighted sum of the
responses of the system to each of those inputs

• In other words, a system is linear if

1. The response to 𝑥1 [𝑛] + 𝑥2 [𝑛] is 𝑦1 [𝑛] + 𝑦2 𝑛
2. The response to 𝑎𝑥1 [𝑛] is 𝑎𝑦1 [𝑛]
 System Properties

• Combining into a single statement, we have:

𝑥1 [𝑛] ՜ 𝑦1 [𝑛]

𝑥2 [𝑛] ՜ 𝑦2 [𝑛]

𝑎𝑥1 [𝑛] + 𝑏𝑥2 [𝑛] ՜ 𝑎𝑦1 [𝑛] + 𝑏𝑦2 [𝑛]

System Properties
y1 n a
x1  n system
b wn
x2 n system
y2  n
if w n  y  n 
system LINEAR!
a
x1  n
x  n
b system y  n
x2 n
 System Properties
• Linear System Example 1: 𝑦 𝑛 = 𝑥 𝑛 + 𝑥[𝑛 + 5]

𝑥1 𝑛 ՜ 𝑦1 𝑛 = 𝑥1 𝑛 + 𝑥1 [𝑛 + 5]

𝑥2 𝑛 ՜ 𝑦2 𝑛 = 𝑥2 𝑛 + 𝑥2 [𝑛 + 5]

𝑥3 𝑛 = 𝑎𝑥1 𝑛 + 𝑏𝑥2 𝑛 ՜ 𝑦3 𝑛

𝑦3 𝑛 = 𝑎𝑥1 𝑛 + 𝑏𝑥2 𝑛 + 𝑎𝑥1 𝑛 + 5 + 𝑏𝑥2 𝑛 + 5

= 𝑎 𝑥1 𝑛 + 𝑥1 𝑛 + 5 + 𝑏 𝑥2 𝑛 + 𝑥2 𝑛 + 5

= 𝑎𝑦1 𝑛 + 𝑏𝑦2 𝑛
 System Properties
• Linear System Example 2: 𝑦 𝑛 = 𝑎𝑛−1 𝑥 𝑛

𝑥1 𝑛 ՜ 𝑦1 𝑛 = 𝑎𝑛−1 𝑥1 𝑛

𝑥2 𝑛 ՜ 𝑦2 𝑛 = 𝑎𝑛−1 𝑥2 𝑛

𝑥3 𝑛 = 𝑐1 𝑥1 𝑛 + 𝑐2 𝑥2 𝑛 ՜ 𝑦3 𝑛

𝑦3 𝑛 = 𝑎𝑛−1 𝑥3 𝑛 = 𝑎𝑛−1 𝑐1 𝑥1 𝑛 + 𝑐2 𝑥2 𝑛

= 𝑐1 𝑎𝑛−1 𝑥 𝑛 + 𝑐2 𝑎𝑛−1 𝑥2 𝑛

= 𝑐1 𝑦1 𝑛 + 𝑐2 𝑦2 𝑛
 System Properties
• Nonlinear System Example 1: 𝑦 𝑛 = 𝑥 𝑛 + 𝑥 2 𝑛

𝑥1 𝑛 ՜ 𝑦1 𝑛 = 𝑥1 𝑛 + 𝑥12 𝑛

𝑥2 𝑛 ՜ 𝑦2 𝑛 = 𝑥2 𝑛 + 𝑥22 𝑛

𝑥3 𝑛 = 𝑎𝑥1 𝑛 ՜ 𝑦3 𝑛 = 𝑥3 𝑛 + 𝑥32 𝑛

= 𝑎𝑥1 𝑛 + 𝑎𝑥1 𝑛 2 = 𝑎𝑥1 𝑛 + 𝑎2 𝑥12 𝑛

𝑦3 𝑛 = 𝑎𝑥1 𝑛 + 𝑎2 𝑥12 𝑛 ≠ 𝑎 𝑥1 𝑛 + 𝑥12 𝑛 = 𝑎𝑦1 𝑛

 System Properties
• Nonlinear System Example 2: 𝑦 𝑛 = 𝑥 𝑛 + 5𝑢[𝑛 − 1]

𝑥1 𝑛 ՜ 𝑦1 𝑛 = 𝑥1 𝑛 + 5𝑢[𝑛 − 1]

𝑥2 𝑛 ՜ 𝑦2 𝑛 = 𝑥2 𝑛 + 5𝑢[𝑛 − 1]

𝑥3 𝑛 = 𝑐1 𝑥1 𝑛 + 𝑐2 𝑥2 𝑛 ՜ 𝑦3 𝑛 = 𝑥3 𝑛 + 5𝑢[𝑛 − 1]

𝑦3 𝑛 = 𝑐1 𝑥1 𝑛 + 𝑐2 𝑥2 𝑛 + 5𝑢[𝑛 − 1]

≠ 𝑐1 𝑥1 𝑛 + 5𝑢 𝑛 − 1 + 𝑐2 𝑥2 𝑛 + 5𝑢[𝑛 − 1]
 System Properties
6) Time Invariance

• A system is time invariant if the behavior and characteristics of

the system are fixed over time

• A system is time invariant if a time shift in the input signal

results in identical time shift in the output signal

𝑥 𝑛 ՜𝑦𝑛 ⇒ 𝑥 𝑛 − 𝑛0 ՜ 𝑦 𝑛 − 𝑛0
System Properties

x n  nd 
x  n delay system wn

y  n
system delay y  n  nd 

if w n  y  n  nd 
the system TIME INVARIANT
 System Properties
• Time Invariant System Example 1:

𝑦 𝑛 = 𝑥 𝑛 + 𝑥[𝑛 + 5]

𝑥1 𝑛 ՜ 𝑦1 𝑛 = 𝑥1 𝑛 + 𝑥1 [𝑛 + 5]

𝑥2 𝑛 = 𝑥1 𝑛 − 𝑛0 ՜ 𝑦2 𝑛 = 𝑥2 𝑛 + 𝑥2 𝑛 + 5

= 𝑥1 𝑛 − 𝑛0 + 𝑥1 𝑛 − 𝑛0 + 5

𝑦1 𝑛 − 𝑛0 = 𝑥1 𝑛 − 𝑛0 + 𝑥1 [𝑛 + 5 − 𝑛0 ]

𝑦2 𝑛 = 𝑦1 𝑛 − 𝑛0
 System Properties
• Time Invariant System Example 2:

𝑦 𝑛 = 𝑥 𝑛 + 𝑥2 𝑛

𝑥1 𝑛 ՜ 𝑦1 𝑛 = 𝑥1 𝑛 + 𝑥12 𝑛

𝑥2 𝑛 = 𝑥1 𝑛 − 𝑛0 ՜ 𝑦2 𝑛

𝑦2 𝑛 = 𝑥2 𝑛 + 𝑥22 𝑛 = 𝑥1 𝑛 − 𝑛0 + 𝑥12 𝑛 − 𝑛0

𝑦1 𝑛 − 𝑛0 = 𝑥1 𝑛 − 𝑛0 + 𝑥12 𝑛 − 𝑛0 = 𝑦2 𝑛
 System Properties
• Time Varying System Example 1:

𝑦 𝑛 = 𝑎𝑛−1 𝑥 𝑛

𝑥1 𝑛 ՜ 𝑦1 𝑛 = 𝑎𝑛−1 𝑥1 𝑛

𝑥2 𝑛 = 𝑥1 𝑛 − 𝑛0 ՜ 𝑦2 𝑛

𝑦2 𝑛 = 𝑎𝑛−1 𝑥2 𝑛 = 𝑎𝑛−1 𝑥1 𝑛 − 𝑛0

𝑦1 𝑛 − 𝑛0 = 𝑎𝑛−𝑛0 −1 𝑥1 𝑛 − 𝑛0 ≠ 𝑦2 𝑛
 System Properties
• Time Varying System Example 2:

𝑦 𝑛 = 𝑥 𝑛 + 5𝑢[𝑛 − 1]

𝑥1 𝑛 ՜ 𝑦1 𝑛 = 𝑥1 𝑛 + 5𝑢[𝑛 − 1]

𝑥2 𝑛 = 𝑥1 𝑛 − 𝑛0 ՜ 𝑦2 𝑛

𝑦2 𝑛 = 𝑥2 𝑛 + 5𝑢 𝑛 − 1 = 𝑥1 𝑛 − 𝑛0 + 5𝑢 𝑛 − 1

𝑦1 𝑛 − 𝑛0 = 𝑥1 𝑛 − 𝑛0 + 5𝑢 𝑛 − 𝑛0 − 1 ≠ 𝑦2 𝑛
 LTI Systems
• If a system has both the linearity, and the time-invariant
properties, it is termed as a linear time-invariant (LTI) system

• In LTI systems, if the input to the system is represented as a

linear combination of simpler signals, the output will be the
linear combinatin of the system’s output to these simpler
signals

• Remember that each discrete-time signal can be represented

in terms of the simplest signal:

x  n   x  k   n  k 
k 
 LTI Systems
• In other words, if we know a LTI system’s response to a unit
impulse signal, then we can find the system’s response to any
input signal

• The response of a system to a unit impulse signal is named

‘‘impulse response’’

• Impulse response of a system is denoted by h[n]

𝑇
𝛿 𝑛 ՜ ℎ[𝑛]
 LTI Systems
• An LTI system has the property that a time shifted input results
in a time shifted output:

𝑇
𝛿 𝑛 − 𝑘 ՜ ℎ[𝑛 − 𝑘]

• An LTI system has the property that a signal multiplied by a

scalar will result in the output being also multiplied by the
same scalar:

𝑇
𝑥 𝑘 𝛿 𝑛 − 𝑘 ՜ 𝑥[𝑘]ℎ[𝑛 − 𝑘]
 LTI Systems
• An LTI system also has the property that the summation of
multiple inputs result in the output being a summation of the
responses to each input:

∞ ∞
𝑇
෍ 𝑥[𝑘]𝛿 𝑛 − 𝑘 ՜ ෍ 𝑥 𝑘 ℎ 𝑛 − 𝑘
𝑘=−∞ 𝑘=−∞

• As a result:

∞
𝑇
𝑥 𝑛 ՜ 𝑦 𝑛 = ෍ 𝑥 𝑘 ℎ 𝑛−𝑘
𝑘=−∞
 LTI Systems
• Example:

• Consider a deposit account in a bank. If the interest rate

changes with time, than this would be a time varying system. If
the interest rate depends on the amount of money in the
account, than this would be a non-linear system. Let’s consider
a LTI system instead.

• Let’s consider a monthly interest rate of 10%, and that the

interest is added to the capital each month. (Let’s also
consider that our independent variable is also months)
 LTI Systems
• Example (continued):

• Applying an unit impulse signal to this system can be

considered as depositing an amount of 1 to this account on
the first month (x[0]=1), and never depositing an amount
again.

• For this case,

𝑦 0 =𝑥 0 =1
𝑦 1 = 𝑦 0 + 0.1𝑦 0 = 1.1
𝑦 2 = 𝑦 1 + 0.1𝑦 1 = 1.21
...
𝑦 𝑛 = (1.1)𝑛
 LTI Systems
• Example (continued):

𝑇
𝑥 𝑛 = 𝛿 𝑛 ՜ 𝑦 𝑛 = ℎ 𝑛 = 1.1 𝑛

• As we have obtained the impulse response of the system, we

can find the output for any input. Consider that when the
account opens, i.e. the first month, 100TL is deposited to the
account, an amount of 50TL is withdrawn on the tenth month,
and another 100TL is deposited on the twentieth month. In
this case:

𝑥 0 = 100 , 𝑥 9 = −50 , 𝑥 19 = 100

 LTI Systems
• Example (continued):

∞ ∞

𝑦 𝑛 = ෍ 𝑥 𝑘 ℎ[𝑛 − 𝑘] = ෍ 𝑥 𝑘 1.1 𝑛−𝑘

𝑘=−∞ 𝑘=−∞

𝑛−0 𝑛−9 𝑛−19

𝑦 𝑛 = 𝑥 0 1.1 + 𝑥 9 1.1 + 𝑥[19] 1.1

𝑦 29 = 𝑥 0 1.1 29−0 + 𝑥 9 1.1 29−9 + 𝑥[19] 1.1 29−19

= 100 1.1 29 − 50 1.1 20 + 100 1.1 10

≅ 1509
 LTI Systems
• The relationship of an LTI system’s response with the input
signal and the impulse response of the system is named as
‘‘convolution’’

𝑦 𝑛 = ෍ 𝑥 𝑘 ℎ 𝑛−𝑘
𝑘=−∞

• Convolution is denoted by:

𝑦 𝑛 = 𝑥 𝑛 ∗ ℎ[𝑛]
 LTI Systems
• Example: Find the convolution sum of c[n]=a[n]*b[n], where
𝑎 𝑛 = (0.2)𝑛 𝑢[𝑛] and 𝑏 𝑛 = (0.6)𝑛 𝑢[𝑛]

𝑐 𝑛 = 𝑎 𝑛 ∗ 𝑏 𝑛 = ෍ 𝑎 𝑘 𝑏[𝑛 − 𝑘]
𝑘=−∞

= ෍ (0.2)𝑘 𝑢[𝑘] 0.6 𝑛−𝑘 𝑢[𝑛 − 𝑘]

𝑘=−∞

= ෍ (0.2)𝑘 0.6 𝑛−𝑘 𝑢[𝑛]

𝑘=0
 LTI Systems
• Example (continued):
𝑛
𝑛
= 0.6 ෍ (0.2/0.6)𝑘 𝑢 𝑛
𝑘=0

𝑛+1
1
−1
= 0.6 𝑛 3 𝑢𝑛
1
−1
3
𝑛
−3 𝑛
1 1 3 𝑛
= 0.6 + 0.6 𝑢𝑛
2 3 3 2

= 2.5 0.6𝑛+1 − 0.2𝑛+1 𝑢[𝑛]

 LTI Systems
• Example: Find the convolution of x[n] and h[n] given below
 LTI Systems
• Example (continued):
 LTI Systems
• Example (continued):
 LTI Systems
• Example: Find the convolution of x[n] and h[n] given below

𝑦 𝑛 = ෍ 𝑥 𝑘 ℎ[𝑛 − 𝑘]
𝑘=−∞

= ෍ 𝑎𝑘 𝑢[𝑘] 𝑢 𝑛 − 𝑘 − 𝑢[𝑛 − 𝑘 − 𝑁]
𝑘=−∞
 LTI Systems
• Example (continued):

If n<0:

𝑦 𝑛 = ෍ 𝑎𝑘 𝑢[𝑘] 𝑢 𝑛 − 𝑘 − 𝑢[𝑛 − 𝑘 − 𝑁]
𝑘=−∞

yn =0
 LTI Systems
• Example (continued):

If 𝑛 > 0 & 𝑛 < 𝑁 − 1 :

𝑛 𝑛+1
1 − 𝑎
𝑦 𝑛 = ෍ 𝑎𝑘 =
1−𝑎
𝑘=0
 LTI Systems
• Example (continued):

If 0 < 𝑛 − 𝑁 − 1 OR 𝑛 > 𝑁 − 1 :

𝑛 𝑛−𝑁+1 𝑛+1 𝑁
𝑎 − 𝑎 1 − 𝑎
𝑦𝑛 = ෍ 𝑎𝑘 = = 𝑎𝑛−𝑁+1
1−𝑎 1−𝑎
𝑘=𝑛−(𝑁−1)
 LTI Systems
• Example (continued):

0 𝑛<0
1 − 𝑎𝑛+1
0≤𝑛 ≤𝑁−1
𝑦𝑛 = 1−𝑎
𝑛−𝑁+1
1 − 𝑎𝑁
𝑎 𝑛≥𝑁
1−𝑎
 LTI Systems
• OR:
∞

𝑦 𝑛 = ෍ 𝑎𝑘 𝑢[𝑘] 𝑢 𝑛 − 𝑘 − 𝑢[𝑛 − 𝑘 − 𝑁]
𝑘=−∞

𝑛 𝑛−𝑁

= ෍ 𝑎𝑘 𝑢 𝑛 − ෍ 𝑎𝑘 𝑢 𝑛 − 𝑁
𝑘=0 𝑘=0

0 𝑛<0
1 − 𝑎𝑛+1
0≤𝑛 ≤𝑁−1
= 1−𝑎
1 − 𝑎𝑛+1 1 − 𝑎𝑛−𝑁+1 1 − 𝑎 𝑁
− = 𝑎𝑛−𝑁+1 𝑛≥𝑁
1−𝑎 1−𝑎 1−𝑎
 Convolution / LTI System Properties
1) Commutative:

𝑥 𝑛 ∗ ℎ 𝑛 = ℎ 𝑛 ∗ 𝑥[𝑛]

∞ ∞

𝑦 𝑛 = ෍ 𝑥 𝑘 ℎ 𝑛−𝑘 = ෍ 𝑥 𝑛−𝑚 ℎ 𝑚
𝑘=−∞ 𝑚=−∞
 Convolution / LTI System Properties
2) Distributive over summation:

𝑥 𝑛 ∗ ℎ1 𝑛 + ℎ2 𝑛 = 𝑥 𝑛 ∗ ℎ1 𝑛 + 𝑥 𝑛 ∗ ℎ2 𝑛
 Convolution / LTI System Properties
3) Associative:

𝑥 𝑛 ∗ ℎ1 𝑛 ∗ ℎ2 𝑛 = 𝑥 𝑛 ∗ ℎ1 𝑛 ∗ ℎ2 𝑛
 Convolution / LTI System Properties
4) Shifting in Time:

𝑥 𝑛 ∗ℎ 𝑛 =𝑦 𝑛

𝑥 𝑛 − 𝑚 ∗ ℎ[𝑛 − 𝑙] = 𝑦[𝑛 − 𝑚 − 𝑙]
 Convolution / LTI System Properties
5) Convolution with impulse:

𝑥 𝑛 ∗ 𝛿[𝑛] = 𝑥[𝑛]

𝛿 𝑛 ∗ ℎ[𝑛] = ℎ[𝑛]

6) Length:

If 𝑥 𝑛 has 𝑚 samples, and ℎ[𝑛] has 𝑙 samples, then 𝑥 𝑛 ∗ ℎ[𝑛]

has 𝑚 + 𝑙 − 1 samples
 Convolution / LTI System Properties
7) Stability:
∞ ∞

𝑦[𝑛] = ෍ 𝑥 𝑘 ℎ[𝑛 − 𝑘] = ෍ ℎ 𝑘 𝑥[𝑛 − 𝑘]

𝑘=−∞ ∞ 𝑘=−∞

𝑦[𝑛] ≤ ෍ ℎ 𝑘 𝑥[𝑛 − 𝑘]
𝑘=−∞ ∞

𝐼𝑓 𝑥[𝑛] ≤ 𝐵𝑥 ⇒ 𝑦[𝑛] ≤ 𝐵𝑥 ෍ ℎ 𝑘
𝑘=−∞

If both 𝑥 𝑛 and ℎ[𝑛] are bounded, then 𝑥 𝑛 ∗ ℎ[𝑛] is also bounded,

i.e. If ℎ[𝑛] is absolutely summable, the LTI system is stable
∞

𝐼𝑓 𝑆 = ෍ ℎ[𝑘] < ∞ ∶
𝑘=−∞
 Convolution / LTI System Properties
Example: Check whether the ideal delay system is stable

𝑦 𝑛 = 𝑥 𝑛 − 𝑛0

⇒ ℎ 𝑛 = 𝛿[𝑛 − 𝑛0 ]

∞ ∞

𝑆 = ෍ ℎ[𝑘] = ෍ 𝛿[𝑘 − 𝑛0 ] = 1 < ∞ ⇒ 𝑆𝑡𝑎𝑏𝑙𝑒

𝑘=−∞ 𝑘=−∞
 Convolution / LTI System Properties
Example: Check whether the moving average system is stable

𝑀2
1
𝑦𝑛 = ෍ 𝑥[𝑛 − 𝑘]
𝑀1 + 𝑀2 + 1
−𝑀1

1
−𝑀1 ≤ 𝑛 ≤ 𝑀2
⇒ ℎ 𝑛 = ቐ𝑀1 + 𝑀2 + 1
0 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
∞

𝑆 = ෍ ℎ[𝑘] < ∞ ⇒ 𝑆𝑡𝑎𝑏𝑙𝑒

𝑘=−∞
 Convolution / LTI System Properties
Example: Check whether the accumulator system is stable

𝑦 𝑛 = ෍ 𝑥[𝑘]
𝑘=−∞

⇒ ℎ 𝑛 = ෍ 𝛿[𝑘] = 𝑢[𝑛]
𝑘=−∞

∞ ∞

𝑆 = ෍ ℎ[𝑘] = ෍ 𝑢[𝑘] ՜ ∞ ⇒ 𝑈𝑛𝑠𝑡𝑎𝑏𝑙𝑒

𝑘=−∞ 𝑘=−∞
 Convolution / LTI System Properties
Example: Check whether the system with the impulse response
ℎ 𝑛 = 𝑎𝑛 𝑢[𝑛] is stable

∞ ∞ ∞

𝑆 = ෍ ℎ[𝑘] = ෍ 𝑎𝑘 𝑢[𝑘] = ෍ 𝑎𝑘
𝑘=−∞ 𝑘=−∞ 𝑘=0
If 𝑎 ≥ 1:
∞

𝑆 = ෍ 𝑎𝑘 ՜ ∞ ⇒ 𝑈𝑛𝑠𝑡𝑎𝑏𝑙𝑒
𝑘=0
If 𝑎 < 1:
∞
1
𝑆=෍ 𝑎𝑘 = < ∞ ⇒ 𝑆𝑡𝑎𝑏𝑙𝑒
1− 𝑎
𝑘=0
 Convolution / LTI System Properties
• 8) With / Without Memory:

• A system is memoryless if its output at any time depends only

on the value of the input at that time

• For LTI systems, this is satisfied only if h[n] = 0 for n≠0

• In other words, an LTI system is memoryless only if h[n] =

Kδ[n], where K is a constant.
 Convolution / LTI System Properties
• 9) Causal / Non-causal:

• A system is causal if the output depends on the input signal’s

values only at that instant or at the earlier instants

• In other words, the output of a causal system does not depend

on the input’s future values

• If the impulse response of an LTI system is zero for all negative

n values, i.e. ℎ 𝑛 = 0, 𝑛 < 0, then that system is causal