PDS 11/12 - Processamento Digital de Sinais - Digital Signal Processing

Instructor
Pedro M. Q. Aguiar
. Office 7.24, north tower, 7th floor. Office hours: door is always open but please use e-mail (aguiar at isr dot ist dot utl dot pt) to schedule appointments.

TA
Cláudia Soares. Please use e-mail (csoares at isr dot ist dot utl dot pt) to schedule appointments.

Course webpage
http://www.isr.ist.utl.pt/~aguiar/pds11-12.HTM

Description

The course deals with computer processing of discrete-time signals. It is tailored to Eng&Sc MSc students (but also attended by a few PhD candidates), in particular of Electrical and Computer Eng., Biomedical Eng., Physics, and Informatics. Students will have hands-on experience, through laboratory assignments. Course topics:

& Discrete-time signal representations (transforms) and linear systems

ü  Discrete-time signals and systems. Discrete-time signals: sequences. Discrete-time systems. Linear time-invariant (LTI) systems. Properties of LTI systems. Linear constant-coefficient difference equations. Frequency-domain representation of discrete-time signals and systems. Fourier transform. Properties of the Fourier transform.

ü  Sampling of continuous-time signals. Periodic sampling. Frequency-domain representation of sampling. Reconstruction. Discrete-time processing of continuous-time signals.

ü  The z-transform. Definition. Properties of the region of convergence. The inverse z-transform. Properties of the z-transform.

ü  The discrete Fourier transform (DFT). Representation of periodic sequences: the discrete Fourier series (DFS). Properties of the DFS. The Fourier transform of periodic signals. Sampling the Fourier transform. Fourier representation of finite-duration sequences: the DFT. Properties of the DFT. Linear filtering using the DFT.

ü  Fourier analysis of signals using the DFT. DFT analysis of sinusoidal signals. The time-dependent Fourier transform. Fourier analysis of nonstationary signals.

ü  Digital filters. Block diagram representation. Direct form I and II. Canonic forms. Flow graph representation. Transposed forms. Digital filter design techniques. Design of IIR filters from continuous-time filters. Design of FIR filters using windows.

& Statistical signal processing

ü  Random signals and parameter estimation. Estimation in signal processing. Random variables. Gaussian distribution. Random vectors. Multivariate Gaussian. Conditional probability and independency. Random processes. Gaussian random processes. White noise. Time series models. The estimation problem. Assessing estimator performance.

ü  Minimum variance unbiased (MVU) estimation. Unbiased estimators. Minimum variance criterion. Existence of MVU estimator. Finding the MVU estimator.

ü  Cramer-Rao (CR) lower bound. Estimator accuracy considerations. CR lower bound (CRLB) and its derivation. CRLB for signals in white Gaussian noise. CRLB for transformed parameters. CRLB bound for parameter vectors. The Fisher information matrix. Signal processing examples.

ü  Maximum likelihood (ML) estimators. Definition of the ML estimator (MLE). Finding the MLE. MLE for signals in white Gaussian noise and relation to LS. Properties of the MLE. MLE for transformed parameters. MLE for parameter vectors. Numerical determination of MLE. Signal processing examples.

ü  Least squares (LS). The LS approach. Linear LS. Geometrical interpretations. Weighted LS. Order-recursive LS.

ü  Bayesian estimation. Prior knowledge and estimation. Choosing a prior. The Gaussian case. Bayesian linear model. Risk functions. Minimum mean square error (MMSE) estimators. Maximum a posteriori (MAP) estimators. Linear MMSE estimation. Geometrical interpretations. Signal processing examples.

Lectures

Class meets twice a week: Tuesdays, 9:30-11:00, room EA3, and Thursdays, 11:00-12:30, room EA5. Clearing doubts meeting: Tuesdays, 11:00-12:30 and 15:30-17:00 (please send e-mail in advance).

& [OS] "Discrete-Time Signal Processing", A. Oppenheim and R. Schafer, Prentice Hall, 2nd Edition, 1999, chapters 2, 3, 4, 6, 7, 8, and 10, particularly the sections pointed out in the schedule below.

& [K] "Fundamentals of Statistical Signal Processing - Estimation Theory", S. Kay, Prentice Hall, 1993, chapters A1.2, 1, 2, 3, 7, 8, 10, 11, 12, particularly the sections pointed out in the schedule below.

Before each lecture, students should read the corresponding book sections. Good practice is at least read them after the lecture. A very important complement is to solve the problems at the end of the corresponding book chapter (some of them will be solved during the lectures). Good practice is at least solve the problems pointed out in the schedule below. Problems not included in the textbooks above, sample slides, and previous tests and exams are linked below.

·         [R] "Random signals", 2012.

·

·

·

Labs

Students should team up (teams of two) at the beginning of the semester and register for one of three available weekly lab sessions (Tuesdays, 12:30-14:00 and 14:00-15:30, and Wednesdays, 14:00-15:30). There will be 6 lab assignments. Each team of two students should deliver a lab report corresponding to each assignment, at the end of the corresponding lab session. Lab room: LSDC1 (north tower, 5th floor).