Scribd
Upload
20 views13 pages

ECE212-ESA-Lecture4 - Part1 - Convolution

The document summarizes discrete-time linear time-invariant (DT LTI) systems. It defines the unit pulse response h[n] and shows that the output of any DT LTI system y[n] is the convolution of the input x[n] with the unit pulse response. Convolution is represented by the symbol * and calculates each output point y[n] as the sum of the input multiplied by shifted versions of the unit pulse response. Graphical examples are provided to illustrate convolution and show that the duration of the output is the sum of the durations of the input and unit pulse response.

Uploaded by

ahmed osama elsayed ahmed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
20 views13 pages

ECE212-ESA-Lecture4 - Part1 - Convolution

The document summarizes discrete-time linear time-invariant (DT LTI) systems. It defines the unit pulse response h[n] and shows that the output of any DT LTI system y[n] is the convolution of the input x[n] with the unit pulse response. Convolution is represented by the symbol * and calculates each output point y[n] as the sum of the input multiplied by shifted versions of the unit pulse response. Graphical examples are provided to illustrate convolution and show that the duration of the output is the sum of the durations of the input and unit pulse response.

Uploaded by

ahmed osama elsayed ahmed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

DT LTI

x[ n]   ak xk [ n] y[n]   bk y k [n]
k hn k

• Define the unit pulse response, h[n], as the response of a DT LTI system to a unit pulse
function, [n].
• Using the principle of time-invariance:  [n]  h[n]   [n  k ]  h[n  k ]
• Using the principle of linearity: convolution operator
 
x[n]   x[k ]  [n  k ]  y[n] 
k  
 x[k ] h[n  k ]  x[n]  h[n]
k  

• Comments: convolution sum


• The summation is referred to as the convolution sum.
• The symbol “*” is used to denote the convolution operation.

• The output of any DT LTI is a convolution of the input signal with the unit pulse response:
DT LTI
x[n] y[n]  x[n] * h[n]
hn
6
• Any DT LTI system is completely characterized by its unit pulse response.
• Convolution has a simple graphical interpretation:

 
x[n]   x[k ]  [n  k ]  y[n] 
k  
 x[k ] h[n  k ]  x[n]  h[n]
k  

7
• There are four basic steps to the calculation:

• We can calculate each output point by shifting the unit


pulse 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?
8
Graphical Convolution

0

0

9
Graphical Convolution (Cont.)

1)(1)  2

2

1

10
Graphical Convolution (Cont.)

• Observations:
• y[n] = 0 for n > 4
• If we define the duration of h[n] as the difference in time from the first
nonzero sample to the last nonzero sample, the duration of h[n], Lh, is
4 samples.
• Similarly, Lx = 3.
• The duration of y[n] is: Ly = Lx + Lh – 1. This is a good sanity check.
• The fact that the output has a duration longer than the input indicates that
convolution often acts like a low pass filter and smoothes the signal.

11
Find y(t) and draw x(t), h(t), and y(t)

x(t )   t    t  1   t  2 
h(t )  2 t   0.5 t  1

12
13
14
15
16
17
• The sequences x[k] and h[n- k] are plotted as
functions of k in Figure (a).
• Note that x[k] is zero for k> 0 and h[n- k] is zero
for k > n.
• We also observe that, regardless of the value of
n, the sequence x[k]h[n- k] always has nonzero
samples along the k-axis.
• When n ≥0, x[k]h[n - k] has nonzero samples in
the interval k ≤ 0. It follows that, for n≥0,

18

You might also like