# Search result: Catalogue data in Autumn Semester 2020

Electrical Engineering and Information Technology Master | ||||||

Master Studies (Programme Regulations 2018) | ||||||

Communication The core courses and specialisation courses below are a selection for students who wish to specialise in the area of "Communication", see Link. The individual study plan is subject to the tutor's approval. | ||||||

Core Courses These core courses are particularly recommended for the field of "Communication". You may choose core courses form other fields in agreement with your tutor. A minimum of 24 credits must be obtained from core courses during the MSc EEIT. | ||||||

Foundation Core Courses Fundamentals at bachelor level, for master students who need to strengthen or refresh their background in the area. | ||||||

Number | Title | Type | ECTS | Hours | Lecturers | |
---|---|---|---|---|---|---|

227-0121-00L | Communication Systems | W | 6 credits | 2V + 2U | A. Wittneben | |

Abstract | Information Theory, Signal Space Analysis, Baseband Transmission, Passband Transmission, Example und Channel, Data Link Layer, MAC, Example Layer 2, Layer 3, Internet | |||||

Objective | Introduction into the fundamentals of digital communication systems. Selected examples on the application of the fundamental principles in existing and upcoming communication systems | |||||

Content | Covered are the lower three layer of the OSI reference model: the physical, the data link, and the network layer. The basic terms of information theory are introduced. After this, we focus on the methods for the point to point communication, which may be addressed elegantly and coherently in the signal space. Methods for error detection and correction as well as protocols for the retransmission of perturbed data will be covered. Also the medium access for systems with shared medium will be discussed. Finally, algorithms for routing and flow control will be treated. The application of the basic methods will be extensively explained using existing and future wireless and wired systems. | |||||

Lecture notes | Lecture Slides | |||||

Literature | [1] Simon Haykin, Communication Systems, 4. Auflage, John Wiley & Sons, 2001 [2] Andrew S. Tanenbaum, Computernetzwerke, 3. Auflage, Pearson Studium, 2003 [3] M. Bossert und M. Breitbach, Digitale Netze, 1. Auflage, Teubner, 1999 | |||||

227-0101-00L | Discrete-Time and Statistical Signal Processing | W | 6 credits | 4G | 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 throughout the course 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 | |||||

Advanced Core Courses Advanced core courses bring students to gain in-depth knowledge of the chosen specialization. They are MSc level only. | ||||||

Number | Title | Type | ECTS | Hours | Lecturers | |

227-0301-00L | Optical Communication Fundamentals | W | 6 credits | 2V + 1U + 1P | J. Leuthold | |

Abstract | The path of an analog signal in the transmitter to the digital world in a communication link and back to the analog world at the receiver is discussed. The lecture covers the fundamentals of all important optical and optoelectronic components in a fiber communication system. This includes the transmitter, the fiber channel and the receiver with the electronic digital signal processing elements. | |||||

Objective | An in-depth understanding on how information is transmitted from source to destination. Also the mathematical framework to describe the important elements will be passed on. Students attending the lecture will further get engaged in critical discussion on societal, economical and environmental aspects related to the on-going exponential growth in the field of communications. | |||||

Content | * Chapter 1: Introduction: Analog/Digital conversion, The communication channel, Shannon channel capacity, Capacity requirements. * Chapter 2: The Transmitter: Components of a transmitter, Lasers, The spectrum of a signal, Optical modulators, Modulation formats. * Chapter 3: The Optical Fiber Channel: Geometrical optics, The wave equations in a fiber, Fiber modes, Fiber propagation, Fiber losses, Nonlinear effects in a fiber. * Chapter 4: The Receiver: Photodiodes, Receiver noise, Detector schemes (direct detection, coherent detection), Bit-error ratios and error estimations. * Chapter 5: Digital Signal Processing Techniques: Digital signal processing in a coherent receiver, Error detection teqchniques, Error correction coding. * Chapter 6: Pulse Shaping and Multiplexing Techniques: WDM/FDM, TDM, OFDM, Nyquist Multiplexing, OCDMA. * Chapter 7: Optical Amplifiers : Semiconductor Optical Amplifiers, Erbium Doped Fiber Amplifiers, Raman Amplifiers. | |||||

Lecture notes | Lecture notes are handed out. | |||||

Literature | Govind P. Agrawal; "Fiber-Optic Communication Systems"; Wiley, 2010 | |||||

Prerequisites / Notice | Fundamentals of Electromagnetic Fields & Bachelor Lectures on Physics. | |||||

227-0417-00L | Information Theory I | W | 6 credits | 4G | A. Lapidoth | |

Abstract | This course covers the basic concepts of information theory and of communication theory. Topics covered include the entropy rate of a source, mutual information, typical sequences, the asymptotic equi-partition property, Huffman coding, channel capacity, the channel coding theorem, the source-channel separation theorem, and feedback capacity. | |||||

Objective | The fundamentals of Information Theory including Shannon's source coding and channel coding theorems | |||||

Content | The entropy rate of a source, Typical sequences, the asymptotic equi-partition property, the source coding theorem, Huffman coding, Arithmetic coding, channel capacity, the channel coding theorem, the source-channel separation theorem, feedback capacity | |||||

Literature | T.M. Cover and J. Thomas, Elements of Information Theory (second edition) | |||||

227-0427-00L | Signal Analysis, Models, and Machine LearningDoes not take place this semester. This course has been replaced by "Introduction to Estimation and Machine Learning" (autumn semester) and "Advanced Signal Analysis, Modeling, and Machine Learning" (spring semester). | W | 6 credits | 4G | H.‑A. Loeliger | |

Abstract | Mathematical methods in signal processing and machine learning. I. Linear signal representation and approximation: Hilbert spaces, LMMSE estimation, regularization and sparsity. II. Learning linear and nonlinear functions and filters: neural networks, kernel methods. III. Structured statistical models: hidden Markov models, factor graphs, Kalman filter, Gaussian models with sparse events. | |||||

Objective | The course is an introduction to some basic topics in signal processing and machine learning. | |||||

Content | Part I - Linear Signal Representation and Approximation: Hilbert spaces, least squares and LMMSE estimation, projection and estimation by linear filtering, learning linear functions and filters, L2 regularization, L1 regularization and sparsity, singular-value decomposition and pseudo-inverse, principal-components analysis. Part II - Learning Nonlinear Functions: fundamentals of learning, neural networks, kernel methods. Part III - Structured Statistical Models and Message Passing Algorithms: hidden Markov models, factor graphs, Gaussian message passing, Kalman filter and recursive least squares, Monte Carlo methods, parameter estimation, expectation maximization, linear Gaussian models with sparse events. | |||||

Lecture notes | Lecture notes. | |||||

Prerequisites / Notice | Prerequisites: - local bachelors: course "Discrete-Time and Statistical Signal Processing" (5. Sem.) - others: solid basics in linear algebra and probability theory | |||||

227-0439-00L | Wireless Access Systems | W | 6 credits | 2V + 2U | A. Wittneben | |

Abstract | The lecture course covers current and upcoming wireless systems for data communication and localization in diverse applications. Important topics are broadband data networks, indoor localization, internet-of-things, biomedical sensor networks and smart grid communications. The course consists of two tracks, the lecture part “Technology & Systems” and the group exercise part “Simulate & Practice”. | |||||

Objective | General learning goals of the course: By the end of this course, students will be able to - understand and illustrate the physical layer and MAC layer limits and challenges of wireless systems with emphasis on data communication and localization - understand and explain the functioning of the most widely used wireless systems - model and simulate the physical layer of state-of-the-art wireless systems - explain challenges and solutions of indoor localization - understand research challenges of future wireless networks Specific learning goals include: - Understanding the principles of OFDM and analyzing its performance on the physical layer - Understanding and evaluating the challenges regarding current applications of wireless networks, e.g. for the internet-of-things, smart grid communication, biomedical sensor communication - Illustrating the characteristics of the wireless channel - Simulation of localization and user tracking based on wireless systems - Explaining the basics of smart grid communications approaches (including narrowband PLC, G3-PLC) | |||||

Content | - Introduction - Wireless communication: fundamental Physical layer and MAC layer limits and challenges - Basics of OFDM - Wireless systems: WiFi / WLAN - Wireless systems: Bluetooth, RFID (Radio Frequency Identification) and NFC (Near Field Communication) - Indoor localization based on wireless systems - Internet-of-things: Challenges and solutions regarding wireless data communication and localization - Smart grid communications - Biomedical sensor communication - Next generation designs (glimpse on current research topics) The goal of the course is to explain and analyze modern and future wireless systems for data communication and localization. The course covers designs for generic applications (e.g. WiFi, Bluetooth) as well as systems optimized for specific applications (e.g. biomedical sensor networks, smart grid communications). The course consists of two parallel tracks. The track "Technology&Systems" is structured as regular lecture. In the introduction, we discuss the challenges and potential of wireless access and study some fundamental limits of wireless communications and localization approaches. The second part of this track is devoted to the most widely used wireless systems, WiFi/WLAN, Bluetooth, RFID, NFC. Furthermore, we study the potential of using existing wireless communication systems for indoor localization. The third part follows with an introduction to the internet-of-things, where we focus on data communication and localization challenges and solutions in wireless networks with a massive number of nodes. Next, we study communication technologies for the smart grid, which combine wireless as well as power line communication approaches to optimize availability and efficiency. The track is completed by a comprehensive survey of short-range magneto-inductive micro sensor networks for communication and localization - as a promising technology for biomedical sensor communication (in-body, out-of-body). In the track "Simulate&Practice" we form student teams to simulate and analyze functional blocks of the physical layer of advanced wireless systems (based on MATLAB simulations). The track includes combination tasks in which different teams combine their functional blocks (e.g. transmitter, receiver) in order to simulate the complete physical layer of a wireless system. The focus is on data communication and localization. The tasks include modeling and simulating of single-carrier systems (as, e.g., used in Bluetooth), multi-carrier OFDM systems (e.g. used in WiFi or power line communication), and indoor localization approaches (e.g. relevant for IoT and sensor networks). | |||||

Lecture notes | Lecture slides are available. | |||||

Literature | Will be announced in the lecture. | |||||

Prerequisites / Notice | English | |||||

Specialisation Courses These specialisation courses are particularly recommended for the area of "Communication", but you are free to choose courses from any other field in agreement with your tutor. A minimum of 40 credits must be obtained from specialisation courses during the Master's Programme. | ||||||

Number | Title | Type | ECTS | Hours | Lecturers | |

227-0102-00L | Discrete Event Systems | W | 6 credits | 4G | L. Thiele, L. Vanbever, R. Wattenhofer | |

Abstract | Introduction to discrete event systems. We start out by studying popular models of discrete event systems. In the second part of the course we analyze discrete event systems from an average-case and from a worst-case perspective. Topics include: Automata and Languages, Specification Models, Stochastic Discrete Event Systems, Worst-Case Event Systems, Verification, Network Calculus. | |||||

Objective | Over the past few decades the rapid evolution of computing, communication, and information technologies has brought about the proliferation of new dynamic systems. A significant part of activity in these systems is governed by operational rules designed by humans. The dynamics of these systems are characterized by asynchronous occurrences of discrete events, some controlled (e.g. hitting a keyboard key, sending a message), some not (e.g. spontaneous failure, packet loss). The mathematical arsenal centered around differential equations that has been employed in systems engineering to model and study processes governed by the laws of nature is often inadequate or inappropriate for discrete event systems. The challenge is to develop new modeling frameworks, analysis techniques, design tools, testing methods, and optimization processes for this new generation of systems. In this lecture we give an introduction to discrete event systems. We start out the course by studying popular models of discrete event systems, such as automata and Petri nets. In the second part of the course we analyze discrete event systems. We first examine discrete event systems from an average-case perspective: we model discrete events as stochastic processes, and then apply Markov chains and queuing theory for an understanding of the typical behavior of a system. In the last part of the course we analyze discrete event systems from a worst-case perspective using the theory of online algorithms and adversarial queuing. | |||||

Content | 1. Introduction 2. Automata and Languages 3. Smarter Automata 4. Specification Models 5. Stochastic Discrete Event Systems 6. Worst-Case Event Systems 7. Network Calculus | |||||

Lecture notes | Available | |||||

Literature | [bertsekas] Data Networks Dimitri Bersekas, Robert Gallager Prentice Hall, 1991, ISBN: 0132009161 [borodin] Online Computation and Competitive Analysis Allan Borodin, Ran El-Yaniv. Cambridge University Press, 1998 [boudec] Network Calculus J.-Y. Le Boudec, P. Thiran Springer, 2001 [cassandras] Introduction to Discrete Event Systems Christos Cassandras, Stéphane Lafortune. Kluwer Academic Publishers, 1999, ISBN 0-7923-8609-4 [fiat] Online Algorithms: The State of the Art A. Fiat and G. Woeginger [hochbaum] Approximation Algorithms for NP-hard Problems (Chapter 13 by S. Irani, A. Karlin) D. Hochbaum [schickinger] Diskrete Strukturen (Band 2: Wahrscheinlichkeitstheorie und Statistik) T. Schickinger, A. Steger Springer, Berlin, 2001 [sipser] Introduction to the Theory of Computation Michael Sipser. PWS Publishing Company, 1996, ISBN 053494728X | |||||

227-0103-00L | Control Systems | W | 6 credits | 2V + 2U | F. Dörfler | |

Abstract | Study of concepts and methods for the mathematical description and analysis of dynamical systems. The concept of feedback. Design of control systems for single input - single output and multivariable systems. | |||||

Objective | Study of concepts and methods for the mathematical description and analysis of dynamical systems. The concept of feedback. Design of control systems for single input - single output and multivariable systems. | |||||

Content | Process automation, concept of control. Modelling of dynamical systems - examples, state space description, linearisation, analytical/numerical solution. Laplace transform, system response for first and second order systems - effect of additional poles and zeros. Closed-loop control - idea of feedback. PID control, Ziegler - Nichols tuning. Stability, Routh-Hurwitz criterion, root locus, frequency response, Bode diagram, Bode gain/phase relationship, controller design via "loop shaping", Nyquist criterion. Feedforward compensation, cascade control. Multivariable systems (transfer matrix, state space representation), multi-loop control, problem of coupling, Relative Gain Array, decoupling, sensitivity to model uncertainty. State space representation (modal description, controllability, control canonical form, observer canonical form), state feedback, pole placement - choice of poles. Observer, observability, duality, separation principle. LQ Regulator, optimal state estimation. | |||||

Literature | K. J. Aström & R. Murray. Feedback Systems: An Introduction for Scientists and Engineers. Princeton University Press, 2010. R. C. Dorf and R. H. Bishop. Modern Control Systems. Prentice Hall, New Jersey, 2007. G. F. Franklin, J. D. Powell, and A. Emami-Naeini. Feedback Control of Dynamic Systems. Addison-Wesley, 2010. J. Lunze. Regelungstechnik 1. Springer, Berlin, 2014. J. Lunze. Regelungstechnik 2. Springer, Berlin, 2014. | |||||

Prerequisites / Notice | Prerequisites: Signal and Systems Theory II. MATLAB is used for system analysis and simulation. | |||||

227-0112-00L | High-Speed Signal Propagation Does not take place this semester. | W | 6 credits | 2V + 2U | C. Bolognesi | |

Abstract | Understanding of high-speed signal propagation in microwave cables and integrated circuits and printed circuit boards. As clock frequencies rise in the GHz domain, there is a need grasp signal propagation to maintain good signal integrity in the face of symbol interference and cross-talk. The course is of high value to all interested in high-speed analog (RF, microwave) or digital systems. | |||||

Objective | Understanding of high-speed signal propagation in interconnects, microwave cables and integrated transmission lines such as microwave integrated circuits and/or printed circuit boards. As system clock frequencies continuously rise in the GHz domain, a need urgently develops to understand high-speed signal propagation in order to maintain good signal integrity in the face of phenomena such as inter-symbol interference (ISI) and cross-talk. Concepts such as Scattering parameters (or S-parameters) are key to the characterization of networks over wide bandwidths. At high frequencies, all structures effectively become "transmission lines." Unless care is taken, it is highly probable that one ends-up with a bad transmission line that causes the designed system to malfunction. Filters will also be considered because it turns out that some of the problems associated by lossy transmission channels (lines, cables, etc) can be corrected by adequate filtering in a process called "equalization." | |||||

Content | Transmission line equations of the lossless and lossy TEM-transmission line. Introduction of current and voltage waves. Representation of reflections in the time and frequency domain. Application of the Smith chart. Behavior of low-loss transmission lines. Attenuation and impulse distortion due to skin effect. Transmission line equivalent circuits. Group delay and signal dispersion. Coupled transmission lines. Scattering parameters. Butterworth-, Chebychev- and Bessel filter approximations: filter synthesis from low-pass filter prototypes. | |||||

Lecture notes | Script: Leitungen und Filter (In German). | |||||

Prerequisites / Notice | Exercises will be held in English. | |||||

227-0116-00L | VLSI I: From Architectures to VLSI Circuits and FPGAs | W | 6 credits | 5G | F. K. Gürkaynak, L. Benini | |

Abstract | This first course in a series that extends over three consecutive terms is concerned with tailoring algorithms and with devising high performance hardware architectures for their implementation as ASIC or with FPGAs. The focus is on front end design using HDLs and automatic synthesis for producing industrial-quality circuits. | |||||

Objective | Understand Very-Large-Scale Integrated Circuits (VLSI chips), Application-Specific Integrated Circuits (ASIC), and Field-Programmable Gate-Arrays (FPGA). Know their organization and be able to identify suitable application areas. Become fluent in front-end design from architectural conception to gate-level netlists. How to model digital circuits with SystemVerilog. How to ensure they behave as expected with the aid of simulation, testbenches, and assertions. How to take advantage of automatic synthesis tools to produce industrial-quality VLSI and FPGA circuits. Gain practical experience with the hardware description language SystemVerilog and with industrial Electronic Design Automation (EDA) tools. | |||||

Content | This course is concerned with system-level issues of VLSI design and FPGA implementations. Topics include: - Overview on design methodologies and fabrication depths. - Levels of abstraction for circuit modeling. - Organization and configuration of commercial field-programmable components. - FPGA design flows. - Dedicated and general purpose architectures compared. - How to obtain an architecture for a given processing algorithm. - Meeting throughput, area, and power goals by way of architectural transformations. - Hardware Description Languages (HDL) and the underlying concepts. - SystemVerilog - Register Transfer Level (RTL) synthesis and its limitations. - Building blocks of digital VLSI circuits. - Functional verification techniques and their limitations. - Modular and largely reusable testbenches. - Assertion-based verification. - Synchronous versus asynchronous circuits. - The case for synchronous circuits. - Periodic events and the Anceau diagram. - Case studies, ASICs compared to microprocessors, DSPs, and FPGAs. During the exercises, students learn how to model FPGAs with SystemVerilog. They write testbenches for simulation purposes and synthesize gate-level netlists for FPGAs. Commercial EDA software by leading vendors is being used throughout. | |||||

Lecture notes | Textbook and all further documents in English. | |||||

Literature | H. Kaeslin: "Top-Down Digital VLSI Design, from Architectures to Gate-Level Circuits and FPGAs", Elsevier, 2014, ISBN 9780128007303. | |||||

Prerequisites / Notice | Prerequisites: Basics of digital circuits. Examination: In written form following the course semester (spring term). Problems are given in English, answers will be accepted in either English oder German. Further details: Link | |||||

227-0148-00L | VLSI III: Test and Fabrication of VLSI Circuits | W | 6 credits | 4G | F. K. Gürkaynak, L. Benini | |

Abstract | In this course, we will cover how modern microchips are fabricated, and we will focus on methods and tools to uncover fabrication defects, if any, in these microchips. As part of the exercises, students will get to work on an industrial 1 million dollar automated test equipment. | |||||

Objective | Learn about modern IC manufacturing methodologies, understand the problem of IC testing. Cover the basic methods, algorithms and techniques to test circuits in an efficient way. Learn about practical aspects of IC testing and apply what you learn in class using a state-of-the art tester. | |||||

Content | In this course we will deal with modern integrated circuit (IC) manufacturing technology and cover topics such as: - Today's nanometer CMOS fabrication processes (HKMG). - Optical and post optical Photolithography. - Potential alternatives to CMOS technology and MOSFET devices. - Evolution paths for design methodology. - Industrial roadmaps for the future evolution of semiconductor technology (ITRS). If you want to earn money by selling ICs, you will have to deliver a product that will function properly with a very large probability. The main emphasis of the lecture will be discussing how this can be achieved. We will discuss fault models and practical techniques to improve testability of VLSI circuits. At the IIS we have a state-of-the-art automated test equipment (Advantest SoC V93000) that we will make available for in class exercises and projects. At the end of the lecture you will be able to design state-of-the art digital integrated circuits such as to make them testable and to use automatic test equipment (ATE) to carry out the actual testing. During the first weeks of the course there will be weekly practical exercises where you will work in groups of two. For the last 5 weeks of the class students will be able to choose a class project that can be: - The test of their own chip developed during a previous semester thesis - Developing new setups and measurement methods in C++ on the tester - Helping to debug problems encountered in previous microchips by IIS. Half of the oral exam will consist of a short presentation on this class project. | |||||

Lecture notes | Main course book: "Essentials of Electronic Testing for Digital, Memory and Mixed-Signal VLSI Circuits" by Michael L. Bushnell and Vishwani D. Agrawal, Springer, 2004. This book is available online within ETH through Link | |||||

Prerequisites / Notice | Although this is the third part in a series of lectures on VLSI design, you can follow this course even if you have not visited VLSI I and VLSI II lectures. An interest in integrated circuit design, and basic digital circuit knowledge is required though. Course website: Link | |||||

227-0166-00L | Analog Integrated Circuits | W | 6 credits | 2V + 2U | T. Jang | |

Abstract | This course provides a foundation in analog integrated circuit design based on bipolar and CMOS technologies. | |||||

Objective | Integrated circuits are responsible for much of the progress in electronics in the last 50 years, particularly the revolutions in the Information and Communications Technologies we witnessed in recent years. Analog integrated circuits play a crucial part in the highly integrated systems that power the popular electronic devices we use daily. Understanding their design is beneficial to both future designers and users of such systems. The basic elements, design issues and techniques for analog integrated circuits will be taught in this course. | |||||

Content | Review of bipolar and MOS devices and their small-signal equivalent circuit models; Building blocks in analog circuits such as current sources, active load, current mirrors, supply independent biasing etc; Amplifiers: differential amplifiers, cascode amplifier, high gain structures, output stages, gain bandwidth product of op-amps; stability; comparators; second-order effects in analog circuits such as mismatch, noise and offset; data converters; frequency synthesizers; switched capacitors. The exercise sessions aim to reinforce the lecture material by well guided step-by-step design tasks. The circuit simulator SPECTRE is used to facilitate the tasks. There is also an experimental session on op-amp measurements. | |||||

Lecture notes | Handouts of presented slides. No script but an accompanying textbook is recommended. | |||||

Literature | Behzad Razavi, Design of Analog CMOS Integrated Circuits (Irwin Electronics & Computer Engineering) 1st or 2nd edition, McGraw-Hill Education | |||||

227-0301-00L | Optical Communication Fundamentals | W | 6 credits | 2V + 1U + 1P | J. Leuthold | |

Abstract | The path of an analog signal in the transmitter to the digital world in a communication link and back to the analog world at the receiver is discussed. The lecture covers the fundamentals of all important optical and optoelectronic components in a fiber communication system. This includes the transmitter, the fiber channel and the receiver with the electronic digital signal processing elements. | |||||

Objective | An in-depth understanding on how information is transmitted from source to destination. Also the mathematical framework to describe the important elements will be passed on. Students attending the lecture will further get engaged in critical discussion on societal, economical and environmental aspects related to the on-going exponential growth in the field of communications. | |||||

Content | * Chapter 1: Introduction: Analog/Digital conversion, The communication channel, Shannon channel capacity, Capacity requirements. * Chapter 2: The Transmitter: Components of a transmitter, Lasers, The spectrum of a signal, Optical modulators, Modulation formats. * Chapter 3: The Optical Fiber Channel: Geometrical optics, The wave equations in a fiber, Fiber modes, Fiber propagation, Fiber losses, Nonlinear effects in a fiber. * Chapter 4: The Receiver: Photodiodes, Receiver noise, Detector schemes (direct detection, coherent detection), Bit-error ratios and error estimations. * Chapter 5: Digital Signal Processing Techniques: Digital signal processing in a coherent receiver, Error detection teqchniques, Error correction coding. * Chapter 6: Pulse Shaping and Multiplexing Techniques: WDM/FDM, TDM, OFDM, Nyquist Multiplexing, OCDMA. * Chapter 7: Optical Amplifiers : Semiconductor Optical Amplifiers, Erbium Doped Fiber Amplifiers, Raman Amplifiers. | |||||

Lecture notes | Lecture notes are handed out. | |||||

Literature | Govind P. Agrawal; "Fiber-Optic Communication Systems"; Wiley, 2010 | |||||

Prerequisites / Notice | Fundamentals of Electromagnetic Fields & Bachelor Lectures on Physics. | |||||

227-0377-10L | Physics of Failure and Reliability of Electronic Devices and Systems | W | 3 credits | 2V | I. Shorubalko, M. Held | |

Abstract | Understanding the physics of failures and failure mechanisms enables reliability analysis and serves as a practical guide for electronic devices design, integration, systems development and manufacturing. The field gains additional importance in the context of managing safety, sustainability and environmental impact for continuously increasing complexity and scaling-down trends in electronics. | |||||

Objective | Provide an understanding of the physics of failure and reliability. Introduce the degradation and failure mechanisms, basics of failure analysis, methods and tools of reliability testing. | |||||

Content | Summary of reliability and failure analysis terminology; physics of failure: materials properties, physical processes and failure mechanisms; failure analysis; basics and properties of instruments; quality assurance of technical systems (introduction); introduction to stochastic processes; reliability analysis; component selection and qualification; maintainability analysis (introduction); design rules for reliability, maintainability, reliability tests (introduction). | |||||

Lecture notes | Comprehensive copy of transparencies | |||||

Literature | Reliability Engineering: Theory and Practice, 8th Edition, Springer 2017, DOI 10.1007/978-3-662-54209-5 Reliability Engineering: Theory and Practice, 8th Edition (2017), DOI 10.1007/978-3-662-54209-5 | |||||

227-0423-00L | Neural Network Theory | W | 4 credits | 2V + 1U | H. Bölcskei | |

Abstract | The class focuses on fundamental mathematical aspects of neural networks with an emphasis on deep networks: Universal approximation theorems, basics of approximation theory, fundamental limits of deep neural network learning, geometry of decision surfaces, capacity of separating surfaces, dimension measures relevant for generalization, VC dimension of neural networks. | |||||

Objective | After attending this lecture, participating in the exercise sessions, and working on the homework problem sets, students will have acquired a working knowledge of the mathematical foundations of (deep) neural networks. | |||||

Content | 1. Universal approximation with single- and multi-layer networks 2. Introduction to approximation theory: Fundamental limits on compressibility of signal classes, Kolmogorov epsilon-entropy of signal classes, non-linear approximation theory 3. Fundamental limits of deep neural network learning 4. Geometry of decision surfaces 5. Separating capacity of nonlinear decision surfaces 6. Dimension measures: Pseudo-dimension, fat-shattering dimension, Vapnik-Chervonenkis (VC) dimension 7. Dimensions of neural networks 8. Generalization error in neural network learning | |||||

Lecture notes | Detailed lecture notes will be provided. | |||||

Prerequisites / Notice | This course is aimed at students with a strong mathematical background in general, and in linear algebra, analysis, and probability theory in particular. | |||||

227-0447-00L | Image Analysis and Computer Vision | W | 6 credits | 3V + 1U | L. Van Gool, E. Konukoglu, F. Yu | |

Abstract | Light and perception. Digital image formation. Image enhancement and feature extraction. Unitary transformations. Color and texture. Image segmentation. Motion extraction and tracking. 3D data extraction. Invariant features. Specific object recognition and object class recognition. Deep learning and Convolutional Neural Networks. | |||||

Objective | Overview of the most important concepts of image formation, perception and analysis, and Computer Vision. Gaining own experience through practical computer and programming exercises. | |||||

Content | This course aims at offering a self-contained account of computer vision and its underlying concepts, including the recent use of deep learning. The first part starts with an overview of existing and emerging applications that need computer vision. It shows that the realm of image processing is no longer restricted to the factory floor, but is entering several fields of our daily life. First the interaction of light with matter is considered. The most important hardware components such as cameras and illumination sources are also discussed. The course then turns to image discretization, necessary to process images by computer. The next part describes necessary pre-processing steps, that enhance image quality and/or detect specific features. Linear and non-linear filters are introduced for that purpose. The course will continue by analyzing procedures allowing to extract additional types of basic information from multiple images, with motion and 3D shape as two important examples. Finally, approaches for the recognition of specific objects as well as object classes will be discussed and analyzed. A major part at the end is devoted to deep learning and AI-based approaches to image analysis. Its main focus is on object recognition, but also other examples of image processing using deep neural nets are given. | |||||

Lecture notes | Course material Script, computer demonstrations, exercises and problem solutions | |||||

Prerequisites / Notice | Prerequisites: Basic concepts of mathematical analysis and linear algebra. The computer exercises are based on Python and Linux. The course language is English. | |||||

227-0468-00L | Analog Signal Processing and Filtering Suitable for Master Students as well as Doctoral Students. | W | 6 credits | 2V + 2U | H. Schmid | |

Abstract | This lecture provides a wide overview over analog filters (continuous-time and discrete-time), signal-processing systems, and sigma-delta conversion, and gives examples with sensor interfaces and class-D audio drivers. All systems and circuits are treated using a signal-flow view. The lecture is suitable for both analog and digital designers. | |||||

Objective | This lecture provides a wide overview over analog filters (continuous-time and discrete-time), signal-processing systems, and sigma-delta conversion, and gives examples with sensor interfaces and class-D audio drivers. All systems and circuits are treated using a signal-flow view. The lecture is suitable for both analog and digital designers. The way the exam is done allows for the different interests of the two groups. The learning goal is that the students can apply signal-flow graphs and can understand the signal flow in such circuits and systems (including non-ideal effects) well enough to gain an understanding of further circuits and systems by themselves. | |||||

Content | At the beginning, signal-flow graphs in general and driving-point signal-flow graphs in particular are introduced. We will use them during the whole term to analyze circuits on a system level (analog continuous-time, analog discrete-time, mixed-signal and digital) and understand how signals propagate through them. The theory and CMOS implementation of active Filters is then discussed in detail using the example of Gm-C filters and active-RC filters. The ideal and nonideal behaviour of opamps, current conveyors, and inductor simulators follows. The link to the practical design of circuits and systems is done with an overview over different quality measures and figures of merit used in scientific literature and datasheets. Finally, an introduction to discrete-time and mixed-domain filters and circuits is given, including sensor read-out amplifiers, correlated double sampling, and chopping, and an introduction to sigma-delta A/D and D/A conversion on a system level. This lecture does not go down to the details of transistor implementations. The lecture "227-0166-00L Analog Integrated Circuits" complements This lecture very well in that respect. | |||||

Lecture notes | The base for these lectures are lecture notes and two or three published scientific papers. From these papers we will together develop the technical content. Details: Link The graph methods are also supported with teaching videos: Link Some material is protected by password; students from ETHZ who are interested can write to Link to ask for the password even if they do not attend the lecture. | |||||

Prerequisites / Notice | Live stream: due to Covids rules, the lecture will be streamed live. Join here: Link Prerequisites: Recommended (but not required): Stochastic models and signal processing, Communication Electronics, Analog Integrated Circuits, Transmission Lines and Filters. Knowledge of the Laplace transform and z transform and their interpretation (transfer functions, poles and zeros, bode diagrams, stability criteria ...) and of the main properties of linear systems is necessary. | |||||

227-0477-00L | Acoustics I | W | 6 credits | 4G | K. Heutschi | |

Abstract | Introduction to the fundamentals of acoustics in the area of sound field calculations, measurement of acoustical events, outdoor sound propagation and room acoustics of large and small enclosures. | |||||

Objective | Introduction to acoustics. Understanding of basic acoustical mechanisms. Survey of the technical literature. Illustration of measurement techniques in the laboratory. | |||||

Content | Fundamentals of acoustics, measuring and analyzing of acoustical events, anatomy and properties of the ear. Outdoor sound propagation, absorption and transmission of sound, room acoustics of large and small enclosures, architectural acoustics, noise and noise control, calculation of sound fields. | |||||

Lecture notes | yes | |||||

252-0535-00L | Advanced Machine Learning | W | 10 credits | 3V + 2U + 4A | J. M. Buhmann, C. Cotrini Jimenez | |

Abstract | Machine learning algorithms provide analytical methods to search data sets for characteristic patterns. Typical tasks include the classification of data, function fitting and clustering, with applications in image and speech analysis, bioinformatics and exploratory data analysis. This course is accompanied by practical machine learning projects. | |||||

Objective | Students will be familiarized with advanced concepts and algorithms for supervised and unsupervised learning; reinforce the statistics knowledge which is indispensible to solve modeling problems under uncertainty. Key concepts are the generalization ability of algorithms and systematic approaches to modeling and regularization. Machine learning projects will provide an opportunity to test the machine learning algorithms on real world data. | |||||

Content | The theory of fundamental machine learning concepts is presented in the lecture, and illustrated with relevant applications. Students can deepen their understanding by solving both pen-and-paper and programming exercises, where they implement and apply famous algorithms to real-world data. Topics covered in the lecture include: Fundamentals: What is data? Bayesian Learning Computational learning theory Supervised learning: Ensembles: Bagging and Boosting Max Margin methods Neural networks Unsupservised learning: Dimensionality reduction techniques Clustering Mixture Models Non-parametric density estimation Learning Dynamical Systems | |||||

Lecture notes | No lecture notes, but slides will be made available on the course webpage. | |||||

Literature | C. Bishop. Pattern Recognition and Machine Learning. Springer 2007. R. Duda, P. Hart, and D. Stork. Pattern Classification. John Wiley & Sons, second edition, 2001. T. Hastie, R. Tibshirani, and J. Friedman. The Elements of Statistical Learning: Data Mining, Inference and Prediction. Springer, 2001. L. Wasserman. All of Statistics: A Concise Course in Statistical Inference. Springer, 2004. | |||||

Prerequisites / Notice | The course requires solid basic knowledge in analysis, statistics and numerical methods for CSE as well as practical programming experience for solving assignments. Students should have followed at least "Introduction to Machine Learning" or an equivalent course offered by another institution. PhD students are required to obtain a passing grade in the course (4.0 or higher based on project and exam) to gain credit points. | |||||

263-4640-00L | Network Security | W | 8 credits | 2V + 2U + 3A | A. Perrig, S. Frei, M. Legner | |

Abstract | Some of today's most damaging attacks on computer systems involve exploitation of network infrastructure, either as the target of attack or as a vehicle to attack end systems. This course provides an in-depth study of network attack techniques and methods to defend against them. | |||||

Objective | - Students are familiar with fundamental network security concepts. - Students can assess current threats that Internet services and networked devices face, and can evaluate appropriate countermeasures. - Students can identify and assess known vulnerabilities in a software system that is connected to the Internet (through analysis and penetration testing tools). - Students have an in-depth understanding of a range of important security technologies. - Students learn how formal analysis techniques can help in the design of secure networked systems. | |||||

Content | The course will cover topics spanning five broad themes: (1) network defense mechanisms such as secure routing protocols, TLS, anonymous communication systems, network intrusion detection systems, and public-key infrastructures; (2) network attacks such as denial of service (DoS) and distributed denial-of-service (DDoS) attacks; (3) analysis and inference topics such as network forensics and attack economics; (4) formal analysis techniques for verifying the security properties of network architectures; and (5) new technologies related to next-generation networks. | |||||

Prerequisites / Notice | This lecture is intended for students with an interest in securing Internet communication services and network devices. Students are assumed to have knowledge in networking as taught in a Communication Networks lecture. The course will involve a course project and some smaller programming projects as part of the homework. Students are expected to have basic knowledge in network programming in a programming language such as C/C++, Go, or Python. |

- Page 1 of 7 All