Compressive Sensing and Inverse Problems in Signal ProcessingModule description #40234 / Version 1
- 6 CP
- Portfolio examination
- Graded
- Winter and summer semester
- English
This module description is not valid in the current semester (Winter semester 2026/27).
| Module / Version | #40234 / #1 |
|---|---|
| Validity | WS 2015/16 – WS 2015/16 |
| Available language(s) | English |
| Credit points | 6 |
| Person responsible for the module | Jung, Peter |
| Grading | Graded |
| Exam format | Portfolio examination |
| Language(s) of instruction | English |
Affiliation
| Faculty | Fakultät IV |
|---|---|
| Institute | Institut für Telekommunikationssysteme |
| Academic chair | 34331600 FG Theoretische Grundlagen der Kommunikationstechnik |
Contact
| Office | HFT 6 |
|---|---|
| Contact person | Jung, Peter |
| E-mail address | Peter.Jung@tu-berlin.de |
| Website | http://www.commit.tu-berlin.de |
Learning outcomes
In this module the students will learn the theory of compressed sensing (CS) and sparse approximation and will become familar with certain inverse problems and CS algorithms in signal processing, mostly in the area of wireless communication and information processing. The module is formed by two courses in sequence. In the first course "Compressed Sensing" the basic theory is presented with focus on the mathematical concepts and tools. The second course "Sparse Signal Processing, Applications and Algorithms" is a seminar where in addition also students will read and work on recent papers in area beyond standard compressed sensing and present concepts in a talk (project presentation). The topics will range from non-standard algorithms to special inverse problems in signal processing (some sample topics are given below).
Content
- Basic theory of compressed including: sparse solutions to underdetermined linear equations, coherence, Welch-bounds, frames and redundancy, union of bases, nullspace property and best k-term approximation, noisy sparse estimation, the restricted isometry property (RIP), random matrices and the RIP property (stable low-dimensional embeddings), l1-minimization and algorithms (BPDN, LASSO)
- Advanced topics in compressed sensing (partially in the form seminar work and paper reading) including: Structured measurements, Graph-based constructions and special recovery/decoding algorithms, (approximate) message passing algorithms, embdedding and recovery low-dimensional/low-rank signal structures
- Advanced topics in compressed sensing (partially in the form seminar work and paper reading) including: Structured measurements, Graph-based constructions and special recovery/decoding algorithms, (approximate) message passing algorithms, embdedding and recovery low-dimensional/low-rank signal structures
Module components
Compulsory area
The following courses are mandatory for this module:
Workload and credit points
Compressed Sensing (Lecture)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Attendance time | 15 | 2 h | 30 h |
| Examination preparation | 1 | 30 h | 30 h |
| Preparation and postprocessing | 15 | 2 h | 30 h |
| 90 h | |||
Sparse Signal Processing, Applications and Algorithms (Seminar)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Attendance time | 15 | 2 h | 30 h |
| Examination preparation | 1 | 30 h | 30 h |
| Preparation and postprocessing | 15 | 2 h | 30 h |
| 90 h | |||
The workload of the module adds up to 180 hours. The module therefore comprises 6 credit points.
Description of teaching and learning methods
The module consists of (i) conventional frontal teaching in class, developing theoretical and mathematical
concepts, (ii) paper reading (homework) and presentation in class and (iii) discussion of applications and exercises in order to develop problem-solving skills and reinforce comprehension of the theory.
concepts, (ii) paper reading (homework) and presentation in class and (iii) discussion of applications and exercises in order to develop problem-solving skills and reinforce comprehension of the theory.
Requirements for participation and examination
Desirable prerequisites for participation in the courses:
Prerequisite for participation to courses are a mathematical background at the level of MS
students (mid semester) in Electrical Engineering (multivariate calculus, Fourier transforms, signals and
systems, linear algebra and notions of matrix theory, probability theory).
The course is open to students enrolled in any MSc in EE CS, Mathematics and Physics
students (mid semester) in Electrical Engineering (multivariate calculus, Fourier transforms, signals and
systems, linear algebra and notions of matrix theory, probability theory).
The course is open to students enrolled in any MSc in EE CS, Mathematics and Physics
Mandatory requirements for the module examination registration:
This module has no examination requirements.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Portfolio examination |
| Language | English |
Test elements
| Name | Points/Weight | Category | Duration/Extent |
|---|---|---|---|
| Oral examination/discussion | 50 | ||
| Project presentation | 50 |
Exam description
The final grade according to § 47 (2) AllgStuPO will be calculated according to Notenschlüssel 3 of Faculty IV.
Duration of the module
The following number of semesters is estimated for taking and completing the module: 2 semester(s).
This module can be started in the following semesters: Winter and summer semester.
Maximum number of participants
This module is not limited to a number of students.
Registration procedures
Course teaching and organization (not module examination enrollment at Examination office/Prüfungsamt) is supported by an ISIS course. Registration details are provided at the beginning of the module.
Recommended reading, lecture notes
Lecture notes
unavailable
Electronic lecture notes
unavailable
Recommended literature
- S. Foucart and H. Rauhut, "A Mathematical Introduction to Compressive Sensing"
- Y. Eldar and G. Kutyniok, "Compressed Sensing: Theory and Applications"
Assigned programs
This module is not used in any program.
Miscellaneous
Not specified