Instructor:	Stanley J. Reeves
		Office:  221 Broun
		Phone:  844-1821
		Email:  sjreeves@eng.auburn.edu
		Web:  http://www.eng.auburn.edu/~sjreeves

Class Hours: MWF 8:10 - 9:00 a.m.

Office Hours: MTWR 2:00 - 3:00 p.m.

Text: A. V. Oppenheim and R. W. Schafer, Discrete-Time Signal Processing, 2nd ed., Prentice-Hall, 1999.

Web Info Site: http://www.eng.auburn.edu/~sjreeves/Classes/EE547/
This will be used for several things:

• electronic presentation of computer assignments
• syllabus
• miscellaneous related info

Reference for computer exercises: Kermit Sigmon, Matlab Primer, 3rd edition, 1993. Note: An online version can be found on the Engineering Sun Network under the EE 547 Web Info Site. The primer is 39 pages. Other online help is also available through this site.
Don't ask me Matlab questions until you have read the online info provided.

Prerequisites by Topic:

1. Frequency response of linear systems.
2. Laplace and Fourier Transforms.
3. Digital communication systems.

Course Objective:

This course provides an introduction to the theory and application of digital signal processing. Upon completion of the course, the student should have a solid foundation in basic digital signal processing. The objectives of the course will be:

1. To develop methods for processing discrete-time signals. These signals include waveforms that originate as discrete-time signals as well as those that originate from sampling continuous-time signals.
2. To understand the processes of analog-to-digital and digital-to-analog conversion.
3. To understand the discrete Fourier transform and fast Fourier transform.
4. To become aware of some applications of digital signal processing.

Teaching Philosophy: A statement of my teaching philosophy can be found on the web in
http://www.eng.auburn.edu/~sjreeves.

Grading Policy:

    Test:           20%
    Quizzes:        20%
    Computer assignments:   30%
    Final Exam:     30%

Homework

Homework will be assigned regularly. It will not be graded. Solutions will be handed out or worked in class.

Quizzes

Ten-minute quizzes will be given at the end of class periodically (approximately every two weeks). The quizzes will be based closely on the homework problems. Quizzes will be announced ahead of time.

Computer Assignments

Computer assignments will count 30% of the final grade and will be a major part of the learning process for this class. These assignments will consist of projects to illustrate and explore various signal processing concepts. All out-of-class work is to be done independently. Sharing of programming tips and discussing general concepts is ok. Collaborating on experiments or code-writing is not. Any such collaboration on these assignments will be considered an act of dishonesty and will be treated accordingly.

Test Date: November 1

Final Exam Date/Time: Thursday, December 9, 11:00-1:30

Students with Disabilities

Students who need special accommodations are encouraged to see me after class or in my office as soon as possible so we can discuss your situation confidentially. You can contact me by phone or email if my office hours conflict with your schedule. Please bring your memo from The Program for Students with Disabilities (PSD) to me as soon as possible; we can discuss it during your appointment. {\bf Exam accommodations must be arranged at least one week in advance.} If at any time during the quarter you feel that the accommodations we have put in place are not working, please consult with me and/or the professional staff in the PSD office. If you do not have a memo from the PSD office that tells me about your accommodations, please make an appointment to see them in 1232 Haley Center (844-2096). \\

Other References: S. K. Mitra, Digital Signal Processing: A Computer-Based Approach, McGraw-Hill, 1998.

Topical Outline

1. Introduction
   1. Overview of digital signal processing
   2. Linear, time-invariant systems
   3. Properties of discrete-time systems
   4. Sampling theorem
2. Z-transform
   1. Properties of the z-transform
   2. System functions
   3. Poles and zeros
3. Discrete Fourier Transforms and Fast Fourier Transforms
4. Applications (if time)