Slicing floorplans with range constraint

F. Y. Young, D. F. Wong, Hannah H. Yang

Research output: Contribution to journalArticlepeer-review

Abstract

In floorplanning, it is important to allow users to specify placement constraints. Floorplanning with preplaced constraint is considered recently in Murata et al. (1997) and Young and Wong (1998). In this paper, we address a more general kind of placement constraint called range constraint in which a module must be placed within a given rectangular region in the floorplan. This is a more general formulation of the placement constraint problem and any preplaced constraint can be written as a range constraint. We extend the Wong-Liu algorithm (1986) to handle range constraint. Our main contribution is a novel shape curve computation which takes range constraint into consideration. Experimental results show that the extended floorplanner performs very well and, in particular, it out-performs the floorplanner in [13] when specialized to handle preplaced modules.

Original languageEnglish (US)
Pages (from-to)272-278
Number of pages7
JournalIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Volume19
Issue number2
DOIs
StatePublished - 2000
Externally publishedYes

ASJC Scopus subject areas

  • Software
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering

Cite this