Efficient shape curve construction in floorplan design

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.<>