# Suchergebnis: Katalogdaten im Frühjahrssemester 2021

Elektrotechnik und Informationstechnologie Master | ||||||

Master-Studium (Studienreglement 2018) | ||||||

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

Kernfächer These core courses are particularly recommended for the field of "Computers and Networks". 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 | ||||||

Nummer | Titel | Typ | ECTS | Umfang | Dozierende | |
---|---|---|---|---|---|---|

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. | |||||

Skript | n/a | |||||

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: Link | |||||

Skript | Lecture notes and material for the course will be available before each course on: Link | |||||

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. | |||||

Advanced Core Courses | ||||||

Nummer | Titel | Typ | ECTS | Umfang | Dozierende | |

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 David Peleg. 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