Lecture Course "Chip Design"

← Semester overview

Summer Term 2020

Module V4C3 and MA-INF 1202

This course is part of the Master's Programs in Mathematics and Computer Science. Basic knowledge in combinatorial optimization is required.

Chip design is one of the most interesting application areas of mathematics. We discuss theory and practice. Many applications of combinatorial optimization will be shown. Recent theory, algorithms, and implications of new chip technologies will be discussed. The course covers topics in Boolean circuit optimization, placement, timing optimization, and routing.

This course is in English. Since there exists no suitable textbook yet, I am distributing lecture notes on eCampus (ln.pdf) that are continuously revised. Many topics and references can also be found in:

• S. Held, B. Korte, D. Rautenbach, J. Vygen: Combinatorial optimization in VLSI design. In: "Combinatorial Optimization: Methods and Applications" (V. Chvátal, ed.), IOS Press, Amsterdam 2011, pp. 33-96
• J.E. Savage: Models of Computation, Exploring the Power of Computing. Addison-Wesley, 1998. creative commons online version
• C.J. Alpert, D.P. Mehta, S.S. Sapatnekar, eds.: Handbook of Algorithms for VLSI Physical Design Automation. Taylor and Francis, Boca Raton 2009
• L. Lavagno, I.L. Markov, G. Martin, and L.K. Scheffer, eds.: Electronic Design Autoimation for IC Implementation, Circuit Design, and Process Technology. CRC Press, 2nd edition, 2016.