Search result: Catalogue data in Spring Semester 2020
|Electrical Engineering and Information Technology Master|
|Master Studies (Programme Regulations 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.
| 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.
|Advanced Core Courses|
|227-0147-00L||VLSI II: Design of Very Large Scale Integration Circuits||W||6 credits||5G||F. K. Gürkaynak, L. Benini|
|Abstract||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.|
|Objective||Know how to design digital VLSI circuits that are safe, testable, durable, and make economic sense.|
|Content||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.
|Lecture notes||H. Kaeslin: "Top-Down Digital VLSI Design, from Gate-Level Circuits to CMOS Fabrication", Lecture Notes Vol.2 , 2015.|
All written 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||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 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)|
|227-0420-00L||Information Theory II |
Does not take place this semester.
|W||6 credits||2V + 2U||A. Lapidoth|
|Abstract||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.|
|Objective||The course has two objectives: to introduce the students to the key information theoretic results that underlay the design of communication systems and to equip the students with the tools that are needed to conduct research in Information Theory.|
|Content||Differential entropy, maximum entropy, the Gaussian channel and water filling, the entropy-power inequality, Sanov's Theorem, Fisher information, the broadcast channel, the multiple-access channel, Slepian-Wolf coding, and the Gelfand-Pinsker problem.|
|Literature||T.M. Cover and J.A. Thomas, Elements of Information Theory, second edition, Wiley 2006|
|227-0436-00L||Digital Communication and Signal Processing||W||6 credits||2V + 2U||A. Wittneben|
|Abstract||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.|
|Objective||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.|
|Content||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
|Lecture notes||Lecture notes.|
|Literature|| 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.
|Prerequisites / Notice||Formal prerequisites: none|
Recommended: Communication Systems or equivalent
|227-0558-00L||Principles of Distributed Computing||W||7 credits||2V + 2U + 2A||R. Wattenhofer, M. Ghaffari|
|Abstract||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.|
|Objective||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.|
|Content||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
|Lecture notes||Available. Our course script is used at dozens of other universities around the world.|
|Literature||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
|Prerequisites / Notice||Course pre-requisites: Interest in algorithmic problems. (No particular course needed.)|
- Page 1 of 1