Rectangle-packing-based module placement
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
TOPOLOGY CONSTRAINED RECTILINEAR BLOCK PACKING FOR LAYOUT REUSE
TOPOLOGY CONSTRAINED RECTILINEAR BLOCK PACKING FOR LAYOUT REUSE
Arbitrary rectilinear block packing based on sequence pair
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Arbitrary convex and concave rectilinear block packing using sequence-pair
ISPD '99 Proceedings of the 1999 international symposium on Physical design
Automatic datapath tile placement and routing
Proceedings of the conference on Design, automation and test in Europe
Module placement with boundary constraints using the sequence-pair representation
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
FAST-SP: a fast algorithm for block placement based on sequence pair
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Constrained polygon transformations for incremental floorplanning
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Fast Hierarchical Floorplanning with Congestion and Timing Control
ICCD '00 Proceedings of the 2000 IEEE International Conference on Computer Design: VLSI in Computers & Processors
Unification of partitioning, placement and floorplanning
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
A fast algorithm for rectilinear block packing based on selected sequence-pair
Integration, the VLSI Journal
| Hi-index | 0.00 |
In this paper, we formulate the problem of top olo gy constrained rectiline ar blo ck packing in la yout reuse. A specific class of rectilinear shaped blocks, ordered convex r ectiline ar blo cks, is represen ted in bounded slicing grid (BSG) structure. The Non-overlapped pac king is guaranteed. Based on both sequence pair (SP) and BSG structures, w e propose an algorithm to compact the ordered con vexbloc ks under the topological constrain ts, in whic hthe x and y directions are independently compacted. By augumenting or further partitioning the arbitrary rectilinear blocks in to the ordered con vexshapes, this method can be extended to handle the topology constrained rectilinear block pac king. Furthermore, our recent theoretical progress is briefly reported at the end of this paper, in which arbitrarily rectilinear shaped blocks are represented in SP structure. Three necessary and sufficient constrain ts are deriv ed on the sequence pair, such that the non-overlapping compaction is guaranteed.