VLSI Circuit Performance Optimization by Geometric Programming

Chris Chu, D. F. Wong

Research output: Contribution to journalArticlepeer-review

Abstract

Delay of VLSI circuit components can be controlled by varying their sizes. In other words, performance of VLSI circuits can be optimized by changing the sizes of the circuit components. In this paper, we define a special type of geometric program called unary geometric program. We show that under the Elmore delay model, several commonly used formulations of the circuit component sizing problem considering delay, chip area and power dissipation can be reduced to unary geometric programs. We present a greedy algorithm to solve unary geometric programs optimally and efficiently. When applied to VLSI circuit component sizing, we prove that the runtime of the greedy algorithm is linear to the number of components in the circuit. In practice, we demonstrate that our unary-geometric-program based approach for circuit sizing is hundreds of times or more faster than other approaches.

Original languageEnglish (US)
Pages (from-to)37-60
Number of pages24
JournalAnnals of Operations Research
Volume105
Issue number1-4
DOIs
StatePublished - 2001
Externally publishedYes

Keywords

  • Circuit performance optimization
  • Gate sizing
  • Lagrangian relaxation
  • Transistor sizing
  • Unary geometric programming
  • VLSI design
  • Wire sizing

ASJC Scopus subject areas

  • Decision Sciences(all)
  • Management Science and Operations Research

Fingerprint

Dive into the research topics of 'VLSI Circuit Performance Optimization by Geometric Programming'. Together they form a unique fingerprint.

Cite this