A UNIFIED APPROACH TO FLOORPLAN SIZING AND ENUMERATION

Given a sliceable floorplan and cell sizes, Otten and Stockmeyer [12], [13] presented an algorithm to find an optimal implementation for eac h cell. We consider a generalized optimal sizing problem on a set of s licing trees related to an adjacency graph. For computation efficiency , we combine the tree enumeration and sizing procedures in a unified a lgorithm where floorplan trees and sizes are computed simultaneously. The tree enumeration is based on adjacency graph of the input cells, w hich ensures that the adjacency requirements of the cells are preserve d. Time complexity of the algorithm is analyzed and experimental resul ts using MCNC benchmarks are reported. Our algorithm is a generalizati on of that of [2], [12], [13], [18].