Hans-Andrea Loeliger: Catalogue data in Spring Semester 2020
|Name||Prof. Dr. Hans-Andrea Loeliger|
Inst. f. Signal-u.Inf.verarbeitung
ETH Zürich, ETF E 101
|Telephone||+41 44 632 27 65|
|Department||Information Technology and Electrical Engineering|
|227-0085-12L||Projects & Seminars: Electronic Circuits & Signals Exploration Laboratory |
Only for Electrical Engineering and Information Technology BSc.
The course unit can only be taken once. Repeated enrollment in a later semester is not creditable.
|2 credits||1P||H.‑A. Loeliger|
|Abstract||The category of "Laboratory Courses, Projects, Seminars" includes courses and laboratories in various formats designed to impart practical knowledge and skills. Moreover, these classes encourage independent experimentation and design, allow for explorative learning and teach the methodology of project work.|
|Objective||As everyday electronic circuits have transitioned into integrated circuits, they have become increasingly difficult to examine and tinker with. As a result, students become less exposed to basic analog electronic circuits and their fundamental operating principles. At university level, bachelor classes in analog circuits and electronics provide rigorous theoretical insights but are typically focused on linearised operating behaviour.|
The goal of this lab course is for the students to enhance their understanding on how basic analog electronic circuits work, or perhaps don't work, and provide enough practical experience for the students to feel at ease using transistors, resistors, capacitances, diodes etc., to create working circuits.
For example, students create circuits that make physical quantities audible. Students are encourage to realise their own circuit ideas.
|227-0101-AAL||Discrete-Time and Statistical Signal Processing |
Enrolment ONLY for MSc students with a decree declaring this course unit as an additional admission requirement.
Any other students (e.g. incoming exchange students, doctoral students) CANNOT enrol for this course unit.
|6 credits||8R||H.‑A. Loeliger|
|Abstract||The course introduces some fundamental topics of digital signal processing with a bias towards applications in communications: discrete-time linear filters, inverse filters and equalization, DFT, discrete-time stochastic processes, elements of detection theory and estimation theory, LMMSE estimation and LMMSE filtering, LMS algorithm, Viterbi algorithm.|
|Objective||The course introduces some fundamental topics of digital signal processing with a bias towards applications in communications. The two main themes are linearity and probability. In the first part of the course, we deepen our understanding of discrete-time linear filters. In the second part of the course, we review the basics of probability theory and discrete-time stochastic processes. We then discuss some basic concepts of detection theory and estimation theory, as well as some practical methods including LMMSE estimation and LMMSE filtering, the LMS algorithm, and the Viterbi algorithm. A recurrent theme is the stable and robust "inversion" of a linear filter.|
|Content||1. Discrete-time linear systems and filters:|
state-space realizations, z-transform and spectrum,
decimation and interpolation, digital filter design,
stable realizations and robust inversion.
2. The discrete Fourier transform and its use for digital filtering.
3. The statistical perspective:
probability, random variables, discrete-time stochastic processes;
detection and estimation: MAP, ML, Bayesian MMSE, LMMSE;
Wiener filter, LMS adaptive filter, Viterbi algorithm.
|Lecture notes||Lecture Notes|
|227-0418-00L||Algebra and Error Correcting Codes||6 credits||4G||H.‑A. Loeliger|
|Abstract||The course is an introduction to error correcting codes covering both classical algebraic codes and modern iterative decoding. The course includes a self-contained introduction of the pertinent basics of "abstract" algebra.|
|Objective||The course is an introduction to error correcting codes covering both classical algebraic codes and modern iterative decoding. The course includes a self-contained introduction of the pertinent basics of "abstract" algebra.|
|Content||Error correcting codes: coding and modulation, linear codes, Hamming space codes, Euclidean space codes, trellises and Viterbi decoding, convolutional codes, factor graphs and message passing algorithms, low-density parity check codes, turbo codes, polar codes, Reed-Solomon codes.|
Algebra: groups, rings, homomorphisms, quotient groups, ideals, finite fields, vector spaces, polynomials.
|Lecture notes||Lecture Notes (english)|
|401-5680-00L||Foundations of Data Science Seminar||0 credits||P. L. Bühlmann, A. Bandeira, H. Bölcskei, J. M. Buhmann, T. Hofmann, A. Krause, A. Lapidoth, H.‑A. Loeliger, M. H. Maathuis, N. Meinshausen, G. Rätsch, C. Uhler, S. van de Geer, F. Yang|