Selected sequence-pair: an efficient decodable packing representation in linear time using sequence-pair

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.

[1]  K. Fujiyoshi,et al.  Simulated annealing search through general structure floorplans using sequence-pair , 2000, 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353).

[2]  Ting-Chi Wang,et al.  Module placement with boundary constraints using the sequence-pair representation , 2001, ASP-DAC '01.

[3]  H. Murata,et al.  Rectangle-packing-based module placement , 1995, ICCAD 1995.

[4]  Yoji Kajitani,et al.  An enhanced Q-sequence augmented with empty-room-insertion and parenthesis trees , 2002, Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition.

[5]  Martin D. F. Wong,et al.  Fast evaluation of sequence pair in block placement by longest common subsequence computation , 2000, DATE '00.

[6]  Chikaaki Kodama,et al.  An efficient decoding method of sequence-pair , 2002, Asia-Pacific Conference on Circuits and Systems.

[7]  H. Murata,et al.  Rectangle-packing-based module placement , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[8]  Hiroshi Murata,et al.  Arbitrary convex and concave rectilinear block packing using sequence-pair , 1999, ISPD '99.

[9]  Larry J. Stockmeyer,et al.  Optimal Orientations of Cells in Slicing Floorplan Designs , 1984, Inf. Control..

[10]  Mineo Kaneko,et al.  VLSI/PCB placement with obstacles based on sequence-pair , 1997, ISPD '97.

[11]  Yoji Kajitani,et al.  A mapping from sequence-pair to rectangular dissection , 1997, Proceedings of ASP-DAC '97: Asia and South Pacific Design Automation Conference.

[12]  Yoji Kajitani,et al.  The quarter-state sequence (Q-sequence) to represent the floorplan and applications to layout optimization , 2000, IEEE APCCAS 2000. 2000 IEEE Asia-Pacific Conference on Circuits and Systems. Electronic Communication Systems. (Cat. No.00EX394).