Catalog Data:
EE 524. Digital Signal Processing. (3-0) Cr. 3. F. S. Prereq: 321. Discrete-time systems and signals. Sampling continuous -time signals. Discrete Fourier transform and its relation to discrete Fourier series and the z-transform. Linear and circular convolution using the DFT. Design of IIR and FIR digital filters and FFT algorithms. Computational considerations. Spectral estimation. Linear prediction: Levinson recursion, lattice structure. Hilbert transform. Homomorphic signal processing. Computer algorithms and applications of digital signal processing techniques.
Textbook: Oppenheim and Schafer, Discrete-Time Signal Processing, Prentice Hall, 1989
Coordinator: J. P. Basart, Professor
Goals:
To provide an introduction to the theory and practice of processing signals using sampling and numerical techniques. This background is necessary for engineers desiring to work with scientific data processing and/or real-time digital processing of communication signals.
Prerequisites by topic:
1. Math
- Complex Variables
- Vector and Matrix Algebra
- z-Transform
2. Fourier Analysis
- Fourier Series
- Fourier Transform
3. Systems Analysis
- Laplace Transform
- Differential Equations
- Transfer Function
- Convolution Theorem
Topics:
1. Discrete time function representation
2. Fourier transform
3. Sampling system design
4. z-transform
5. Discrete Fourier transform
6. Fast Fourier transform
7. Digital filter networks
8. Digital filter design
Computer Usage:
Team projects and/or homework assignments require design and coding of simple DSP algorithms. Students may choose any computer system they desire for execution of algorithms.
Laboratory Projects:
1. Computer analysis of spectral functions
2. Computer aided design of digital filters
3. Student project (optional)
Estimated Content:
Engineering Topics: 3 credits
Design Experience: