Efficient floorplan area optimization

D. F. Wong*, Prasad S. Sakhamuri

*Corresponding author for this work

Research output: Chapter in book/report/conference proceedingConference proceedingpeer-review

17 Citations (Scopus)


The floorplan area optimization problem is to determine the shape and dimensions of all the modules when the topology of the floorplan is given. The objective is to minimize the area of the resulting floorplan. Existing methods only apply to slicing floorplans. We present in this paper an algorithm for general hierarchical floorplans. Our algorithm combines the curve-adding technique used in the case of slicing floorplans and a new technique that computes shape curves by iterative modification of the shape and dimensions of individual modules. We also present an optimal points selection algorithm using the technique of dynamic programming to further enhance the process of shape curves construction.

Original languageEnglish
Title of host publication26th ACM/IEEE Design Automation Conference - Proceedings 1989
PublisherAssociation for Computing Machinery (ACM)
Number of pages4
ISBN (Print)9780897913102, 0897913108
Publication statusPublished - 1 Jun 1989
Event26th ACM/IEEE Design Automation Conference, DAC 1989 - Las Vegas, United States
Duration: 25 Jun 198929 Jun 1989

Publication series

NameACM/IEEE Design Automation Conference - Proceedings
ISSN (Print)0738-100X


Conference26th ACM/IEEE Design Automation Conference, DAC 1989
Country/TerritoryUnited States
CityLas Vegas
Internet address

Scopus Subject Areas

  • Hardware and Architecture
  • Control and Systems Engineering


Dive into the research topics of 'Efficient floorplan area optimization'. Together they form a unique fingerprint.

Cite this