Digital Signal Processing: University of Sciences & Technology

Digital signal processing 2018
University of sciences & Technology

Faculty of Engineering
Department of Electrical Engineering
Fourth Year
Semester Seven
Tutorial Sheet of
Digital Signal Processing
Writer By:
Eng.Elyaseen Elyas
Contact:
Tel:+249916020383
Tel:+249922755504
Email:ElyaseenElyas777@gmail.com
 Tutorial Sheet No (1)
 Basic concepts in Digital Signal Processing(DSP):
 Definition _ what does (DSP) mean?

............................................................................................................
………………………………………………………………………
 Digital
............................................................................................................
............................................................................................................
 Signal:
............................................................................................................
 Processing:
.......................................................................................................
 Block diagram of analog signal processing:
1
MSc. Computer Architecture & Network By: Eng.Elyaseen Elyas 2018
 Block diagram of Digital Signal Processing:
 Advantages of DSP:
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...

 Disadvantages of DSP:
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
 Application of DSP:
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
 Signals:
………………………………………………………………………………...
 Basic Sequence operations:
1\ Unit sample (impulse):
2\Unit step sequence:

3\ exponential sequence:
4\ ramp sequence:
 Implementation operation (on several signals):

1\Addition:
…………………………………………………………………………….......
…………………………………………………………………………….......
2\Multiplication (or modulation):
…………………………………………………………………………….......
3\Scaling (or scalar multiplication):
…………………………………………………………………………….......
…………………………………………………………………………….......
 Implementation operation (one signal):
1\Reversal:
...........................................................................................................................

2\ Shifting:
...........................................................................................................................
...........................................................................................................................
3\ Time Scaling:
...........................................................................................................................
...........................................................................................................................
...........................................................................................................................
 Convolution:
y(n) = x(n) ∗ h(n) = ∑ x(k)h(n − k)

𝑘=−∞
 Example:
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
5

………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
6

………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...

 Correlation:
𝒓𝑿𝒀 [n] = x(n)O𝑦(𝑛) = ∑ x(k)h(−n + k) = x(n) ∗ y(−n)

𝑘=−∞
 Example:
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
8
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
9

………………………………………………………………………………...
Block diagram representation of discrete time system:

1\ Adder:
2\ a constant multiplier:
3\ a signal multiplier:
4\ a unit delay element:
5\ a unit advance element:
 Difference equation :
10


 Z_Transform
Definition of Z_Transform:
The Z_transform performs the transformation from the domain of
discrete time signals, to another domain which we call Z_domain.
It is used with discrete time signals, the same way the Laplace and
Fourier transforms are used with continuous time signals.
The Z_transform yields a frequency domain description for
discrete time signals, and forms the basis for the design of digital
systems, such as digital filters.
𝑥 (𝑧) = ∑ 𝑥(𝑘)𝑧 −𝑘
𝑘=0
Figure (1.2): Formation of discrete time signals.
11
Example (2.1):
Find the Z_transform of the geometric sequence defined as:
𝟎 𝒌 = −𝟏, −𝟐, −𝟑, …
𝒙[𝒌] = { 𝒌
𝒂 𝒌 = 𝟎, 𝟏, 𝟐, 𝟑, 𝟒, …
Solution:
…………………………………………………………………………….......
…………………………………………………………………………….......
…………………………………………………………………………….......
…………………………………………………………………………….......
Example (2.2):
Find the Z_transform of unit samples δ(k)
Solution:
…………………………………………………………………………….......
…………………………………………………………………………….......
…………………………………………………………………………….......
Example (2.3):
Find the Z_transform of unit step u(k)
Solution:
…………………………………………………………………………….......
…………………………………………………………………………….......
…………………………………………………………………………….......
12

Example (2.4):
Find the Z_transform of unit 𝑈𝑎= 𝑢(𝑘) (alternative k>=0)
Solution:
…………………………………………………………………………….......
…………………………………………………………………………….......
…………………………………………………………………………….......
Example (2.5):
Find the Z_transform of exponential
−𝑎𝑘
𝑥(𝑘) = { 𝑒 0≤𝑘
0 𝑘<0
Solution:
…………………………………………………………………………….......
…………………………………………………………………………….......
…………………………………………………………………………….......
…………………………………………………………………………….......
Example (2.6):
Find the Z_transform of sinusoidal signal
Solution:
…………………………………………………………………………….......
…………………………………………………………………………….......
…………………………………………………………………………….......
…………………………………………………………………………….......
13
…………………………………………………………………………….......
…………………………………………………………………………….......
…………………………………………………………………………….......
Properties of Z_transform:
Z_transform is linear transform and its properties are similar to
Laplace or Fourier transform or any one orthogonal transform.
1\ uniqueness:
…………………………………………………………………………….......
…………………………………………………………………………….......
2\ Linearity:
…………………………………………………………………………….......
…………………………………………………………………………….......
3\ Delay:
…………………………………………………………………………….......
…………………………………………………………………………….......
…………………………………………………………………………….......
…………………………………………………………………………….......
4\ Advance property:
…………………………………………………………………………….......
…………………………………………………………………………….......
…………………………………………………………………………….......
…………………………………………………………………………….......
14

5\ Multiplication by 𝒂𝒌 :
…………………………………………………………………………….......
…………………………………………………………………………….......
…………………………………………………………………………….......
6\ Multiplication by k:
…………………………………………………………………………….......
…………………………………………………………………………….......
…………………………………………………………………………….......
7\ initial value:
…………………………………………………………………………….......
…………………………………………………………………………….......
…………………………………………………………………………….......
…………………………………………………………………………….......
8\ final value:
…………………………………………………………………………….......
…………………………………………………………………………….......
…………………………………………………………………………….......
…………………………………………………………………………….......
Finding Z_tranform from Laplace:
…………………………………………………………………………….......
…………………………………………………………………………….......
…………………………………………………………………………….......
…………………………………………………………………………….......
…………………………………………………………………………….......
15

…………………………………………………………………………….......
…………………………………………………………………………….......
…………………………………………………………………………….......
…………………………………………………………………………….......
…………………………………………………………………………….......
16


 Inverse Z_Transform
When the analysis is needed in discrete format, we convert the frequency

domain signal back into discrete format through inverse Z-transformation.
We follow the following four ways to determine the inverse Z-
transformation.
1. Partial Fraction expansion method
2. Long Division Method
3. Residue or Contour integral method
1\ partial fraction:
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
 Example (3.1)
Use the partial fraction expansion method to compute the Inverse Z

transform of
𝑍3
𝐹(𝑍) =
(𝑍 − 0.5)(𝑍 − 0.75)(𝑧 − 1)
Solution:
……………………………………………………………………………
……………………………………………………………………………
……………………………………………………………………………
17

……………………………………………………………………………
……………………………………………………………………………
……………………………………………………………………………
……………………………………………………………………………
……………………………………………………………………………
……………………………………………………………………………
……………………………………………………………………………
……………………………………………………………………………
……………………………………………………………………………
……………………………………………………………………………
……………………………………………………………………………
……………………………………………………………………………..
……………………………………………………………………………..
 Example(3.2)
Use the partial fraction expansion method to compute the Inverse Z_

transform of
12𝑍
𝐹(𝑍) =
(𝑍 + 1)(𝑍 − 1)2
Solution:
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
18
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
……………………………………………………………………………
………………………………………………………………………………
 Example(3.3)
Use the partial fraction expansion method to compute the Inverse Z_

𝑍 −1 +1
transform of 𝐹 (𝑍) =
1−𝑧 −1 +0.5𝑍 −2
Solution:
………………………………………………………………………………
……….………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
2. Long Division Method:
………………………………………………………………………
………………………………………………………………………
 Example(3.4)
Use the long division method to determine 𝐹(𝑘) for 𝑘= 0 , 1 and 2 given that
1 + 𝑍 −1 + 2𝑍 −2 + 3𝑍 −2
𝐹(𝑍) =
(1 − 0.25𝑍 −1 )(1 − 0.5𝑍 −1 )(1 − 0.75𝑍 −1 )
Solution:
19
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
 Example(3.5)
Use the long division method to compute the first 5 terms of the
discrete−time sequence whose Z transform is
𝑍 −1 + 𝑍 −2 + 𝑍 −3
𝐹(𝑍) =
1 + 𝑍 −1 + 𝑍 −2 + 𝑍 −3
Solution:
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
20
3. Residue or Contour integral method:

………………………………………………………………………………
……….………………………………………………………………………
 Example(3.6):
Use the inversion integral method to find the Inverse Z_ transform of
1 + 2𝑍 −1 + 𝑍 −3
𝐹(𝑍) =
(1 − 𝑍 −1 )(𝑍 − 0.75)
Solution:
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
……………………………………………………………………….
 Example(3.7):
Use the Inversion Integral to compute the Inverse Z_ transform of
1
𝐹(𝑍) =
(1 − 𝑍 −1 )(1 − 0.75𝑍 −1 )
Solution:
………………………………………………………………………………
………………………………………………………………………………
21

………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
 Application of Z_Transform:
……………………………………………………………………………
……………………………………………………………………………
 Example(3.8):
Find the response of the system 𝛿(𝑘) = 𝑆(𝑘 + 2) − 3𝑆(𝑘 + 1) + 2𝑆(𝑘),

when all the initial conditions are zero.
Solution:
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
……………………………………………………………………………….
22
 Example(3.9):
Find the system function H(z) and unit sample response h(k) of the system
whose difference equation is described as under
1
𝑦(𝑘) = 𝑦(𝑘 − 1) + 2𝑥(𝑘)
2
Solution:
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
 Example(3.10):
Determine Y(z), k≥0 in the following case:
1 1
𝑦(𝑘) + 𝑦(𝑘 − 1) − 𝑦(𝑘 − 2) = 0 , given y(-1)=y(-2)=1
2 4
Solution:
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
23
 The Discrete Fourier Transform (DFT)
 Definition of DFT:
Let 𝑥(𝑘) = {𝑥(0), 𝑥(1), 𝑥(2), … , 𝑥(𝑁 − 1)}

Where:
N: is discrete signal or sequence, then the discrete Fourier Transform
of x(k) is denoted as
𝑋(𝑛) = 𝐷𝐹𝑇{𝑋(𝑘)}
Where:
n: is index of frequency.
K: is index of time.
𝑁−1
−𝑗2𝜋𝑘𝑛
𝑋(𝑛) = ∑ 𝑋(𝑘) 𝑒 𝑁
𝐾=0
For n=0, 1, 2, 3,…, N-1

 IDFT:
The inverse DFT of x(n) is x(k)
𝑋(𝑘) = 𝐼𝐷𝐹𝑇 {𝑘(𝑛)}
𝑁−1
1 𝑗2𝜋𝑘𝑛
𝑋(𝑘) = ∑ 𝑋(𝑛) 𝑒 𝑁
𝑁
𝑛=0
24

For k=0, 1, 2, … ,N-1

 Example(4.1)
Calculate four point DFT from aperiodic signal x[n].
2 𝑛=0
3 𝑛=1
𝑋[𝑛] = {
−1 𝑛=2
1 𝑛=3
Solution:
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
25
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
 Example(4.2)
Find the IDFT of aperiodic signal four point

5 𝑘=0
−3 𝑘=1
𝑋(𝑘) = {
3 + 2𝑗 𝑘=2
3 − 2𝑗 𝑘=3
26
Solution:
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
27

………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
 Linear Convolution:
𝑥(𝑘) ℎ(𝑘) 𝑦(𝑘)
I/P System O/P
𝑦(𝑘) = ∑ 𝑥(𝑚) ℎ(𝑘 − 𝑚) = ℎ(𝑚) 𝑥(𝑘 − 𝑚)

𝑚=0
Length of O/P = 𝑀 + 𝑁 − 1
M: is length of 𝑥(𝑘)
N: is length of ℎ(𝑘)
 Example (4.3)
For the following functions
28
𝑥(𝑘) = [1 2 3 2 1 0 − 1]
ℎ(𝑘) = [2 3 4 3 2 1]
Find the linear convolution
Solution:
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
 Cyclic Convolution
𝑁−1
𝑧(𝑘) = 𝑥 (𝑘)𝑠(𝑘) = ∑ 𝑥(𝑚)𝑠(𝑘 − 𝑚)

𝑚=0
𝑀=𝑁
 Example (4.4)
𝑥(𝑘) = [1 2 3 4]
29

𝑥(𝑘) = [5 6 7 8] Find the cyclic convolution

Solution:
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
 DFT As Matrixe
𝑁−1
−𝑗2𝜋
𝑥(𝑛) = ∑ 𝑥(𝑘)𝑊𝑁𝑘𝑛 , 𝑊𝑁 = 𝑒 𝑁
𝑘=0
 Example (4.5)
Find DFT using matrix method for 6-point (N=6)
30

Solution:
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
………………………………………………………………………………
 Properties of Discrete Fourier Transform:
1. Uniqueness:
DFT {𝑥(𝑘)} 𝑥(𝑛)
IDFT {𝑥(𝑛)} 𝑥(𝑘)
31

2. Periodicity
We can show that 𝑥(𝑛) is periodic with period N and as follows:
𝑁−1
−𝑗2𝜋𝑘𝑛
𝑥(𝑛) = ∑ 𝑥(𝑘)𝑒 𝑁
𝑘=0
𝑛 = 0, 1, 2, …
𝑛=𝑁
𝑁−1
−𝑗2𝜋𝑘𝑁
𝑥(𝑛) = ∑ 𝑥(𝑘)𝑒 𝑁
𝑘=0
𝑁−1
𝑥(𝑛) = ∑ 𝑥(𝑘)𝑒 −𝑗2𝜋𝑘

𝑘=0
𝑁−1
𝑥(𝑛) = ∑ 𝑥(𝑘) = 𝑥(0)

𝑘=0
Then:
𝑛 = 𝑛 + 𝑁 , 𝑥(𝑛 + 1) = 𝑥(1) 𝑎𝑛𝑑 𝑥(𝑛 + 𝑚) = 𝑥(𝑚)
IDFT:
𝑥(𝑁 + 0) = 𝑥(0)
𝑥(𝑁 + 1) = 𝑥(1)
𝑥(𝑁 + 𝑘) = 𝑥(𝑘)
𝑥(𝑁 + 𝑛) = 𝑥(𝑛)
 Example (4.6)
𝑥(𝑘) = [1 2 3 4] Periodic signal
Solution:
………………………………………………………………………………...
32

………………………………………………………………………………...
………………………………………………………………………………...
3. Time Reversal
𝑥(𝑘) = {𝑥(0), 𝑥(1), 𝑥(2), … }
𝑥(𝑛) = 𝐷𝐹𝑇[𝑥(𝑘)]
Then 𝐷𝐹𝑇[𝑥(−𝑘)] =
𝑥(−𝑛) = 𝑥(𝑁 − 𝑛)
𝐷𝐹𝑇[𝑥(𝑁 − 𝑘)] = 𝑥(−𝑛) = 𝑥(𝑁 − 𝑛)
 Example (4.7)
𝑥(𝑘) = [1 2 3]
4. Complex Conjugate:
𝑥 ∗ (𝑘) = 𝑁𝑥 ∗ (𝑛)
5. Cyclic shift (time shift):
−𝑗2𝜋𝑚𝑛
𝐷𝐹𝑇[𝑥(𝑘 − 𝑚)] = 𝑥(𝑛). 𝑒 𝑁
 Example (4.8)
𝑥(𝑘) = [1 2 3 4]
Find cyclic shift: 1. 𝑥(𝑘 − 1) 2. 𝑥(𝑘 + 1)
Solution:
………………………………………………………………………………...
…………………………………………………………………
33

 Introduction to Analog & Digital Filter
Definition of Filter:
………………………………………………………………………………...
………………………………………………………………………………...
In general a filter is divided into two terms:
1. Analog Filter
2. Digital Filter
 Digital Filter:
1. Infinite Impulse Response Filter (IIR)
2. Finite Impulse Response Filter (FIR)
 Analog Filter:
1. High Pass Filter (HPF)
2. Low Pass Filter (LPF)
3. Band Pass Filter (BPF)
34
4. Band Stop Filter (BSF)
 Example (5.1)
Draw the discrete realization of the given filter
𝑍 2 + 3𝑍 + 5
𝐻1 = 2
𝑍 − 5𝑍 + 7
Solution:
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
 Example (5.2)
𝑌(𝑧)
= 1 − 0.25𝑍 −1 + 0.6𝑍 −2 + 0.13𝑍 −3 + 0.7𝑍 −4 + 0.22𝑍 −5 + 0.72𝑍 −6
𝑋(𝑧)
Solution:
………………………………………………………………………………...
35
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
1. Design of Butterworth Analog Low-Pass Filters
1
|𝐻(𝑗𝑤)|2 =
𝑤 2𝑁
1+( )
𝑤 𝑐
Where
N: the order of filter
1
𝐻𝑛 (𝑠) =
𝑎𝑜 + 𝑎1 𝑆 + 𝑎2 𝑆 2 + ⋯ + 𝑎𝑁−1 𝑆𝑁−1 + 𝑆𝑁
 Example (5.3)
The transfer function of low pass Butterworth filter which 3-dB frequency of
2 KHZ and will have an attenuation of at least 15 dB at twice the cutoff
frequency
Solution:
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
36

………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
2. Design of Chebyshev Analog Low-Pass Filters
𝐾
|𝐻(𝑗𝑤)|2 =
1+∈ 𝑇𝑁2 (𝑤)
𝑇𝑁 (𝑤) = cos(𝑁 cos −1 𝑤) |𝑤| ≤ 1
𝑇𝑁 (𝑤) = cosh(𝑁 cosh−1 𝑤) |𝑤| > 1
Figure: Chebyshev low-pass filter for even and odd values of K

 Ripple in dB
𝑟 = 10log(1 +∈2 )
1⁄
∈2 = 10 10 −1
37
2
𝐾 = {1 +∈ 𝑁 − 𝑒𝑣𝑒𝑛
1 𝑁 − 𝑜𝑑𝑑
𝑘
𝐻(𝑠) =
𝑎𝑜 + 𝑎1 𝑆 + 𝑎2 𝑆 2 + ⋯ + 𝑎𝑁−1 𝑆𝑁−1 + 𝑆𝑁
𝑎𝑜
𝑁 − 𝑒𝑣𝑒𝑛
𝐾 = {√1 +∈2
𝑎𝑜 𝑁 − 𝑜𝑑𝑑
 High frequency in dB
−20𝑙𝑜𝑔 ∈ −6(𝑁 − 1) − 20𝑁𝑙𝑜𝑔𝑤
 Example (5.4)
Find a low pass Chebyshev filter which meet the following:
1. The ripple in the pass Band is 1 dB
2. The cutoff frequency is 10 KHZ
3. The dc gain level should be such that the magnitude in the pass Band
is unity.
4. at the attenuation at 100 KHZ should be at least 140 dB
Solution:
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
38
………………………………………………………………………………...
………………………………………………………………………………...
 Digital Filter Design
1. Infinite Impulse Response Method:

ℎ(𝑘) = ℎ(𝑡)|𝑡 = 𝐾𝑇 = ℎ(𝐾𝑇)
𝐻(𝑆)
𝐻(𝑍) = 𝑍[𝐻(𝑆)] = ∑ 𝑅𝑒𝑠 𝑎𝑡 𝑝𝑜𝑙𝑒𝑠
1 − 𝑒 𝑠𝑡 𝑍 −1
 Example (5.5)
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
………………………………………………………………………………...
2. finite Impulse Response Method
𝐻(𝑆) 𝑍
𝑍[ ]= 𝐻(𝑍)
𝑆 𝑍−1
𝐻(𝑆)
𝐻(𝑆) 𝑍 𝑆
𝐻(𝑍) = 𝑍 [ ]= ∑ 𝑅𝑒𝑠 𝑎𝑡 𝑝𝑜𝑙𝑒𝑠
𝑆 𝑍−1 1 − 𝑒 𝑠𝑡 𝑍 −1
39

3. Bilinear Transformation (Numerical)
2 𝑍−1
𝑆=
𝑇𝑤𝑐 𝑍 + 1
2𝑓 𝑍 − 1
𝑆=
𝑤𝑐 𝑍 + 1
TABLE: Values for the coefficients 𝑎𝑖
40

Digital Signal Processing: University of Sciences & Technology

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Digital Signal Processing: University of Sciences & Technology

Uploaded by

Copyright:

Available Formats

Digital signal processing 2018

University of sciences & Technology

Digital Signal Processing

 Tutorial Sheet No (1)

 Basic concepts in Digital Signal Processing(DSP):

 Definition _ what does (DSP) mean?

 Block diagram of analog signal processing:

 Block diagram of Digital Signal Processing:

MSc. Computer Architecture & Network By: Eng.Elyaseen Elyas 2018

1\ Unit sample (impulse):

2\Unit step sequence:

MSc. Computer Architecture & Network By: Eng.Elyaseen Elyas 2018

 Implementation operation (on several signals):

MSc. Computer Architecture & Network By: Eng.Elyaseen Elyas 2018

y(n) = x(n) ∗ h(n) = ∑ x(k)h(n − k)

MSc. Computer Architecture & Network By: Eng.Elyaseen Elyas 2018

MSc. Computer Architecture & Network By: Eng.Elyaseen Elyas 2018

MSc. Computer Architecture & Network By: Eng.Elyaseen Elyas 2018

𝒓𝑿𝒀 [n] = x(n)O𝑦(𝑛) = ∑ x(k)h(−n + k) = x(n) ∗ y(−n)

MSc. Computer Architecture & Network By: Eng.Elyaseen Elyas 2018

Block diagram representation of discrete time system:

4\ a unit delay element:

5\ a unit advance element:

MSc. Computer Architecture & Network By: Eng.Elyaseen Elyas 2018

 Tutorial Sheet No (2)

Figure (1.2): Formation of discrete time signals.

MSc. Computer Architecture & Network By: Eng.Elyaseen Elyas 2018

MSc. Computer Architecture & Network By: Eng.Elyaseen Elyas 2018

MSc. Computer Architecture & Network By: Eng.Elyaseen Elyas 2018

MSc. Computer Architecture & Network By: Eng.Elyaseen Elyas 2018

 Tutorial Sheet No (3)

When the analysis is needed in discrete format, we convert the frequency

Use the partial fraction expansion method to compute the Inverse Z

MSc. Computer Architecture & Network By: Eng.Elyaseen Elyas 2018

Use the partial fraction expansion method to compute the Inverse Z_

Use the partial fraction expansion method to compute the Inverse Z_

3. Residue or Contour integral method:

Use the Inversion Integral to compute the Inverse Z_ transform of

MSc. Computer Architecture & Network By: Eng.Elyaseen Elyas 2018

Find the response of the system 𝛿(𝑘) = 𝑆(𝑘 + 2) − 3𝑆(𝑘 + 1) + 2𝑆(𝑘),

 Tutorial Sheet No (4)

 The Discrete Fourier Transform (DFT)

Let 𝑥(𝑘) = {𝑥(0), 𝑥(1), 𝑥(2), … , 𝑥(𝑁 − 1)}

For n=0, 1, 2, 3,…, N-1

𝑋(𝑘) = 𝐼𝐷𝐹𝑇 {𝑘(𝑛)}

MSc. Computer Architecture & Network By: Eng.Elyaseen Elyas 2018

For k=0, 1, 2, … ,N-1

Find the IDFT of aperiodic signal four point

MSc. Computer Architecture & Network By: Eng.Elyaseen Elyas 2018

𝑥(𝑘) ℎ(𝑘) 𝑦(𝑘)

I/P System O/P

𝑦(𝑘) = ∑ 𝑥(𝑚) ℎ(𝑘 − 𝑚) = ℎ(𝑚) 𝑥(𝑘 − 𝑚)

𝑧(𝑘) = 𝑥 (𝑘)𝑠(𝑘) = ∑ 𝑥(𝑚)𝑠(𝑘 − 𝑚)

MSc. Computer Architecture & Network By: Eng.Elyaseen Elyas 2018

𝑥(𝑘) = [5 6 7 8] Find the cyclic convolution

MSc. Computer Architecture & Network By: Eng.Elyaseen Elyas 2018

 Properties of Discrete Fourier Transform:

MSc. Computer Architecture & Network By: Eng.Elyaseen Elyas 2018

𝑥(𝑛) = ∑ 𝑥(𝑘)𝑒 −𝑗2𝜋𝑘

𝑥(𝑛) = ∑ 𝑥(𝑘) = 𝑥(0)

MSc. Computer Architecture & Network By: Eng.Elyaseen Elyas 2018

 Tutorial Sheet No (5)

1. High Pass Filter (HPF)