PristupačnostFundamentals of Signal Processing
Data is displayed for academic year: 2023./2024.
Associate Lecturers
Course Description
In this course students gain fundamental signal processing knowledge with the aim of understanding the methods and the algorithms of digital signal processing.
The following topics are covered: Signals. Classification of signals. Signal decomposition. Fourier transforms. Signal spectrum. Sampling and reconstruction. The sampling theorem. Window functions and spectral analysis. Discrete cosine transform. Systems. Classification of systems. Linear time invariant systems. The convolution sum. Laplace and Z transforms. Transfer function and frequency response. Equivalence of continuous and discrete systems. Euler and reversed Euler methods. Bilinear transform. Filtering, prediction and reconstruction of signals. Amplitude-selective filters. Filter design problem. Phase and group delay. Linear-phase systems. All-pass systems. Classification of digital filters. Computer aided design of amplitude-selective filters. Fast Fourier transform and its applications. Linear and circular convolution. Efficient computation of the convolution sum. Digital signal processor. Fixed-point arithmetic. Signal quantization.
The following topics are covered: Signals. Classification of signals. Signal decomposition. Fourier transforms. Signal spectrum. Sampling and reconstruction. The sampling theorem. Window functions and spectral analysis. Discrete cosine transform. Systems. Classification of systems. Linear time invariant systems. The convolution sum. Laplace and Z transforms. Transfer function and frequency response. Equivalence of continuous and discrete systems. Euler and reversed Euler methods. Bilinear transform. Filtering, prediction and reconstruction of signals. Amplitude-selective filters. Filter design problem. Phase and group delay. Linear-phase systems. All-pass systems. Classification of digital filters. Computer aided design of amplitude-selective filters. Fast Fourier transform and its applications. Linear and circular convolution. Efficient computation of the convolution sum. Digital signal processor. Fixed-point arithmetic. Signal quantization.
Study Programmes
University undergraduate
[FER3-EN] Computing - study
Elective Courses
(5. semester)
[FER3-EN] Electrical Engineering and Information Technology - study
Elective Courses
(5. semester)
University graduate
[FER3-EN] Data Science - profile
(1. semester)
Learning Outcomes
- Classify signaly and systems by type
- Explain the importance of signal processing in computing, electronics, control engineering and telecommunications
- State and explain the Nyquist-Shannon sampling theorem
- Analyze signals using their spectrum
- Analyze systems using theirs transfer function and frequency response
- Explain the equivalence between time continuous and time discrete systems
- Explain signal filtration
- Design a basic digital filter using a computer
- Explain what the fast Fourier transform is and list its applications
Forms of Teaching
Lectures
Lectures present theoretical concepts.
ExercisesRecitations include solving practical tasks and discussing solving procedures.
LaboratoryLaboratory exercises introduce to students how computers are used for signal processing.
Grading Method
| Continuous Assessment | Exam | |||||
|---|---|---|---|---|---|---|
| Type | Threshold | Percent of Grade | Threshold | Percent of Grade | ||
| Laboratory Exercises | 50 % | 15 % | 50 % | 15 % | ||
| Homeworks | 0 % | 5 % | 0 % | 0 % | ||
| Mid Term Exam: Written | 0 % | 30 % | 0 % | |||
| Final Exam: Written | 0 % | 30 % | ||||
| Final Exam: Oral | 20 % | |||||
| Exam: Written | 50 % | 50 % | ||||
| Exam: Oral | 35 % | |||||
Comment:
Mandatory prerequisites for oral exams are achieving at least 50% of points on midterm and final exam combined, or on the written part of a regular exam, and at least 50% on laboratory exercises.
A minimum of 4 points is required to pass the final oral exam.
A minimum of 8 points is required to pass the regular oral exam.
Week by Week Schedule
- Introduction. Signals. Classification of signals. Signal decomposition.
- Fourier transforms (DFT, DTFT, CTFT). Signal spectrum. Sampling and reconstruction. The sampling theorem.
- Window functions and spectral analysis. Discrete cosine transform (DCT-II).
- Systems. Classification of systems. Linear time invariant systems. The convolution sum.
- Laplace transform. Z transform. Transfer function and frequency response.
- Equivalence of continuous and discrete systems. Euler and reversed Euler methods. Bilinear transform.
- Signal filtering, reconstruction and prediction. Amplitude-selective filters.
- Midterm exam
- Digital filters. Filter specification. Phase and group delay.
- Classification of digital filters. Linear-phase systems. All-pass systems.
- Computer aided design of amplitude-selective linear-phase FIR filters.
- Computer aided design of amplitude-selective minimum-phase IIR filters.
- Fast Fourier transform and its applications. Linear and circular convolution. Efficient computation of the convolution sum.
- Filter realizations. Fixed-point arithmetic. Digital signal processors.
- Final exam
Literature
Paolo Prandoni, Martin Vetterli (2008.), Signal Processing for Communications, EPFL Press
Sanjit Kumar Mitra (2010.), Digital Signal Processing: A Computer Based Approach, McGraw-Hill
Alan V. Oppenheim, Ronald W. Schafer (2010.), Discrete-Time Signal Processing, Pearson
John G. Proakis, Dimitris G. Manolakis (2007.), Digital Signal Processing, Pearson
Ruye Wang (2012.), Introduction to Orthogonal Transforms, Cambridge University Press
Sophocles J. Orfanidis (1996.), Introduction to Signal Processing, Prentice Hall
For students
General
ID 223374
Winter semester
5 ECTS
L2 English Level
L1 e-Learning
45 Lectures
0 Seminar
10 Exercises
20 Laboratory exercises
0 Project laboratory
Grading System
87 Excellent
75 Very Good
64 Good
51 Sufficient