0 - Lecture 2018 - DSP by Rahmad Hidayat

BAHAN AJAR
Digital Signal Processing
[Sistem Pemrosesan Sinyal]
Rahmad Hidayat
Email : rhidayat4000@gmail.com
Jurusan Teknik Elektro

SEKOLAH TINGGI TEKNOLOGI MANDALA
Jalan Soekarno Hatta 597 Bandung
SISTEM PENILAIAN
•Tugas : 20 %
• UTS : 30 %
• UAS : 40 %
• Presensi : 10 %
Selasa 17.00
Catatan : beberapa materi (suplemen) di-share melalui google drive
2
MATERI
•BAB I : Pendahuluan
•BAB II : Sinyal & Sistem Diskrit
•BAB III : Transformasi Z
•BAB IV : Filter
•BAB V : DFT-FFT
• Latihan Aplikasi DSP dengan MATLAB

•Tugas Membuat GUI MATLAB untuk beberapa aplikasi DSP
Catatan :
3
BAB I. PENDAHULUAN
LATAR BELAKANG
Pemrosesan Sinyal Analog
Prosesor Analog Sederhana
ekivalen dengan sebuah FILTER ANALOG

5
LATAR BELAKANG
Contoh Filter Analog
6
Fungsi Filter
Based on slides by Haris Balzakis
7
Sistem Pemrosesan Sinyal (DSP) dari Sinyal Analog
(Blok ekivalen dari Prosesor Analog)
8
Sistem Pemrosesan Sinyal (DSP) dari Sinyal Analog
(Blok ekivalen dari Filter Analog)
9
Analog to Digital Converter
10
Jadi untuk apa sinyal diubah ?
11
BAB II. SINYAL & SISTEM DISKRIT
Based on slides by Kenneth E. Barner, Univ.of Delaware

Tentang Sinyal
www.complextorial.com
13
Tentang Sinyal
Signals are functions of time that curry information relative to the state
and/or the behavior of a system.
Categorization:
Depending on whether they are defined for continuous time intervals or
for specific time instances:
•) Continuous time signals.
•) Discrete time signals.
Depending on the values they take:
•) Analog signals
•) Digital signals.
14
Tipe Sinyal
15
Tipe Sinyal
16
Contoh Sinyal
17
Contoh Sinyal
18
Contoh Sinyal
19
Contoh Sinyal
20
Sinyal Waktu Diskrit
21
Sinyal Diskrit
22
Sinyal Diskrit
23
See Oppenheim and Schafer , second edition pages 8-93, or first edition pages 8-79
24
See Oppenheim and Schafer , second edition pages 8-93, or first edition pages 8-79
25
26
27
Sistem Waktu Diskrit
28
Sistem Waktu Diskrit
29
Sistem Waktu Diskrit (Contoh-1)
30
Sistem Waktu Diskrit (Contoh-2)
31
Klasifikasi Sistem Waktu Diskrit
32
33
34
35
Analisis Sistem LTI (Linear Time Invariant ) Waktu Diskrit
36
Analisis Sistem LTI (Linear Time Invariant ) Waktu Diskrit
37
38
39
40
Properti Konvolusi
41
Sistem LTI - KAUSAL
42
Sistem LTI - STABIL
43
44
45
Difference Equation (Persamaan Beda)
46
Realisasi Direct Form-I
47
Realisasi Direct Form-II
48
Realisasi :
49
Persamaan Beda (Difference Equation)
50
B.A Shenoi, “Introduction to DSP and Filter Design”, John Wiley & Sons,Inc., 2006
51
BAB III. TRANSFORMASI Z
Transformasi Z
Based on slides by EECS, University of Tennessee,2010
53
Transformasi Z
54
Transformasi Z
55
Transformasi Z dari Filter FIR
56
Fungsi sistem dari Sistem LTI
57
Kelengkapan Transformasi Z
58
Transformasi Z sebagai operator
59
Konvolusi & Transformasi Z
60
Sistem Kaskade pd Transformasi Z
61
Faktorisasi Polinomial Z
62
Domain
63
Bidang Z , plot Pole-Zero
64
Signifikansi Zero dari H(z)
65
Signifikansi Zero dari H(z)
66
Filter Nulling
67
Plot pole-zero & respon frekuensi
68
Sum filter dengan running L-poin
69
Bandpass filter Kompleks
70
Bandpass filter dengan Kompleks
71
Bandpass filter dg koefisien Real
72
ROC (region of convergence)
73
74
75
Contoh-1 (Penentuan Transformasi Z)
(a) x[n] = [1, 2, 5, 7, 0, 1]
Solution: X(z) = 1 + 2z-1+ 5z-2 + 7z-3 + z-5,
ROC: entire z plane except z = 0
(b) y[n] = [1, 2, 5, 7, 0, 1]

Solution: Y(z) = z2 + 2z + 5 + 7z-1 + z-3
ROC: entire z-plane except z = 0 and z = .
(c) z[n] = [0, 0, 1, 2, 5, 7, 0, 1]

Solution: Y(z) = z-2 + 2z-3 + 5z-4 + 7z-5 + z-7,
ROC: all z except z=0
Based on slides by Dileep Kumar
76
Transformasi Z
(d) p[n] = [n]

Solution: P(z) = 1, ROC: entire z-plane.
(e) q[n] = [n – k], k > 0

Solution: Q(z) = z-k, entire z-plane except z=0.
(f) r[n] = [n+k], k > 0

Solution: R(z) = zk, ROC: entire z-plane except z = .
77
Determine the z-transform of x[n] = (1/2)nu[n]


Solution: X( z )   x[n
n 
]z n
 n  n
1  1 1 
    z n    z 
n0  2  n0  2 
2
1 1  1 
 1 z   z  .......
2 2 
1

1 1
1 z
2
ROC: |1/2 z-1| < 1, or equivalently |z| > 1/2

78
Determine the z-transform of the signal x[n] = anu[n]
Solusi :
 
  n
X( z )   a n z n   az 1
n0 n 0
 1  az 1

 az 
1 2
 .......
1

1  az 1
ROC :| z || a |
79
Invers Transformasi Z
In general, the inverse z-transform may be found by
using any of the following methods:
Power series method
Partial fraction method
80
Contoh Penentuan Invers Transformasi Z
Example 1: Determine the z-transform of
1
X( z )  1 2
1  1.5z  0.5z
With power series method and by dividing the numerator of
X(z) by its denominator, we obtain the power series
1
 1  32 z 1  74 z  2  158 z  3  16
31  4
z  ...
1  32 z 1  12 z  2
 x[n] = [1, 3/2, 7/4, 15/8, 31/16,…. ]

81
Contoh Penentuan Invers Transformasi Z
Example 2: Determine the z-transform of
1
4z
X( z )  1 2
2  2z  z
With power series method and by dividing the numerator of
X(z) by its denominator, we obtain the power series
 x[n] = [2, 1.5, 0.5, 0.25, …..]
82
LATIHAN SOAL TZ
1) Desainlah realisasi Direct Form-I dan II jika diberikan

fungsi transfer dari filter digital sbb :
Solusi :
(direct form-1)
Edmund Lai, “Practical DSP for Engineers and Technicians”, Newnes, 2003
83
LATIHAN SOAL TZ
(direct form-2)
84
LATIHAN SOAL TZ Edmund Lai, “Practical DSP for Engineers and Technicians”, Newnes, 2003
2).
85
LATIHAN SOAL TZ
3).
86
LATIHAN SOAL TZ
4).
87
LATIHAN SOAL TZ
5).
88
LATIHAN SOAL TZ
6).
89
Kondisi STABIL
90
Kondisi STABIL
91
Kondisi STABIL
John W.Leis, “DSP using Matlab for Students & Reseachers”, John Wiley & Sons, Inc., 2011
92
LATIHAN SOAL
https://sttmandalabdg.academia.edu/rahmadhidayat/
93
LATIHAN SOAL
https://sttmandalabdg.academia.edu/rahmadhidayat/
94
LATIHAN SOAL
1) Dengan Matlab, lakukan plot diagram Pole zero
rho = 0.9 ;
theta = pi/8 ;
a = [ 12*rho*cos(theta ) rho^2] ;
b = [ 12 1 ] ;
p = roots ( a )
z = roots (b)
zplane (b , a )
a2 = poly (p)
b2 = poly ( z )
Catat juga hasilnya !
95
LATIHAN SOAL
96
LATIHAN SOAL
97
LATIHAN SOAL-SOAL PERSAMAAN BEDA
(Lihat materi suplemen)
98
LATIHAN SOAL-SOAL PERSAMAAN BEDA
(Lihat materi suplemen)
99
BAB IV. FILTER
PERANCANGAN SISTEM DISKRIT
(Filter)
101
(Filter)
102
(Filter)
103
(Filter)
104
LATIHAN SOAL TZ
1) Desainlah realisasi Direct Form-I dan II jika diberikan

fungsi transfer dari filter digital sbb :
Solusi :
(direct form-1)
105
LATIHAN SOAL TZ
(direct form-2)
106
(IIR Filter)
107
(IIR Filter)
108
(IIR Filter)
109
(IIR Filter)
110
(IIR Filter)
111
(IIR Filter)
112
(IIR Filter)
113
(IIR Filter)
Gambar juga direct form-1 dan direct form-2 nya !
114
(IIR Filter)
115
(IIR Filter)
116
(IIR Filter)
117
(IIR Filter)
Cek kebenaran form kaskade : hitung 8 sampel pertama dari impuls respon
118
HASIL SIMULASI
119
BAB V. DFT- FFT
CONTOH APLIKASI
121
REFERENSI
REFERENSI
• Understanding Digital Signal Processor, R.G Lyons, Prentice

Hall, 2004.
• Digital Signal Processing – a practice guide for engineers and
scientists, SW.Smith, Newness, 2003.
• Digital Signal Processing, S.Mitra, Mc.Graw Hill,3rd Edition, 2005
123
Terimakasih !
Rahmad Hidayat
rhidayat4000@gmail.com
STT MANDALA
Copyright 2018

0 - Lecture 2018 - DSP by Rahmad Hidayat

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

0 - Lecture 2018 - DSP by Rahmad Hidayat

Uploaded by

Copyright:

Available Formats

BAHAN AJAR

Digital Signal Processing

[Sistem Pemrosesan Sinyal]

Jurusan Teknik Elektro

Catatan : beberapa materi (suplemen) di-share melalui google drive

• Latihan Aplikasi DSP dengan MATLAB

Prosesor Analog Sederhana

ekivalen dengan sebuah FILTER ANALOG

Based on slides by Haris Balzakis

(Blok ekivalen dari Prosesor Analog)

(Blok ekivalen dari Filter Analog)

Based on slides by Kenneth E. Barner, Univ.of Delaware

Based on slides by Haris Balzakis

Based on slides by Haris Balzakis

Based on slides by Haris Balzakis

Based on slides by Kenneth E. Barner, Univ.of Delaware

Based on slides by Kenneth E. Barner, Univ.of Delaware

Based on slides by Kenneth E. Barner, Univ.of Delaware

Based on slides by Kenneth E. Barner, Univ.of Delaware

Based on slides by Kenneth E. Barner, Univ.of Delaware

Based on slides by Kenneth E. Barner, Univ.of Delaware

Based on slides by Kenneth E. Barner, Univ.of Delaware

Based on slides by Kenneth E. Barner, Univ.of Delaware

Based on slides by Kenneth E. Barner, Univ.of Delaware

Based on slides by Kenneth E. Barner, Univ.of Delaware

Based on slides by Kenneth E. Barner, Univ.of Delaware

Based on slides by Kenneth E. Barner, Univ.of Delaware

Based on slides by Kenneth E. Barner, Univ.of Delaware

Based on slides by Kenneth E. Barner, Univ.of Delaware

Based on slides by Kenneth E. Barner, Univ.of Delaware

Based on slides by Kenneth E. Barner, Univ.of Delaware

Based on slides by Kenneth E. Barner, Univ.of Delaware

Based on slides by Kenneth E. Barner, Univ.of Delaware

Based on slides by Kenneth E. Barner, Univ.of Delaware

Based on slides by EECS, University of Tennessee,2010

Based on slides by EECS, University of Tennessee,2010

Based on slides by EECS, University of Tennessee,2010

Based on slides by EECS, University of Tennessee,2010

Based on slides by EECS, University of Tennessee,2010

Based on slides by EECS, University of Tennessee,2010

Based on slides by EECS, University of Tennessee,2010

Based on slides by EECS, University of Tennessee,2010

Based on slides by EECS, University of Tennessee,2010

Based on slides by EECS, University of Tennessee,2010

Based on slides by EECS, University of Tennessee,2010

Based on slides by EECS, University of Tennessee,2010

Based on slides by EECS, University of Tennessee,2010

Based on slides by EECS, University of Tennessee,2010

Based on slides by EECS, University of Tennessee,2010

Based on slides by EECS, University of Tennessee,2010

Based on slides by EECS, University of Tennessee,2010

Based on slides by EECS, University of Tennessee,2010

Based on slides by EECS, University of Tennessee,2010

Based on slides by EECS, University of Tennessee,2010

Based on slides by EECS, University of Tennessee,2010

Based on slides by EECS, University of Tennessee,2010

Based on slides by EECS, University of Tennessee,2010

(b) y[n] = [1, 2, 5, 7, 0, 1]

(c) z[n] = [0, 0, 1, 2, 5, 7, 0, 1]

(d) p[n] = [n]

(e) q[n] = [n – k], k > 0

(f) r[n] = [n+k], k > 0

Based on slides by Dileep Kumar