Geometric Programming for Circuit Optimization

Proceedings of International Symposium on Physical Design (ISPD), pages 44–46, April 2005.

• gp_ispd.pdf

Related material:

• Digital Circuit Optimization via Geometric Programming

• A Tutorial on Geometric Programming

• Geometric Programming Applications to EDA Problems (DATE 2005 tutorial)

• A Heuristic for Optimizing Stochastic Activity Networks with Applications to Statistical Digital Circuit Sizing

This tutorial concerns a method for solving a variety of circuit sizing and optimization problems, which is based on formulating the problem as a geometric program (GP), or a generalized geometric program (GGP). These nonlinear, constrained optimization problems can be transformed to convex optimization problems, and then solved (globally) very efficiently.