Cell compilation with constraints

  • Authors:
  • Chidchanok Lursinsap;Daniel Gajski

  • Affiliations:
  • Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, Illinois;Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, Illinois

  • Venue:
  • DAC '84 Proceedings of the 21st Design Automation Conference
  • Year:
  • 1984

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes a cell compiler that translates cell descriptions given in form of Boolean equations including pass transistors into layout descriptions in Caltech Intermediate Form (CIF). The translation process is constrained by given height and width of the cell and the position of each I/O signal on the boundary of the cell. Furthermore, the size of each transistor as well as power consumption can be arbitrarily chosen. This cell compiler allows routing through the cell in any direction. The cell architecture is based on PLA structures.