The Community for Technology Leaders
RSS Icon
Los Angeles, CA
June 5, 2000 to June 9, 2000
ISBN: 1-58113-1897-9
pp: 468-471
Ernest S. Kuh , Univ. of California at Berkeley
Pinhong Chen , Univ. of California at Berkeley
In this paper, we present an approximation algorithm by linear programming (LP) for floorplan sizing problem. Given any topological constraints between blocks, we can formulate it as an LP problem with a cost function for the minimum bounding box area. Unlike slicing structures, this approach can handle any topological constraints as well as soft/hard/preplaced blocks, and timing constraints. Empirically, our method needs few iterations to find the optimum solution and shows one order of improvement over previous methods both in run time and capability to handle a larger problem size even on a very limited computing resource PC.
co-simulation, configurable processor cores, coverage analysis, design verification, system-on-chip, test generation
Ernest S. Kuh, Pinhong Chen, "Floorplan Sizing by Linear Programming Approximation", DAC, 2000, Design Automation Conference, Design Automation Conference 2000, pp. 468-471, doi:10.1109/DAC.2000.855356
42 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool