Corner block list: an effective and efficient topological representation of non-slicing floorplan
Authors:
- 8 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 8-12
Abstract
In this paper, a corner block list-a new efficient topological representation for non-slicing floorplan is proposed with applications to VLSI floorplan and building block placement. Given a corner block list, it takes only linear time to construct the floorplan. Unlike the O-tree structure, which determines the exact floorplan based on given block sizes, corner block list defines the floorplan independent of the block sizes. Thus, the structure is better suited for floorplan optimization with various size configurations of each block. Based on this new structure and the simulated annealing technique, an efficient floorplan algorithm is given. Soft blocks and the aspect ratio of the chip are taken into account in the simulated annealing process. The experimental results demonstrate the algorithm is quite promising.Keywords
This publication has 6 references indexed in Scilit:
- Module placement on BSG-structure and IC layout applications2002
- Rectangle-packing-based module placement2002
- An O-tree representation of non-slicing floorplan and its applications1999
- Branch-and-bound placement for building block layout1991
- A New Algorithm for Floorplan Design1986
- Optimization by Simulated AnnealingScience, 1983