Instructor
Luca Lucchese, 3005 Kelley Engineering Center, Phone: 737-2980, e-mail: luca@eecs.orst.edu
Teaching
Assistant
Diana Delgado (e-mail: delgaddi@eecs.oregonstate.edu)
Course Description
This is an introductory course on
Digital Signal Processing (DSP) which provides an overview of relevant topics
in the analysis and design of systems for processing discrete-time (DT) signals.
Among the topics that will be covered: fundamental properties of DT - LTI systems,
frequency domain analysis of DT signals with the Discrete-Time Fourier Transform
(DTFT), the Discrete Fourier Transform (DFT) and the z-Transform, frequency
response and transfer fucntion of DT- LTI systems, signal sampling and reconstruction,
digital processing of continuous-time signals, FIR and IIR digital filter design,
filter structures.
Prerequisites
This course requires a sound knowledge of signals and systems (ECE 351 and
ECE 352 or equivalent courses). Assignments require the use of Matlab; familiarity
with such package is highly recommended.
Textbook
S.K.
Mitra, Digital Signal Processing -- A Computer-Based Approach, Third
Edition, McGraw-Hill, 2005.
Course Program
- Discrete-Time Signals and Systems
- Discrete-Time Signals (2.1)
- Typical Sequences and Sequence Representation (2.2)
- The Sampling Process (2.3)
- Discrete-Time Systems (2.4)
- Time-Domain Characterization of LTI Discrete-Time Systems (2.5)
- Finite-Dimensional LTI Discrete-Time Systems (2.7)
- Correlation of Signals (2.9)
- Discrete-Time Fourier Transform
- The Discrete-Time Fourier Transform (3.2)
- Discrete-Time Fourier Transform Theorems (3.3)
- The Frequency Response of an LTI Discrete-Time System (3.8)
- Digital Processing of Continuous-Time Signals
- Sampling of Continuous-Time Signals (4.2)
- Analog Lowpass Filter Design (4.4)
- Finite-Length Discrete Transforms
- The Discrete Fourier Transform (5.2)
- Relation between the DTFT and the DFT, and Their Inverses (5.3)
- Operations on Finite-Length Sequences (5.4)
- Discrete Fourier Transform Theorems (5.7)
- Linear Convolution Using the DFT (5.10)
-
z-Transform
- Definition and Properties (6.1)
- Rational z-Transforms (6.2)
- Region of Convergence of a Rational z-Transform (6.3)
- The Inverse z-Transform (6.4)
- z-Transform Properties (6.5)
- Computation of the Convolution Sum of Finite-Length Sequences (6.6)
- The Transfer Function (6.7)
- LTI Discrete-Time Systems in the Transform Domain
- Transfer Function Classification Based on Magnitude Characteristics (7.1)
- Transfer Function Classification Based on Phase Characteristics (7.2)
- Types of Linear-Phase Transfer Functions (7.3)
- Simple Digital Filters (7.4)
- Algebraic Stability Test (7.9)
- Digital Filter Structures
- Block Diagram Representation (8.1)
- Equivalent Structures (8.2)
- Basic FIR Digital Filter Structures (8.3)
- Basic IIR Digital Filter Structures (8.4)
- Realization of Basic Structures Using Matlab (8.5)
- IIR Digital Filter Design
- Preliminary Considerations (9.1)
- Bilinear Transformation Method of IIR Filter Design (9.2)
- Design of Lowpass IIR Digital Filters (9.3)
- FIR Digital Filter Design
- Preliminary Considerations (10.1)
- FIR Filter Design Based on Windowed Fourier Series (10.2)
- Digital Filter Design Using Matlab (10.5)
Reference
- A.V. Oppenheim
and R.W. Shafer, Discrete-Time Signal Processing, Prentice Hall,
Englewood Cliffs, NJ, 1989.
- J.G. Proakis
and D.G. Manolakis, Digital Signal Processing: Principles, Algorithms,
and Applications, Prentice Hall, Englewood Cliffs, NJ, 2nd Ed., 1992.
Lecture Notes
The PDF/PowerPoint lecture notes will be e-mailed to the students enrolled in the class.
Cauchy's Residue Theorem
Demos
(from CD-ROM of DSP First - A Multimedia Approach by J.H. McClellan, R.W. Shafer, and M.A. Yoder, Prentice- Hall, 1998)
- From transfer function to frequency response: Part1, Part2.
- FIR demos: D1, D2, D3, D4.
- IIR demos: D1, D2, D3, D4, D5, D6, D7.
Grading Policy
Office Hours
Mondays and Wednesdays, 2:30-4:00 pm.
Exams
- Midterm Exam: Feb. 19, 4:00-5:50 pm
- Final Exam: Mar. 18, 6:00-8:00 pm
Useful Links
Homework
| HW # |
Problem Set |
Due Date |
Solutions |
1 |
2.15, 2.18, 2.24, 2.25, 2.30 (d) and (e), 2.34, 2.36, M 2.8 |
Jan. 24 |
|
2 |
2.84, 2.90, 2.92, 3.13, 3.17, 3.19 (a), 3.23 (b), 3.25 |
Jan. 31 |
|
3 |
3.38, 5.29, 5.35, 5.45 (a) and (b), 6.3, 6.8 |
Feb. 7 |
|
4 |
6.20 (a), 6.25 (b), 6.26, 6.40 (a) and (b), 6.41 (a) |
Feb. 12 |
|
5 |
3.64, 3.67, 3.72, 3.79 (b) and (c), 3.83, 7.8 (a), 7.11 |
Feb. 21 |
|
6 |
7.19, 7.25, 7.44, 7.55, 7.68 7.70, M7.7, M7.8 |
Mar. 4 |
|
7 |
4.23, 4.25, 9.25, 9.27, M9.1, 10.17, M10.10 |
Mar. 13 |
|
| |
|
|
|
Homework is due back in class on the due date before the lecture.
Example 9.6 , Example 9.7
Announcements
- No announcements at this time.