11/19/2021

Digital Signal Processing

(EE-394)
Lecture # 9 &10

Resource Persons:
Dr. Krishan Lal Khatri

Previous Lecture
• We learned how to represent DT signals
• Some elementary DT signals
• Energy and Power signals in DT
• Other classifications of signals

1
 11/19/2021

In this lecture we’ll learn

• Transformations on DT Signals
• What is Convolution and How it is performed
• Why convolution is useful

DT Signal Operations
• Transformations on signal
• Transformation on independent variable

2
 11/19/2021

Transformations on DT Signal
• Scaling or multiplication with a constant
• Adding different DT signals
• Multiplying different DT signals
• Convolution

Transformation of the independent

variable (time)
• Shifting in time
• Folding in time
• Combination of shift and fold

3
 11/19/2021

Shifting in time

Shifting in time

4
 11/19/2021

Shifting in time

Folding in time

10

10

5
 11/19/2021

Shifting and Folding

11

11

Shifting and Folding

12

12

6
 11/19/2021

System input out block diagram

A discrete time system is a device or an algorithm (program) which processes a discrete signal as
input and produces another discrete signal as output. In above figure, x(n) is and input signal and
y(n) is an output signal.

Mathematically, we represent his relationship between input and output as:

𝑦 𝑛 =𝜏 𝑥 𝑛

where ‘τ’ represents the ‘processing’ which is performed by the system on an input signal.

13

13

Convolution
Convolution of two signals, say, and is
given by:

In above equation, both n and k are integer

indices.
14

14

7
 11/19/2021

Convolution as a tool for finding

system output
Impulse Response: When impulse δ(n) is provided as input to a system,
the corresponding output is called impulse response h(n).
To find out output y(n) to any arbitrary input x(n) of your choice, we can
convolve that input x(n) with the impulse response h(n) of that system.
δ(n) System h(n)
Impulse Impulse Response

So, if impulse is convolved with impulse response of a system, then the

output will again be a impulse reponse

ℎ 𝑛 = 𝛿 𝑛 ∗ ℎ(𝑛) = 𝛿 𝑘 ℎ(𝑛 − 𝑘)
15

15

Convolution Steps

16

16

8
 11/19/2021

Convolution

17

17

k -7 -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6 7
n x(k) 1 2 3 1 y(n)
h(-k) -1 1 2 1
x(k) 1 2 3 1
-2
h(-2-k) -1 1 2 1 No overlap 0
x(k) 1 2 3 1
-1
h(-1-k) -1 1 2 1 1x1= 1
x(k) 1 2 3 1
0
h(-k) -1 1 2 1 1x2 + 2x1= 4
x(k) 1 2 3 1
1
h(1-k) -1 1 2 1 1x1 + 2x2 + 3x1= 8
x(k) 1 2 3 1
2
h(2-k) -1 1 2 1 1x(-1) + 2x1 + 3x2 +1x1= 8
x(k) 1 2 3 1
3
h(3-k) -1 1 2 1 2x(-1) + 3x1 + 1x2 = 3
x(k) 1 2 3 1
4
h(4-k) -1 1 2 1 3x(-1) + 1x1= -2
x(k) 1 2 3 1
5
h(5-k) -1 1 2 1 1x(-1)= -1
x(k) 1 2 3 1
6
h(6-k) -1 1 2 1 No overlap 0
18

18

9
 11/19/2021

Convolution

19

19

10