Advanced Topics in Digital Signal Processing

CLASS HOURS

Tues:? 5:30 pm  7:00 pm,? Thurs: 7:15 pm  8:45 pm
Location LT:1, 6th Floor.

OFFICE HOURS AND CONTACT INFO.

Instructor: Dr. Ali Ahmed
Office Hours: Tues, Thurs (2:00pm – 4:00pm)
Email:?ali.ahmed@itu.edu.pk

Teaching Assistant: Nasir Aziz
Office Hours: TBA
Email:?msee19004@itu.edu.pk

COURSE BASICS

Core Course
Credit Hours: 3
Batches: MSDS, MSCS, MSEE @ ITU

Programming
Five Assignemnts

PREREQUISITE

Linear algebra (e.g., solving systems of equations, least squares, matrix factorizations including SVD), basic probability (e.g., you should be comfortable with multivariate probability densities), prior course in DSP and have good MATLAB or Python programming skills.

COURSE OVERVIEW

This course is a general purpose, advanced DSP course designed to follow an introductory DSP course. The central theme of the course is the application of tools from linear algebra to problems in signal processing.

COURSE OBJECTIVES

Upon successful completion of this course, students should be able to:

I. analyze and design efficient multirate systems.
II. develop Digital Signal processor based application.
III. realize various algorithms of Digital image processing.
IV. develop critical thinking about shortcoming of the state of the art in image processing

GRADING POLICY

  • 45% Assignments
  • 5% Class participation and Creating Notes
  • 20% Final Project
  • 10% Quizzes
  • 10% Midterm Exam
  • 10% Final Exam

HONOR CODE

All cases of academic misconduct will be forwarded to the disciplinary committee. All assignments are group-based unless explicitly specified by the instructor.

COURSE OUTLINE

Topics

Introduction to signals and their applications

Signal representations in vector spaces

    • Introduction to discretizing signals using a basis: The Shannon-Nyquist sampling theorem
    • Linear vector spaces, linear independence, and basis expansions
    • Norms and inner products
    • Orthobases and the reproducing formula
    • Parseval’s theorem and the general discretization principle
    • Important bases: Fourier, discrete cosine, lapped orthogonal, splines, wavelets
    • Signal approximation in an inner product space
    • Gram-Schmidt and the QR decomposition

Linear inverse problems

  1. Introduction to linear inverse problems, examples
  2. The singular value decomposition (SVD)
  3. Least-squares solutions to inverse problems and the pseudo-inverse
  4. Stable inversion and regularization
  5. Weighted least-squares and linear estimation
  6. Least-squares with linear constraints

Matrix approximation using least-squares

  1. Low-rank approximation of matrices using the SVD
  2. Total least-squares
  3. Principal components analysis
  4. Signal and noise subspaces in array processing

Computing the solutions to least-sqaures problems

  1. Cholesky and LU decomposition
  2. Structured matrices: Toeplitz, diagonal+low rank, banded systems
  3. Large-scale systems: Steepest descent
  4. Large-scale systems: The conjugate gradient method

Low-rank updates for streaming solutions to least-squares problems

  1. Recursive least-squares
  2. The Kalman filter
  3. Adaptive filtering using LMS

COURSE NOTES

? Topics Notes / Reading Material / Comments
11th Mar?2021 The Shannon-Nyquist sampling theorem
  • Notes
16th Mar?2021 A first look at basis expansions
  • Notes
18th Mar?2021 Vector spaces, subspaces, and finite-dimensional bases
  • Notes
23rd Mar?2021 Norms and inner products
  • Notes
25th Mar?2021 Linear approximation in a Hilbert space
  • Notes
27th Mar?2021 Orthogonal bases
  • Notes
30th Mar?2021 Othogonal projections and the Gram-Schmidt algorithm
  • Notes
1st Apr?2021 Cosine transforms and image compression
  • Notes
2nd Apr?2021 Cosine transforms and image compression
  • Notes
3rd Apr?2021 Wavelets (I)
  • Notes
6th Apr?2021 Wavelets (II)
  • Notes
10th April 2021 Riesz bases
  • Notes
15th April 2021 B-splines
  • Notes
19th April 2021 Discretizing inverse problems
  • ?Notes
20th Apr?2021 Solving symmetric systems of equations
  • Notes
22th Apr 2021 The singular value decomposition
  • Notes
27th Apr 2021 Stable least-squares
  • Notes
29th Apr 2021 Total least-squares and principal component analysis
  • Notes
1st May 2021 Solving systems of equations: Matrix factorizations and structured systems
  • Notes
6th May 2021 Iterative methods for least-squares
  • Notes
6th May 2021 Streaming least-squares problems
  • Notes
6th May 2021 Kalman filtering and the LMS algorithm
  • Notes
6th May 2021 Kernel methods
  • Notes
6th May 2021 Review of Fourier transforms
  • Notes
6th May 2021 Basic matrix manipulations
  • Notes

?

TEXT BOOK

  • Text Book: Deep Learning by Ian Goodfellow?Link
  • Reference Book: Dive into Deep Learning by Aston Zhang and co?Link

RECOMMENDED READINGS

Linear algebra and function spaces

Linear Algebra and its Applications?by Strang (2006). (amazon).

Computational Science and Engineering?by Strang (2007). (amazon).

Matrix Analysis?by Horn and Johnson (2012). (amazon).

An Introduction to Hilbert Space?by Young (1988). (amazon).

Mathematics of signal processing

Mathematical Methods and Algorithms for Signal Processing?by Moon and Stirling (1999). (amazon).

Foundations of Signal Processing?by Vetterli abd Kovacevic (2014). (amazon).

Statistical Signal Processing?by Scharf (1991). (amazon).

Online resources

The Matrix Cookbook

A short, useful introduction to?matrix calculus

ASSIGNMENTS

Courtesy of mark Davenport