Optimal orientations of cells in slicing floorplan designs
Information and Control
A new algorithm for floorplan design
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
DAC '82 Proceedings of the 19th Design Automation Conference
Placement algorithms for arbitrarily shaped blocks
DAC '79 Proceedings of the 16th Design Automation Conference
An optimal algorithm for floorplan area optimization
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
An analytical approach to floorplan design and optimization
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Area minimization for hierarchical floorplans
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Nostradamus: a floorplanner of uncertain design
ISPD '98 Proceedings of the 1998 international symposium on Physical design
Area minimization for general floorplans
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
A Genetic Approach for Two Dimensional Packing with Constraints
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
VLSI floorplan generation and area optimization using AND-OR graph search
VLSID '95 Proceedings of the 8th International Conference on VLSI Design
Fast Hierarchical Floorplanning with Congestion and Timing Control
ICCD '00 Proceedings of the 2000 IEEE International Conference on Computer Design: VLSI in Computers & Processors
Constrained two dimensional bin packing using a genetic algorithm
Recent advances in intelligent paradigms and applications
A VLSI floorplanner based on "balloon" expansion
EURO-DAC '90 Proceedings of the conference on European design automation
| Hi-index | 0.00 |
The floorplan area optimization problem is to determine the shape and dimensions of all the modules when the topology of the floorplan is given. The objective is to minimize the area of the resulting floorplan. Existing methods only apply to slicing floorplans. We present in this paper an algorithm for general hierarchical floorplans. Our algorithm combines the curve-adding technique used in the case of slicing floorplans and a new technique that computes shape curves by iterative modification of the shape and dimensions of individual modules. We also present an optimal points selection algorithm using the technique of dynamic programming to further enhance the process of shape curves construction.