Title :
Area minimization for general floorplans
Author :
Pan, P. ; Liu, C.L.
Author_Institution :
Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA
Abstract :
Two methods for the area minimization problem in floorplanning are presented. These methods can be viewed as generalizations of Stockmeyer´s algorithm in the sense that they reduce to Stockmeyer´s algorithm for floorplans that are slicing. The present methods can also be applied to general floorplans. Compared with the branch-and-bound algorithm, which is enumerative in nature and does not have any nontrivial performance bound for general floorplans, these methods are probably better than exhaustive methods for all the floorplans studied.<>
Keywords :
circuit layout CAD; Stockmeyer´s algorithm; area minimisation; branch-and-bound algorithm; floorplanning; general floorplans; Design automation;
Conference_Titel :
Computer-Aided Design, 1992. ICCAD-92. Digest of Technical Papers., 1992 IEEE/ACM International Conference on
Conference_Location :
Santa Clara, CA, USA
Print_ISBN :
0-8186-3010-8
DOI :
10.1109/ICCAD.1992.279305
