Floorplan design of VLSI circuits
In this paper we present two algorithms for the floorplan design problem. The algorithms are quite similar in spirit. They both use Polish expressions to represent floorplans and employ the search method of simulated annealing. The first algorithm is for the case where all modules are rectangular, and the second one is for the case where the modules are either rectangular or L-shaped. Our algorithms consider simultaneously the interconnection information as well as the area and shape information for the modules. Experimental results indicate that our algorithms perform well for many test problems.
- Stats: A slicing tree and tabu search based heuristic for the unequal area facility layout problem
- A nonlinear optimization methodology for VLSI fixed-outline floorplanning
- Applying ant system for solving unequal area facility layout problems
- Floorplanning by graph dualization: \(L\)-shaped modules
- Stochastic simulations of two-dimensional composite packings
- Complexity and approximability results for slicing floorplan designs.
- Computing elastic moduli of two-dimensional random networks of rigid and nonrigid bonds by simulated annealing
- Extensions to STaTS for practical applications of the facility layout problem
- VLSI floorplanning based on a hybrid differential evolution algorithm
- Floor-planning via orderly spanning trees
- An Array Layout Methodology for VLSI Circuits
- Optimal module sizing in VLSI floorplanning by nonlinear programming
- VLSI floorplanning based on the integration of adaptive search models
- scientific article; zbMATH DE number 54185 (Why is no real title available?)
- Graph-based techniques to speed up floorplan area optimization
- Compact floor-planning via orderly spanning trees
- Recent developments in floorplan representations
- Rectangle placement for VLSI testing
- New perspectives in VLSI design automation: deterministic packing by sequence pair
- Customized simulated annealing based decision algorithms for combinatorial optimization in VLSI floorplanning problem
- Corner block list representation and its application with boundary constraints
This page was built for publication: Floorplan design of VLSI circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1113879)