Suchergebnis: Katalogdaten im Frühjahrssemester 2021
|Elektrotechnik und Informationstechnologie Master|
|Master-Studium (Studienreglement 2018)|
The core courses and specialization courses below are a selection for students who wish to specialize in the area of "Communication", see https://www.ee.ethz.ch/studies/main-master/areas-of-specialisation.html.
The individual study plan is subject to the tutor's approval.
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|
|227-0104-00L||Communication and Detection Theory||W||6 KP||4G||A. Lapidoth|
|Kurzbeschreibung||This course teaches the foundations of modern digital communications and detection theory. Topics include the geometry of the space of energy-limited signals; the baseband representation of passband signals, spectral efficiency and the Nyquist Criterion; the power and power spectral density of PAM and QAM; hypothesis testing; Gaussian stochastic processes; and detection in white Gaussian noise.|
|Lernziel||This is an introductory class to the field of wired and wireless communication. It offers a glimpse at classical analog modulation (AM, FM), but mainly focuses on aspects of modern digital communication, including modulation schemes, spectral efficiency, power budget analysis, block and convolu- tional codes, receiver design, and multi- accessing schemes such as TDMA, FDMA and Spread Spectrum.|
|Inhalt||- Baseband representation of passband signals.|
- Bandwidth and inner products in baseband and passband.
- The geometry of the space of energy-limited signals.
- The Sampling Theorem as an orthonormal expansion.
- Sampling passband signals.
- Pulse Amplitude Modulation (PAM): energy, power, and power spectral density.
- Nyquist Pulses.
- Quadrature Amplitude Modulation (QAM).
- Hypothesis testing.
- The Bhattacharyya Bound.
- The multivariate Gaussian distribution
- Gaussian stochastic processes.
- Detection in white Gaussian noise.
|Literatur||A. Lapidoth, A Foundation in Digital Communication, Cambridge University Press, 2nd edition (2017)|
|227-0120-00L||Communication Networks||W||6 KP||4G||L. Vanbever|
|Kurzbeschreibung||At the end of this course, you will understand the fundamental concepts behind communication networks and the Internet. Specifically, you will be able to:|
- understand how the Internet works;
- build and operate Internet-like infrastructures;
- identify the right set of metrics to evaluate the performance of a network and propose ways to improve it.
|Lernziel||At the end of the course, the students will understand the fundamental concepts of communication networks and Internet-based communications. Specifically, students will be able to:|
- understand how the Internet works;
- build and operate Internet-like network infrastructures;
- identify the right set of metrics to evaluate the performance or the adequacy of a network and propose ways to improve it (if any).
The course will introduce the relevant mechanisms used in today's networks both from an abstract perspective but also from a practical one by presenting many real-world examples and through multiple hands-on projects.
For more information about the lecture, please visit: https://comm-net.ethz.ch
|Skript||Lecture notes and material for the course will be available before each course on: https://comm-net.ethz.ch|
|Literatur||Most of course follows the textbook "Computer Networking: A Top-Down Approach (6th Edition)" by Kurose and Ross.|
|Voraussetzungen / Besonderes||No prior networking background is needed. The course will include some programming assignments (in Python) for which the material covered in Technische Informatik 1 (227-0013-00L) will be useful.|
|227-0125-00L||Optics and Photonics||W||6 KP||2V + 2U||J. Leuthold|
|Kurzbeschreibung||This lecture covers both - the fundamentals of "Optics" such as e.g. "ray optics", "coherence", the "Planck law" or the "Einstein relations" but also the fundamentals of "Photonics" on the generation, processing, transmission and detection of photons.|
|Lernziel||A sound base for work in the field of optics and photonics will be given.|
|Inhalt||Chapter 1: Ray Optics|
Chapter 2: Electromagnetic Optics
Chapter 3: Polarization
Chapter 4: Coherence and Interference
Chapter 5: Fourier Optics and Diffraction
Chapter 6: Guided Wave Optics
Chapter 7: Optical Fibers
Chapter 8: The Laser
|Skript||Lecture notes will be handed out.|
|Voraussetzungen / Besonderes||Fundamentals of Electromagnetic Fields (Maxwell Equations) & Bachelor Lectures on Physics.|
|Advanced Core Courses|
|227-0147-00L||VLSI II: Design of Very Large Scale Integration Circuits||W||6 KP||5G||F. K. Gürkaynak, L. Benini|
|Kurzbeschreibung||This second course in our VLSI series is concerned with how to turn digital circuit netlists into safe, testable and manufacturable mask layout, taking into account various parasitic effects. Low-power circuit design is another important topic. Economic aspects and management issues of VLSI projects round off the course.|
|Lernziel||Know how to design digital VLSI circuits that are safe, testable, durable, and make economic sense.|
|Inhalt||The second course begins with a thorough discussion of various technical aspects at the circuit and layout level before moving on to economic issues of VLSI. Topics include: |
- The difficulties of finding fabrication defects in large VLSI chips.
- How to make integrated circuit testable (design for test).
- Synchronous clocking disciplines compared, clock skew, clock distribution, input/output timing.
- Synchronization and metastability.
- CMOS transistor-level circuits of gates, flip-flops and random access memories.
- Sinks of energy in CMOS circuits.
- Power estimation and low-power design.
- Current research in low-energy computing.
- Layout parasitics, interconnect delay, static timing analysis.
- Switching currents, ground bounce, IR-drop, power distribution.
- Floorplanning, chip assembly, packaging.
- Layout design at the mask level, physical design verification.
- Electromigration, electrostatic discharge, and latch-up.
- Models of industrial cooperation in microelectronics.
- The caveats of virtual components.
- The cost structures of ASIC development and manufacturing.
- Market requirements, decision criteria, and case studies.
- Yield models.
- Avenues to low-volume fabrication.
- Marketing considerations and case studies.
- Management of VLSI projects.
Exercises are concerned with back-end design (floorplanning, placement, routing, clock and power distribution, layout verification). Industrial CAD tools are being used.
|Skript||H. Kaeslin: "Top-Down Digital VLSI Design, from Gate-Level Circuits to CMOS Fabrication", Lecture Notes Vol.2 , 2015.|
All written documents in English.
|Literatur||H. Kaeslin: "Top-Down Digital VLSI Design, from Architectures to Gate-Level Circuits and FPGAs", Elsevier, 2014, ISBN 9780128007303.|
|Voraussetzungen / Besonderes||Highlight:|
Students are offered the opportunity to design a circuit of their own which then gets actually fabricated as a microchip! Students who elect to participate in this program register for a term project at the Integrated Systems Laboratory in parallel to attending the VLSI II course.
"VLSI I: from Architectures to Very Large Scale Integration Circuits and FPGAs" or equivalent knowledge.
|227-0418-00L||Algebra and Error Correcting Codes||W||6 KP||4G||H.‑A. Loeliger|
|Kurzbeschreibung||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.|
|Lernziel||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.|
|Inhalt||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.
|Skript||Lecture Notes (english)|
|227-0420-00L||Information Theory II||W||6 KP||4G||A. Lapidoth, S. M. Moser|
|Kurzbeschreibung||This course builds on Information Theory I. It introduces additional topics in single-user communication, connections between Information Theory and Statistics, and Network Information Theory.|
|Lernziel||The course's objective is to introduce the students to additional information measures and to equip them with the tools that are needed to conduct research in Information Theory as it relates to Communication Networks and to Statistics.|
|Inhalt||Sanov's Theorem, Rényi entropy and guessing, differential entropy, maximum entropy, the Gaussian channel, the entropy-power inequality, the broadcast channel, the multiple-access channel, Slepian-Wolf coding, the Gelfand-Pinsker problem, and Fisher information.|
|Literatur||T.M. Cover and J.A. Thomas, Elements of Information Theory, second edition, Wiley 2006|
|Voraussetzungen / Besonderes||Basic introductory course on Information Theory.|
|227-0436-00L||Digital Communication and Signal Processing|
Findet dieses Semester nicht statt.
|W||6 KP||2V + 2U||A. Wittneben|
|Kurzbeschreibung||A comprehensive presentation of modern digital modulation, detection and synchronization schemes and relevant aspects of signal processing enables the student to analyze, simulate, implement and research the physical layer of advanced digital communication schemes. The course both covers the underlying theory and provides problem solving and hands-on experience.|
|Lernziel||Digital communication systems are characterized by ever increasing requirements on data rate, spectral efficiency and reliability. Due to the huge advances in very large scale integration (VLSI) we are now able to implement extremely complex digital signal processing algorithms to meet these challenges. As a result the physical layer (PHY) of digital communication systems has become the dominant function in most state-of-the-art system designs. In this course we discuss the major elements of PHY implementations in a rigorous theoretical fashion and present important practical examples to illustrate the application of the theory. In Part I we treat discrete time linear adaptive filters, which are a core component to handle multiuser and intersymbol interference in time-variant channels. Part II is a seminar block, in which the students develop their analytical and experimental (simulation) problem solving skills. After a review of major aspects of wireless communication we discuss, simulate and present the performance of novel cooperative and adaptive multiuser wireless communication systems. As part of this seminar each students has to give a 15 minute presentation and actively attends the presentations of the classmates. In Part III we cover parameter estimation and synchronization. Based on the classical discrete detection and estimation theory we develop maximum likelihood inspired digital algorithms for symbol timing and frequency synchronization.|
|Inhalt||Part I: Linear adaptive filters for digital communication|
• Finite impulse response (FIR) filter for temporal and spectral shaping
• Wiener filters
• Method of steepest descent
• Least mean square adaptive filters
Part II: Seminar block on cooperative wireless communication
• review of the basic concepts of wireless communication
• multiuser amplify&forward relaying
• performance evaluation of adaptive A&F relaying schemes and student presentations
Part III: Parameter estimation and synchronization
• Discrete detection theory
• Discrete estimation theory
• Synthesis of synchronization algorithms
• Frequency estimation
• Timing adjustment by interpolation
|Literatur|| Oppenheim, A. V., Schafer, R. W., "Discrete-time signal processing", Prentice-Hall, ISBN 0-13-754920-2.|
 Haykin, S., "Adaptive filter theory", Prentice-Hall, ISBN 0-13-090126-1.
 Van Trees, H. L., "Detection , estimation and modulation theory", John Wiley&Sons, ISBN 0-471-09517-6.
 Meyr, H., Moeneclaey, M., Fechtel, S. A., "Digital communication receivers: synchronization, channel estimation and signal processing", John Wiley&Sons, ISBN 0-471-50275-8.
|Voraussetzungen / Besonderes||Formal prerequisites: none|
Recommended: Communication Systems or equivalent
|227-0558-00L||Principles of Distributed Computing||W||7 KP||2V + 2U + 2A||R. Wattenhofer, M. Ghaffari|
|Kurzbeschreibung||We study the fundamental issues underlying the design of distributed systems: communication, coordination, fault-tolerance, locality, parallelism, self-organization, symmetry breaking, synchronization, uncertainty. We explore essential algorithmic ideas and lower bound techniques.|
|Lernziel||Distributed computing is essential in modern computing and communications systems. Examples are on the one hand large-scale networks such as the Internet, and on the other hand multiprocessors such as your new multi-core laptop. This course introduces the principles of distributed computing, emphasizing the fundamental issues underlying the design of distributed systems and networks: communication, coordination, fault-tolerance, locality, parallelism, self-organization, symmetry breaking, synchronization, uncertainty. We explore essential algorithmic ideas and lower bound techniques, basically the "pearls" of distributed computing. We will cover a fresh topic every week.|
|Inhalt||Distributed computing models and paradigms, e.g. message passing, shared memory, synchronous vs. asynchronous systems, time and message complexity, peer-to-peer systems, small-world networks, social networks, sorting networks, wireless communication, and self-organizing systems.|
Distributed algorithms, e.g. leader election, coloring, covering, packing, decomposition, spanning trees, mutual exclusion, store and collect, arrow, ivy, synchronizers, diameter, all-pairs-shortest-path, wake-up, and lower bounds
|Skript||Available. Our course script is used at dozens of other universities around the world.|
|Literatur||Lecture Notes By Roger Wattenhofer. These lecture notes are taught at about a dozen different universities through the world.|
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Hagit Attiya, Jennifer Welch.
McGraw-Hill Publishing, 1998, ISBN 0-07-709352 6
Introduction to Algorithms
Thomas Cormen, Charles Leiserson, Ronald Rivest.
The MIT Press, 1998, ISBN 0-262-53091-0 oder 0-262-03141-8
Disseminatin of Information in Communication Networks
Juraj Hromkovic, Ralf Klasing, Andrzej Pelc, Peter Ruzicka, Walter Unger.
Springer-Verlag, Berlin Heidelberg, 2005, ISBN 3-540-00846-2
Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes
Frank Thomson Leighton.
Morgan Kaufmann Publishers Inc., San Francisco, CA, 1991, ISBN 1-55860-117-1
Distributed Computing: A Locality-Sensitive Approach
Society for Industrial and Applied Mathematics (SIAM), 2000, ISBN 0-89871-464-8
|Voraussetzungen / Besonderes||Course pre-requisites: Interest in algorithmic problems. (No particular course needed.)|
- Seite 1 von 1