Suchergebnis: Katalogdaten im Frühjahrssemester 2021

Elektrotechnik und Informationstechnologie Master Information
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
NummerTitelTypECTSUmfangDozierende
227-0104-00LCommunication and Detection Theory Information W6 KP4GA. Lapidoth
KurzbeschreibungThis 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.
LernzielThis 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.
Skriptn/a
LiteraturA. Lapidoth, A Foundation in Digital Communication, Cambridge University Press, 2nd edition (2017)
227-0120-00LCommunication Networks Information W6 KP4GL. Vanbever
KurzbeschreibungAt 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.
LernzielAt 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
SkriptLecture notes and material for the course will be available before each course on: Link
LiteraturMost of course follows the textbook "Computer Networking: A Top-Down Approach (6th Edition)" by Kurose and Ross.
Voraussetzungen / BesonderesNo 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
NummerTitelTypECTSUmfangDozierende
227-0558-00LPrinciples of Distributed Computing Information W7 KP2V + 2U + 2AR. Wattenhofer, M. Ghaffari
KurzbeschreibungWe 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.
LernzielDistributed 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.
InhaltDistributed 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
SkriptAvailable. Our course script is used at dozens of other universities around the world.
LiteraturLecture 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 / BesonderesCourse pre-requisites: Interest in algorithmic problems. (No particular course needed.)
  •  Seite  1  von  1