9/19/2022

Impulse Response –Finite or Infinite

 FIR System – Finite duration impulse response
 h(n) = 0 for n < 0 and for n ≥ M

𝑦𝑛 = ℎ 𝑘 𝑥[𝑛 − 𝑘]
DIGITAL SIGNAL PROCESSING
SEM-1, 2022-23  Requires most recent M input samples [x(n), x(n-1), x(n-
2)….x(n-M+1)] and involves summation of M products.
 It “neglects” or “forgets” previous input samples such as
ECE/EEE F434 Lecture 7 [x(n-M), x(n-M-1), …]  Has finite memory of M samples.
Dr. Sarang C. Dhongdi, Dept of EEE, BITS Goa

Impulse Response –Finite or Infinite LTI DT systems – Difference Equation

 IIR System – Infinite duration impulse response  Important subclass of LTI DT systems is
characterized by LCCDE equation as follows: -
N M

 ak y(n  k )   bk x(n  k )
System causality
𝑦𝑛 = ℎ 𝑘 𝑥[𝑛 − 𝑘] is assumed.

k 0 k 0

 Summation involves present and all the past input  Here, order of the DT system is max(N,M)
samples, we say that the system has infinite memory!  This representation is very important in practical
applications – including implementation of filters,
modeling of physical phenomenon and system.

LTI DT systems – Difference Equation Recursive and Non-recursive systems

N M  In general, if the output y(n) depends on past output

a0 y (n)  a
k 1
k y (n  k )  b
k 0
k x(n  k ) samples  Recursive system.
y[n] = F [y(n-1), y(n-2), …, y(n-M), x(n), x(n-1)…x(n-M)]
1  M N

y (n )    bk x ( n  k )   a k y ( n  k )   If the output y(n) depends only on present and past
a0  k 0 k 1  a0≠0
input samples  Non-recursive system.
y[n] = F [x(n), x(n-1)…x(n-M)]
 Here, system implementation involves two finite sum M
bk
of products –(even though in general such system
y (n)   x(n  k )
may have impulse response of infinite length.)
k  0 a0

1
 9/19/2022

Recursive and Non-recursive systems Examples of Discrete time systems

n

x[n]
y[n] = F [y(n-1), y(n-2), …,
y[n]
 Accumulator y (n)   x(l )
l  
y(n-M), x(n), x(n-1)…x(n-M)]

Z-1
y ( n )  y ( n  1)  x ( n )
1 n
y ( n)   x(l )   x(l )
l   l 0
x[n] y[n] n
y[n] = F [x(n), x(n-1)…x(n-M)]
y (n)  y (1)   x (l ) n0
l 0

Examples of Discrete time systems

 Taking average on M-point for noise corrupted signal –

 Moving Average filter

x (n )  s(n )  d (n) s(n) – data sample

d(n) – Noise sample

From signal x[n], if we take M-point average (or mean), we can get
reasonably good estimate of uncorrupted signal

M 1
1
y (n) 
M
 x(n  l )
l 0