You are on page 1of 7

CNG MN HC

---o0o--M s : 501048. Tn mn hc : X L TN HIU S. S tn ch :3 S tit : 42 Hnh thc ng gi: o Kim tra gia : 20% o Tho lun v n : 20% o Kim tra cui : 60% Hnh thc ging dy: Mn hc ny gm c l thuyt v thc hnh. V l thuyt: a s cc ni dung c ging vin trnh by. Tuy vy, c mt s mc c ging vin giao cho sinh vin bo co v tho lun c gim st ti lp. V thc hnh: Ging vin trnh by mt s bi thc hnh ti lp minh ha cho phn l thuyt. Ging vin cng c th ngh mt s bi khc sinh vin t lm ti nh, sau n bo co v tho lun ti lp di s hng dn ca ging vin. Mc tiu ca mn hc: mc c bn nht, mn hc cung cp cho sinh vin cc khi nim cn bn trong lnh vc x l tn hiu s nh: tn hiu v h thng x l tn hiu. Bnh cnh , n cng gip cho sinh vin kh nng phn loi chng. Tn hiu tng t, tn hiu s, khong tn s ca chng v mi quan h gia chng cng c cp mc ny. Cc phn k tip trong mn hc gi n ngi hc mt s cch nhn khc nhau v tn hiu v h thng nh: min thi gian, min Z v min tn s. Mi quan h gia cc min ny cng c gii thiu. Da trn vic biu din tn hiu v h thng trong tng min, mn hc trnh by mt s k thut gip ngi hc c kh nng phn tch h thng trong tng min . Mn hc c bit quan tm v vic hin thc bng phng php s. Do vy, bin i Fourier ri rc (DFT) v cc gii thut tnh ton nhanh cho n cng c trnh by. Vi cc ni dung c trong nhng phn ny, sinh vin c th d dng hin thc bng cc ngn ng lp trnh tnh ton cc mu tn s v v cc ph bin , pha cho tn hiu. C tay cc ph ny, sinh vin s d hnh dung hn v cch nhn tn hiu trong min tn s. minh ho, mn hc c km theo mt s chng trnh trong ngn ng MATLAB v gii thiu mt s th vin trong ngn ng C++ gip sinh vin thc hin cc bi tp ca mnh. chuyn dn sang phn hin thc, mn hc c gii thiu mt s cu trc hin thc phc tp nhm gii quyt cc vn : v phc tp tnh ton, v b nh v v hiu ng lng t. Cui cng, mn hc gii thiu n sinh vin mt s phng php thit k cc b lc s, cng nh cp n mt s ng dng. Cc cn b ging dy: Ts. inh c Anh V Ti liu tham kho: [1]. Tp Slides bi ging. Ts. inh c Anh V. [2]. Tp Slides bi ging. Ks. L Thnh Sch.

[3]. Digital Signal Processing: Principles, Algorithms, and Applications, 3rd. Prentice Hall. John G. Proakis, Dimitris G. Manolakis. [4]. Digital Signal Processing: A Computer-Based Approach, 2nd. McGraw-Hill. Sanjit K. Mitra. [5]. DSP Filters. PROMPT. John Lane, Jayant Datta, Brent Karley, Jay Norwood. [6]. A Simple Approach to Digital Signal Processing. WILEY-INTERSCIENCE. Craig Marven, Gillian Ewers.

DESCRIPTION OF COURSE
---o0o--Course ID : 501048 Course Name : Digital Signal Processing Credits :3 Hours : 42 Grading : o Mid Exam : 20% o Discussion and Projects : 20% o Final Exam : 60% Teaching Method: This course contains theory parts and a number of practice exercises. About theory contents: In this course, there are some contents be designed to students to talk and to discuss at the class under the supervision of the lecturers. About practice exercises: The lectures realizes some practice exercises at the class to demonstrate the theory contents. The lecturers are also able to recommend a number of exercises to students for their making at home; then, they talk and discuss the results at the class under the supervision of the lecturers. Course Goals: At the most basic level, this course provide to students some primary concepts: signal and system. Beside, It also gives to students the ability to classify the above concepts. Analog signal, digital signal, their frequency ranges and their relationship to each other are also dealt with in this level. Sections later in this course give to students some views about a signal and a system, such as: time-domain, z-domain, frequency-domain. Their relationship to each other are also introduced. Base on the representation of signals and systems in each domain, the course provides to students the ability to analyse a system in that domain. The course has a special consideration on the ability to implement a system via digital method. Therefore, Discrete Fourier Transform and Fast Fourier Transform Algorithms are also presented. With the guides in this part, students are able to use programming languages to create a program for computing DFT and drawing magnitude, phase spectrums. Having these spectrums in hands, students are able to view a signal with frequency domain in such an easy way. For demonstration, the course comes along with some programs in MATLAB and introduces some

libraries in C++ to help students doing their experiments. To approach a realization for a system, the course presents some complex structures to solve a number problems, such as: about computation complexity, about memory usage and about quantization effects. Finally, The course gives to students some methods to design digital filters, and also introduces some applications. Lecturers: Dr. Dinh Duc Anh Vu Reference Books: [1]. Slides about Digital Signal Processing. Department of Information Technology, HoChiMinh City University of Technology. Dr. Dinh Duc Anh Vu [2]. Slides about Digital Signal Processing. Department of Information Technology, HoChiMinh City University of Technology. Eng. Le Thanh Sach. [3]. Digital Signal Processing: Principles, Algorithms, and Applications, 3rd. Prentice Hall. John G. Proakis, Dimitris G. Manolakis. [4]. Digital Signal Processing: A Computer-Based Approach, 2nd. McGraw-Hill. Sanjit K. Mitra. [5]. DSP Filters. PROMPT. John Lane, Jayant Datta, Brent Karley, Jay Norwood. [6]. A Simple Approach to Digital Signal Processing. WILEY-INTERSCIENCE. Craig Marven, Gillian Ewers. Tun 1 cng chi tit: Ni dung Gii Thiu. 1.1 Tn hiu, h thng, v x l tn hiu. 1.2 Phn loi tn hiu v h thng. 1.3 Khi nim tn s trong tn hiu lin tc v ri rc thi gian. 1.4 ADC v DAC. 1.5 Tng kt v Bi tp. Tn hiu v h thng trong min thi gian. 2.1 Tn hiu ri rc thi gian: Cc tn hiu ri rc thi gian c bn. Phn loi tn hiu ri rc thi gian. Cc php ton vi tn hiu ri rc thi gian. 2.2 H thng ri rc thi gian: M t bi quan h vo-ra. M t bi s khi. Phn loi h thng ri rc thi gian. Kt ni cc h thng ri rc thi gian. 2.3 Phn tch cc h thng LTI trong min thi gian: Phn r tn hiu ri rc thi gian thnh cc xung n v. M t h LTI bi hm p ng xung n v. Ti liu [1],[2],[5] Ghi ch Ging Thuyt trnh T hc [1],[2],[3] Ging Thuyt trnh Ging

2,3

4,5

6,7,8

Tng chp v cc tnh cht. Tnh nhn qu ca h LTI trn p ng xung n v. Tnh n nh ca h LTI trn p ng xung n v. H FIR v IIR. 2.4 M hnh cc h thng ri rc thi gian bi phng trnh sai phn: H qui v khng qui. M hnh h LTI bi phng trnh sai phn tuyn tnh h s hng. Gii phng trnh sai phn tuyn tnh h s hng. Tm p ng xung n v ca h LTI. 2.5 Hin thc cc h ri rc thi gian: Cc cu trc hin thc cho h LTI. Hin thc qui v khng qui cho h FIR. 2.6 Tng quan gia cc tn hiu ri rc thi gian: Cc chui tng quan cho v t tng quan. Cc tnh cht ca chui tng quan. Tng quan gia cc chui tun hon. Tnh ton cc chui tng quan. 2.7 Tng kt v Bi tp. Tn hiu v h thng trong min Z. [1],[2],[3] 3.1 Bin i Z: 3.2 Cc tnh cht ca bin i Z. 3.3 Dng hu t ca Bin i Z: M t h thng bi Hm h thng. Poles v Zeros. Poles v tn hiu nhn qu trong min thi gian. 3.4 Bin i Z ngc: Phng php tnh tch phn. Phng php khai trin thnh chui lu tha. Phng php phn r thnh cc hu t. 3.5 Bin i Z+: 3.6 Phn tch h LTI trong min Z: p ng ca h LTI vi iu kin u bng 0. p ng ca h LTI vi iu kin u khc 0. p ng tc thi v qu . Kim tra tnh nhn qu v n nh ca cc h LTI. 3.7 Tng kt v Bi tp. Tn hiu v h thng trong min tn s. [1],[2],[3] 4.1 Phn tch tn s ca tn hiu lin tc thi gian. [5] Tn hiu lin tc tun hon. Tn hiu lin tc khng tun hon. 4.2 Phn tch tn s ca tn hiu ri rc thi gian. Tn hiu ri rc tun hon. Tn hiu ri rc khng tun hon (DTFT).

Thuyt trnh Ging T hc T hc Ging Thuyt trnh T hc Ging T hc Ging

4.3 Phn loi tn hiu trong min tn s. 4.4 L thuyt ly mu v xy dng li tn hiu. 4.5 H LTI trong min tn s. M t h LTI bi hm p ng tn s. p ng ca h vi tn hiu vo tun hon. p ng ca h vi tn hiu vo khng tun hon. Quan h gia hm p ng tn s v hm h thng. Tnh ton hm p ng tn s. Hm tng quan vo-ra. 4.6 H LTI v b lc tn s. c trng ca cc b lc l tng. Cc b lc lowpass, bandpass v highpass. B cng hng s. Cc b lc Notch. Cc b lc Comb. Cc b lc All-Pass. Cc b to dao ng hnh sin s. 4.7 H thng o. 4.8 Tng kt v Bi tp. 10,11 Bin i Fourier ri rc (DFT). 2.1 DFT. 2.2 Cc tnh cht ca DFT. 2.3 Tng chp vng. 2.4 Cc phng php lc tuyn tnh dng DFT. 2.5 Phn tch tn s ca cc tn hiu s dng DFT. 2.6 Tng kt v Bi tp. 12 Cc gii thut Bin i Fourier nhanh(FFT). 6.1 Cc gii thut FFT. Phng php tnh trc tip DFT. Phng php chia v tr. FFT c s 2. FFT c s 4. FFT tch c s. Hin thc cc gii thut FFT. 6.2 ng dng ca cc gii thut FFT. Tnh hiu qu DFT ca hai chui thc. Tnh hiu qu DFT ca chui thc 2N im. FFT trong lc tuyn tnh v tng quan. 6.3 Lc tuyn tnh trong tnh ton FFT. Gii thut Goertzel. Gii thut bin i Chirp-Z. 6.4 Hiu ng lng t trong tnh DFT. Sai s lng t trong tnh ton trc tip. Sai s lng t trong cc gii thut FFT. 6.5 Tng kt v Bi tp.

[2,Chap9]

T hc c thm Ging Thuyt trnh Ging Thuyt trnh Thuyt trnh Ging T hc

[1],[2],[5] Ging Thuyt trnh T hc [1],[2],[5] Ging Thuyt trnh Thuyt trnh T hc T hc Ging T hc

13

14

Hin thc cc h thng ri rc thi gian. 7.1 Gii thiu. 7.2 Cc cu trc cho h thng FIR. Cu trc trc tip. Cu trc Cascade. Cu trc ly mu tn s. Cu trc Lattice. 7.3 Cc cu trc cho h thng IIR. Cu trc trc tip. Cu trc o. Cu trc Cascade. Cu trc Parallel. Cu trc Lattice v Lattice-Ladder. 7.4 Phn tch khng gian trng thi. M hnh h thng bi khng gian trng thi. Gii phng trnh trng thi. Mi quan h gia m t vo-ra v m t khng gian trng thi. Phn tch khng gian trng thi trong min Z. 7.5 Phng php biu din s v sai s. 7.6 Lng t cc h s ca b lc. Phn tch nhy lng t cc h s. Lng t h s ca h FIR. 7.7 Hiu ng lm trn trong cc b lc s. 7.8 Tng kt v Bi tp. Thit k b lc s. 8.1 Gii thiu: 8.2 Thit k b lc FIR: Phng php ca s. Phng php ly mu tn s. Phng php ti u. Cc b o hm FIR. Cc b bin i Hilbert. So snh cc phng php. 8.3 Thit k b lc IIR: Phng php xp x o hm. Phng php bt bin xung. Phng php bin i tuyn tnh. c trng ca cc b lc tng t ph bin. 8.4 Bin i tn s: Bin i tn s trong min tng t. Bin i tn s trong min s. Bin i tn s ly mu. 8.5 Thit k b lc s trn phng php Least-Squares: Phng php xp x Pade. Phng php Least-Squares. B lc o dng FIR.

[1],[2],[5] Ging Thuyt trnh Ging T hc Ging Thuyt trnh T hc [1],[2], [3],[4],[5] Ging Thuyt trnh Thuyt trnh Ging Thuyt trnh Ging c Thm Ging

Thit k trong min tn s. 8.6 Cc b lc tuyn tnh ti u. 8.7 Tng kt v Bi tp.

[2,Chap11]

c Thm T hc