O(n) algorithm for transistor stacking with performance constraints

Bulent Basaran, Rob A. Rutenbar

Research output: Contribution to journalArticle

Abstract

We describe a new constraint-driven stacking algorithm for diffusion area minimization of CMOS circuits. It employs an Eulerian trail finding algorithm that can satisfy analog-specific performance constraints. Our technique is superior to other published approaches both in terms of its time complexity and in the optimality of the stacks it produces. For a circuit with n transistors, the time complexity is O(n). All performance constraints are satisfied and, for a certain class of circuits, optimum stacking is guaranteed.

Original languageEnglish (US)
Pages (from-to)221-226
Number of pages6
JournalProceedings - Design Automation Conference
StatePublished - 1996
Externally publishedYes

ASJC Scopus subject areas

  • Hardware and Architecture
  • Control and Systems Engineering

Fingerprint Dive into the research topics of 'O(n) algorithm for transistor stacking with performance constraints'. Together they form a unique fingerprint.

  • Cite this