Optimal Cell Generation for Dual Independent Layout Styles

Bradley S. Carlson, C. Y. Roger Chen, Uminder Singh

Research output: Contribution to journalArticle

9 Scopus citations

Abstract

The need for automatic layout and functional cell generation tools is increasing dramatically due to the fast turnaround time desired in the design of integrated circuits. Many optimization algorithms have been proposed in the literature for layout styles which are dual dependent; that is, the optimization for the layout of the n-transistor network of a CMOS complex gate is dependent on the p-transistor network and vice versa. A two-stage linear-time optimization algorithm is presented for dual independent layout styles in this paper. The first stage is based on a tree representation of the complex gate [8]. This tree representation allows complete flexibility in transistor order and takes complete advantage of the concept of delayed binding [13]. The optimization goal is identical to the Euler pathed optimization algorithms presented in [2] and [5]–[9]. The optimization algorithm is applicable to many VLSI layout styles. In this paper, the algorithm is applied to the M3 [4] layout style and examples of generated layouts are shown. Starting from a switching expression, the proposed algorithm always produces an optimal solution in terms of the number of diffusion breaks, which includes an optimal transistor representation for the switching expression (first stage), and an optimal gate sequence to traverse this transistor circuit (second stage).

Original languageEnglish (US)
Pages (from-to)770-782
Number of pages13
JournalIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Volume10
Issue number6
DOIs
StatePublished - Jun 1991

ASJC Scopus subject areas

  • Software
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Optimal Cell Generation for Dual Independent Layout Styles'. Together they form a unique fingerprint.

  • Cite this