Centre SI Short Course

Stephen Boyd and Seung-Jean Kim, Stanford University
EPFL Room: INF 328, Friday, 16 June 2006 9:00-12:30

This tutorial starts with an overview of Geometric Programming (GP), a type of optimization problem that has been known since the 1970s, but recently has attracted more attention for two reasons: The development of extremely efficient interior-point algorithms for them, and the discovery that a wide variety of digital and analog circuit design problems can be at least approximately formulated as GPs.

We illustrate how GP can be used in a variety of circuit design problems, such as device sizing in op-amps, and joint selection of threshold voltage, supply voltage, and device sizes in digital circuit design.

Please enroll by sending an e-mail to anil.leblebici@epfl.ch