Efficient shape curve construction in floorplan design

Ting Chi Wang, D.F. Wong

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

Abstract

The authors present an efficient algorithm to construct shape curves for VLSI floorplans. Their algorithm is based on extensions of a tree-restructuring technique and a curve-adding technique. They assume each module in the floorplan has an infinite number of non-redundant implementations specified (or approximated) by a piecewise linear decreasing shape curve. Their algorithm constructs a shape curve that contains all non-redundant implementations of the floorplan. Experimental results indicate that the algorithm performs well.
Original languageEnglish
Title of host publicationProceedings of the European Conference on Design Automation
PublisherIEEE
Pages356-360
Number of pages5
ISBN (Print)9780818621307
DOIs
Publication statusPublished - 28 Feb 1991
Event1991 European Design Automation Conference, EDAC 1991 - Amsterdam, Netherlands
Duration: 25 Feb 199128 Feb 1991
https://ieeexplore.ieee.org/xpl/conhome/884/proceeding

Publication series

NameProceedings of European Conference on Design Automation

Conference

Conference1991 European Design Automation Conference, EDAC 1991
Country/TerritoryNetherlands
CityAmsterdam
Period25/02/9128/02/91
Internet address

User-Defined Keywords

  • Shape
  • Piecewise linear techniques
  • Topology
  • Design optimization
  • Tree graphs
  • Wheels
  • Very large scale integration
  • Algorithm design and analysis
  • Polynomials

Cite this