Combined hierarchical placement algorithm for row-based layouts

Published

Journal Article

A hierarchical placement algorithm which combines mincut partitioning and simulated annealing has been developed. The objective of mincut partitioning is to minimise the number of crossing nets, while the objective of placement by simulated annealing is usually to minimise the total estimated wire length. The combined placement algorithm can optimise both the routing density and the estimated wire length. For efficiency, the placement is performed using multiple levels of hierarchy in the top-down direction. Several standard-cell and sea-of-gates (SOG) circuits are placed using this algorithm and promising results are obtained. © 1993, The Institution of Electrical Engineers. All rights reserved.

Full Text

Duke Authors

Cited Authors

  • Kim, C; Kim, W; Shin, H; Rhee, K; Chung, H; Kim, J

Published Date

  • January 1, 1993

Published In

Volume / Issue

  • 29 / 17

Start / End Page

  • 1508 - 1510

International Standard Serial Number (ISSN)

  • 0013-5194

Digital Object Identifier (DOI)

  • 10.1049/el:19931005

Citation Source

  • Scopus