@lee_peck

A min-cut placement algorithm for general cell assemblies based on a graph representation

. DAC '79: Proceedings of the 16th Conference on Design automation, page 1--10. Piscataway, NJ, USA, IEEE Press, (1979)

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 used to demonstrate the performance of the algorithms. Results are shown to compare favorably with manually achieved solutions.

Description

A min-cut placement algorithm for general cell assemblies based on a graph representation

Links and resources

Tags

community

  • @dblp
  • @lee_peck
@lee_peck's tags highlighted