Digital Signal Processing

(CS202)
2022 – 2023

Lecture-5

Dr: Mary monir saied

Email: [email protected]
 Course outlines
The main contents of the course are:
 Introduction to Digital Signal processing
 What are Signals?
 What is DSP?
 Importance of digital Signal Processing (Applications
of Digital processing)
 Discrete-Time Signals
 Introduction
Continuous time signal
Discrete time signal
Digital Signal
 Analog to Digital conversion, The sampling theorem.

2
Course outlines
The main contents of the course are:
 Representations of Discrete Signals
 Some important Discrete Signals
 Classification of Discrete-Time Signals
 Simple Manipulations of Discrete-Time Signals
 Discrete-Time Systems
 Input-Output Description of Systems
 Block Diagram Representation of Discrete-Time
Systems
 Classification of Discrete-Time Systems
 Interconnection of Discrete-Time Systems
 Linear time-invariant(LTI)systems and their
properties 3
 Course outlines
The main contents of the course are:
 The Z-transform
 The direct z-transform
 Properties of the z-transform
 The inversion of the z transform
 Discrete Fourier transform (DFT) and fast Fourier
transform(FFT)
 Design of digital filters
 FIR filter
 IIR filter

4
 DSP Scenario
 Modern systems generally…….
 get a continuous-time signal from a sensor
 a continuous-time system modifies the signal
 Represent signals by a sequence of numbers (Sampling or
analog-to-digital conversions)
 Perform processing on these numbers with a digital processor
(Digital signal processing)
 and then (if desired) reconstruct analog signal from processed
numbers (digital-to-analog conversion)

5
Classification of Discrete-Time Systems
Example
 Check the following systems with respect to: time
invariance, linearity, causality. Also, determine if
any of them is with memory.

y(n)=x(-n+2) The system with memory

The system is non-causal
The system is linear
The system is Time variant

6
Classification of Discrete-Time Systems
Ans.: y(n)=x(-n+2)

7
Classification of Discrete-Time Systems
y(n)=x(-n+2)

𝑦1 𝑛 − 𝑘 = 𝑥1 −(𝑛 − 𝑘 + 2) = 𝑥1 −𝑛 + 𝑘 + 2 ………………………………(1)

𝑥2 𝑛 = 𝑥1 (𝑛 − 𝑘)

𝑦2 𝑛 = 𝑥2 (−𝑛 + 2)=𝑥1 (−𝑛 + 2) − 𝑘 = 𝑥1 −𝑛 − 𝑘 + 2 … … … … … … (2)

𝑦2 𝑛 ≠ 𝑦1 (𝑛 − 𝑘)

8
LINEAR TIME-INVARIANT(LTI)SYSTEMS
AND THEIR PROPERTIES
 Linear time-invariant(LTI)systems

 Linear + Time Invariant = LTI system

 Why LTI?
Many physical systems fit the LTI
description.
Easier to analyze.

10
Linear time-invariant(LTI)systems
 As a consequence of the linearity and time-
invariance properties of the system, the response of
the system to any arbitrary input signal can be
expressed in terms of the unit sample(impulse)
response of the system.
∞

𝒚 𝒏 = 𝑳𝑻𝑰 𝒙 𝒏 = 𝒙 𝒌 𝒉(𝒏 − 𝒌)
𝒌=−∞

 The mathematical operation in (Eq.) is called a

linear convolution sum and is denoted by
 We say that the input x(n) is convolved with the
impulse response h(n) to yield the output y(n). 11
Linear time-invariant(LTI)systems

 Hence an LTI system is completely characterized in

the time domain by the impulse response h(n).

12
Linear time-invariant(LTI)systems

13
Linear Convolution Sum

Two ways to perform digital convolution

• Graphical method

5. Repeat steps 1 to 4 for the next convolution value y(n)

14
Linear Convolution Sum

Two ways to perform digital convolution

• Table method

15
Linear Convolution Sum

 General Guidelines
 Number of samples The number of samples N in
the output signal y[n] will be

N=A+B–1

Where, A is the number of samples in sequence x[x],

B is the number of samples in sequence h[x]

16
Linear Convolution Sum

 General Guidelines
 Boundaries for x(n), N1 ≤ n ≤ N2
h(n), M1 ≤ n ≤ M2
y(n), L1 ≤ n ≤ L2
L1 = M1 + N1
L2 = M2 + N2
 Verification one way to verify the result is to
check
∑ y(n) =∑ x(n) ∑ h(n)
17
 Linear Convolution Sum
Example:-

Ans.: y(n) = {9,9,11,5,2}

Number of samples
 The number of samples N in the output signal y[n] will be

N = A + B – 1=3+3-1=5
x(n), 0 ≤ n ≤ 2
 Boundaries h(n), 0 ≤ n ≤ 2
L1 = M1 + N1=0+0=0
y(n), L1 ≤ n ≤ L2
L2 = M2 + N2=2+2=4 18
Linear Convolution Sum
Example:-

Ans.: y(n) = {9,9,11,5,2}

 Verification ∑ y(n) =∑ x(n) ∑ h(n)
∑ y(n) =9+9+11+5+2=36
∑ x(n) =3+1+2=6
∑ h(n) =3+2+1=6
∑ y(n) =∑ x(n) ∑ h(n)=6 x 6=36 19
Linear Convolution Sum
Example:-

Ans.: 1- Graphical Method:

20
21
22
23
24
25
Linear Convolution Sum

26
2- Table Method:

K -2 -1 0 1 2 3 4 5
X(k) 3 1 2
h[0-k] 1 2 3
h[1-k] 1 2 3
h[2-k] 1 2 3
h[3-k] 1 2 3
h[4-k] 1 2 3
h[5-k] 1 2 3

27
2- Table Method:

K -2 -1 0 1 2 3 4 5
X(k) 3 1 2 y[n<0] 0
h[0-k] 1 2 3
h[1-k] 1 2 3
h[2-k] 1 2 3
h[3-k] 1 2 3
h[4-k] 1 2 3
h[5-k] 1 2 3

28
2- Table Method:

K -2 -1 0 1 2 3 4 5
X(k) 3 1 2 y[n<0] 0
h[0-k] 1 2 3 y[0] 9
h[1-k] 1 2 3
h[2-k] 1 2 3
h[3-k] 1 2 3
h[4-k] 1 2 3
h[5-k] 1 2 3

29
2- Table Method:

K -2 -1 0 1 2 3 4 5
X(k) 3 1 2 y[n<0] 0
h[0-k] 1 2 3 y[0] 9
h[1-k] 1 2 3 y[1] 9
h[2-k] 1 2 3
h[3-k] 1 2 3
h[4-k] 1 2 3
h[5-k] 1 2 3

30
2- Table Method:

K -2 -1 0 1 2 3 4 5
X(k) 3 1 2 y[n<0] 0
h[0-k] 1 2 3 y[0] 9
h[1-k] 1 2 3 y[1] 9
h[2-k] 1 2 3 y[2] 11
h[3-k] 1 2 3
h[4-k] 1 2 3
h[5-k] 1 2 3

31
2- Table Method:

K -2 -1 0 1 2 3 4 5
X(k) 3 1 2 y[n<0] 0
h[0-k] 1 2 3 y[0] 9
h[1-k] 1 2 3 y[1] 9
h[2-k] 1 2 3 y[2] 11
h[3-k] 1 2 3 y[3] 5
h[4-k] 1 2 3
h[5-k] 1 2 3

32
2- Table Method:

K -2 -1 0 1 2 3 4 5
X(k) 3 1 2 y[n<0] 0
h[0-k] 1 2 3 y[0] 9
h[1-k] 1 2 3 y[1] 9
h[2-k] 1 2 3 y[2] 11
h[3-k] 1 2 3 y[3] 5
h[4-k] 1 2 3 y[4] 2
h[5-k] 1 2 3

33
2- Table Method:

K -2 -1 0 1 2 3 4 5
X(k) 3 1 2 y[n<0] 0
h[0-k] 1 2 3 y[0] 9
h[1-k] 1 2 3 y[1] 9
h[2-k] 1 2 3 y[2] 11
h[3-k] 1 2 3 y[3] 5
h[4-k] 1 2 3 y[4] 2
h[5-k] 1 2 3 y[n≥5] 0

34
2- Table Method:

K -2 -1 0 1 2 3 4 5
X(k) 3 1 2 y[n<0] 0
h[0-k] 1 2 3 y[0] 9
h[1-k] 1 2 3 y[1] 9
h[2-k] 1 2 3 y[2] 11
h[3-k] 1 2 3 y[3] 5
h[4-k] 1 2 3 y[4] 2
h[5-k] 1 2 3 y[n≥5] 0

35
Linear Convolution Sum

36
Linear Convolution Sum
Example:-

37
 Linear Convolution Sum
Example:-

Ans.: y(n) = {0.5, 2.5, 2.5, 2}

Number of samples
 The number of samples N in the output signal y[n] will be

N = A + B – 1=2+3-1=4
x(n), 0 ≤ n ≤ 1
 Boundaries h(n), 0 ≤ n ≤ 2
L1 = M1 + N1=0+0=0
y(n), L1 ≤ n ≤ L2
L2 = M2 + N2=1+2=3 38
Linear Convolution Sum
Example:-

Ans.: y(n) = {0.5, 2.5, 2.5, 2}

 Verification ∑ y(n) =∑ x(n) ∑ h(n)
∑ y(n) =0.5+2.5+2.5+2=7.5
∑ x(n) =0.5+2=2.5
∑ h(n) =1+1+1=3
∑ y(n) =∑ x(n) ∑ h(n)=3 x 2.5=7.5 39
Ans.:
1- Graphical Method:

40
1- Graphical Method (cont.):

41
Linear Convolution Sum

42
2- Table Method:

K -2 -1 0 1 2 3 4 5
X(k) 0.5 2
h[0-k] 1 1 1
h[1-k] 1 1 1
h[2-k] 1 1 1
h[3-k] 1 1 1
h[4-k] 1 1 1

43
2- Table Method:

K -2 -1 0 1 2 3 4 5
X(k) 0.5 2 y[n<0] 0
h[0-k] 1 1 1
h[1-k] 1 1 1
h[2-k] 1 1 1
h[3-k] 1 1 1
h[4-k] 1 1 1

44
2- Table Method:

K -2 -1 0 1 2 3 4 5
X(k) 0.5 2 y[n<0] 0
h[0-k] 1 1 1 y[0] 0.5
h[1-k] 1 1 1
h[2-k] 1 1 1
h[3-k] 1 1 1
h[4-k] 1 1 1

45
2- Table Method:

K -2 -1 0 1 2 3 4 5
X(k) 0.5 2 y[n<0] 0
h[0-k] 1 1 1 y[0] 0.5
h[1-k] 1 1 1 y[1] 2.5
h[2-k] 1 1 1
h[3-k] 1 1 1
h[4-k] 1 1 1

46
2- Table Method:

K -2 -1 0 1 2 3 4 5
X(k) 0.5 2 y[n<0] 0
h[0-k] 1 1 1 y[0] 0.5
h[1-k] 1 1 1 y[1] 2.5
h[2-k] 1 1 1 y[2] 2.5
h[3-k] 1 1 1
h[4-k] 1 1 1

47
2- Table Method:

K -2 -1 0 1 2 3 4 5
X(k) 0.5 2 y[n<0] 0
h[0-k] 1 1 1 y[0] 0.5
h[1-k] 1 1 1 y[1] 2.5
h[2-k] 1 1 1 y[2] 2.5
h[3-k] 1 1 1 y[3] 2
h[4-k] 1 1 1

48
2- Table Method:

K -2 -1 0 1 2 3 4 5
X(k) 0.5 2 y[n<0] 0
h[0-k] 1 1 1 y[0] 0.5
h[1-k] 1 1 1 y[1] 2.5
h[2-k] 1 1 1 y[2] 2.5
h[3-k] 1 1 1 y[3] 2
h[4-k] 1 1 1 y[n≥4] 0

49
2- Table Method:
K -2 -1 0 1 2 3 4 5
X(k) 0.5 2 y[n<0] 0
h[0-k] 1 1 1 y[0] 0.5
h[1-k] 1 1 1 y[1] 2.5
h[2-k] 1 1 1 y[2] 2.5
h[3-k] 1 1 1 y[3] 2
h[4-k] 1 1 1 y[4] 0

50
INTERCONNECTION OF DISCRETE-TIME
SYSTEMS
Interconnection between Systems

52
Interconnection between Systems

53
Convolution Properties

54
Convolution Properties

55
Thank You

56