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


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



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