A Min-Cut Placement Algorithm for General Cell Assemblies Based on a Graph Representation

Abstract

A new placement algorithm for general cell assemblies is presented which combines the ideas of polar graph representation and min-cut placement. First a detailed description of the initial placement procedure is given, then the various methods for placement improvement (rotation, squeezing, reflecting) and global routing are discussed. A sample circuit is… (More)
DOI: 10.1145/62882.62901

Topics

Statistics

05'80'83'87'91'95'99'03'07'11'15
Citations per Year

99 Citations

Semantic Scholar estimates that this publication has 99 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics