Rectangle-packing-based module placement
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
VLSI/PCB placement with obstacles based on sequence-pair
Proceedings of the 1997 international symposium on Physical design
Slicing floorplans with pre-placed modules
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Slicing floorplans with range constraint
ISPD '99 Proceedings of the 1999 international symposium on Physical design
Arbitrary convex and concave rectilinear block packing using sequence-pair
ISPD '99 Proceedings of the 1999 international symposium on Physical design
B*-Trees: a new representation for non-slicing floorplans
Proceedings of the 37th Annual Design Automation Conference
Introduction to Algorithms
Slicing floorplans with boundary constraints
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Multi-bend bus driven floorplanning
Proceedings of the 2005 international symposium on Physical design
Constraint-driven floorplan repair
Proceedings of the 43rd annual Design Automation Conference
Multi-bend bus driven floorplanning
Integration, the VLSI Journal
A simultaneous bus orientation and bused pin flipping algorithm
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
TCG-based multi-bend bus driven floorplanning
Proceedings of the 2008 Asia and South Pacific Design Automation Conference
Constraint-driven floorplan repair
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Bus via reduction based on floorplan revising
Proceedings of the 20th symposium on Great lakes symposium on VLSI
Multi-bend bus-driven floorplanning considering fixed-outline constraints
Integration, the VLSI Journal
Hi-index | 0.00 |
In floorplan design, it is common that a designer will want to control the positions of some modules in the final packing for various purposes like data path alignment, I/O connection, etc.. There are several previous works focusing on a few particular kinds of placement constraint. In this paper, we will present the first "unified method" to handle all of them simultaneously, including pre-placed constraint, range constraint, boundary constraint, alignment, abutment and clustering, etc., in general non-slicing floorplans. We have used incremental updates and an interesting idea of reduced graph to improve the runtime of the algorithm. We tested our method using some benchmark data with about one eighth of the modules having placement constraints and the results is very promising. Good packings with all the constraints satisfied can be obtained efficiently.