Scribd
Upload
5 views31 pages

Lecture 02

sagrtryty,k

Uploaded by

Sajjad Ali Sajjad
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
5 views31 pages

Lecture 02

sagrtryty,k

Uploaded by

Sajjad Ali Sajjad
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/ 31

Digital Signal Processing (EE-471)

Lecture 02
Discrete-Time Linear Time-Invariant (LTI) Systems

Dr. S M Wasif
[email protected]
November 22, 2022
Department of Electrical Engineering,
University of Gujrat
Table of contents

1. Analysis of Discrete-Time Linear Time-Invariant (LTI) Systems

2. The Convolution Sum

3. Signal Generation and Plotting in MATLAB

1
Analysis of Discrete-Time
Linear Time-Invariant (LTI)
Systems
Analysis of Discrete-Time Linear Time-Invariant (LTI) Sys-
tems

• There are two basic methods for analyzing the behavior or


response of a linear system to a given input signal.
1 The Convolution Sum
2 Linear Constant Coefficient Difference Equation (LCCD)
• Impulse response

• The convolution sum


∞
X
y[n] = x[k ]h[n − k]
k=−∞

2
The Convolution Sum
The Convolution Sum

• The process of computing the convolution involves the following


four steps.
1 Folding
2 Shifting
3 Multiplication
4 Summation

3
The Convolution Sum

4
The Convolution Sum

5
Analytical Evaluation of Convolution Sum

• Let x[n] is a signal of range N1 ≤ n ≤ N2 .


• h[n] is impulse response of range M1 ≤ n ≤ M2 .
• The h[n − k ] will shift by n samples.
• h[M1 ] is at k = n − M1 and h[M2 ] is at k = n − M2 .
• No overlap: if n − M1 < N1 (on left-side) or n − M2 > N2 (on
right-side).

6
Analytical Evaluation of Convolution Sum

• Partial overlap (left): in range:

n − M 1 ≥ N1 or n ≥ M 1 + N1

and
n − M 2 < N1 or n < M 2 + N1
n−M
X1
y [n] = x[k]h[n − k ] for N1 + M1 ≤ n < N1 + M2
k =N1

7
Analytical Evaluation of Convolution Sum

• Full overlap: in range:

n − M 2 ≥ N1 or n ≥ N1 + M 2

and
n − M 1 ≤ N2 or n ≤ M 1 + N2
n−M
X1
y [n] = x[k]h[n − k] for N1 + M2 ≤ n ≤ M1 + N2
k=n−M2

8
Analytical Evaluation of Convolution Sum

• Partial overlap (right): in range:

n − M 1 > N2 or n > M 1 + N2

and
n − M 2 ≤ N2 or n ≤ M 2 + N2
N2
X
y [n] = x[k]h[n − k] for M1 + N2 < n ≤ M2 + N2
k=n−M2

9
Graphical Illustration of Convolution

10
Graphical Illustration of Convolution

11
Graphical Illustration of Convolution

12
Graphical Illustration of Convolution

13
Graphical Illustration of Convolution

14
Graphical Illustration of Convolution

15
Graphical Illustration of Convolution

16
Graphical Illustration of Convolution

17
Graphical Illustration of Convolution

18
Graphical Illustration of Convolution

19
Graphical Illustration of Convolution

20
Graphical Illustration of Convolution

21
Graphical Illustration of Convolution

22
Graphical Illustration of Convolution

23
Graphical Illustration of Convolution

24
Signal Generation and Plotting
in MATLAB
Signal Generation and Plotting in MATLAB

• Example:

x[n] = 2 cos(2π0.05n), −10 ≤ n ≤ 10

n = (−10 : 10);
x = 2 ∗ cos(2 ∗ π ∗ 0.05 ∗ n);
stem(n, x,‘fill’,‘LineWidth’, 3);
ylabel(‘x[n]’);
xlabel(‘n’);

25
Signal Generation and Plotting in MATLAB

• Unit Impulse Signal: x[n] = δ(n)

clc; clear ; close all;


n = −2 : 0.1 : 2;
x = [zeros(1, 20), ones(1, 1), zeros(1, 20)];
stem(n, x,‘fill’,‘LineWidth’, 3);
ylabel(‘Amplitude’);
xlabel(‘n’);

26
Signal Generation and Plotting in MATLAB

• Sinusoidal Sequence: x[n] = 2 cos(2π0.05n), −10 ≤ n ≤ 10

clc; clear ; close all;


n = (−10 : 10);
x = 2 ∗ cos(2 ∗ pi ∗ 0.05 ∗ n);
stem(n, x,‘fill’,‘LineWidth’, 3);
ylabel(‘Amplitude’);
xlabel(‘n’);

27

You might also like