Optimal orientations of cells in slicing floorplan designs
Information and Control
Rectangle-packing-based module placement
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Module placement with boundary constraints using the sequence-pair representation
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
An Enhanced Q-Sequence Augmented with Empty-Room-Insertion and Parenthesis Trees
Proceedings of the conference on Design, automation and test in Europe
VLSI/PCB placement with obstacles based on sequence pair
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Arbitrary convex and concave rectilinear block packing using sequence-pair
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Fast evaluation of sequence pair in block placement by longest common subsequence computation
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Space-planning: placement of modules with controlled empty area by single-sequence
Proceedings of the 2004 Asia and South Pacific Design Automation Conference
A fast algorithm for rectilinear block packing based on selected sequence-pair
Integration, the VLSI Journal
Constraint-free analog placement with topological symmetry structure
Proceedings of the 2008 Asia and South Pacific Design Automation Conference
| Hi-index | 0.00 |
In this paper, we propose "selected sequence-pair" (SSP), a sequence-pair (seq-pair) with the limited number of subsequences called adjacent crosses. Its features are: (1) The smallest packing based on a given SSP can be obtained in O(n) time, where n is the number of rectangles. (2) An arbitrary packing can be represented by SSP. (3) The total representation number of SSP of size n is not more than that of rectangular dissection of the same size with n-[√4n-1] empty rooms (the necessary number of empty rooms to represent an arbitrary packing). To realize these features of SSP, we propose an algorithm to enumerate all adjacent crosses on a seq-pair in linear time of n+k (k is the number of adjacent crosses). Also we apply a conventional method to convert a seq-pair without adjacent crosses to an equivalent Q-sequence, representation of rectangular dissection, in O(n + k) time. A move operation to obtain an adjacent solution efficiently is proposed to perturb SSP for Simulated Annealing. From experimental results, we confirmed the proposed method was carried out in linear time and was more efficient than the conventional method when SSP size got bigger.