In this course we analyse central problems in chip design. Staying close to practical problems, we will develop a theory of VLSI layout. (VLSI stands for very large-scale integrated) For fundamental problems such as placement, routing, timing analysis and timing optimization we will present the most important theoretical results as well as practical algorithms. Many of them have been developped quite recently. Throughout we will take state-of-the-art chips and problems from industrial design practice to illustrate the relevance of the presented theory. Chip design is probably the most interesting and comprehensive application area of discrete mathematics. Hence fundamental concepts as taught, e.g., in the course "Diskrete Mathematik I", will be used quite often.
|Prerequisites:||Fundamental concepts of discrete mathematics.|
|Venue:||Gerhard-Konow-Hörsaal Lennéstr. 2|
|Time:||Tuesdays and Thurdsdays 12:15-13:45 p.m.|
Prof. Dr. J. Vygen