Arbitrary convex and concave rectilinear block packing usingsequence-pair

The sequence-pair was proposed in 1995 as a representation of the packing of rectangles of general structure. Since then, there have been efforts to expand its applicability over simple rectangles. This paper proposes a unified way to represent the packing of a set of rectilinear blocks, including arbitrary concave rectilinear blocks. Our idea is in the representation of a general block by a collection of rectangle blocks with additional constraints, Some sequence-pairs of rectangle blocks with such constraints may not be feasible, i.e., there is no corresponding parking. A necessary and sufficient condition of feasible sequence-pair is given by the properties of the horizontal and vertical constraint graphs. Furthermore, it is proved that any packing is represented by a feasible sequence-pair. The condition includes dimensions of blocks involved. If we limit the rectilinear blocks to L-shaped ones, a necessary and sufficient condition can be represented only in terms of the topology of the sequence-pair, without dimensions of blocks. A packing algorithm is designed as an SA search of the generated sequence-pairs. Experimental results show the effectiveness of the proposed method.

[1]  Takeshi Yoshimura,et al.  GRAPH THEORETICAL COMPACTION ALGORITHM. , 1985 .

[2]  Yoji Kajitani,et al.  VLSI module placement based on rectangle-packing by the sequence-pair , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  W. Dai,et al.  Arbitrary rectilinear block packing based on sequence pair , 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).

[4]  James A. McHugh,et al.  Algorithmic Graph Theory , 1986 .

[5]  Yoji Kajitani,et al.  Module placement on BSG-structure and IC layout applications , 1996, ICCAD 1996.

[6]  Chak-Kuen Wong,et al.  An Algorithm to Compact a VLSI Symbolic Layout with Mixed Constraints , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[7]  Chung-Kuan Cheng,et al.  A building block placement tool , 1997, Proceedings of ASP-DAC '97: Asia and South Pacific Design Automation Conference.

[8]  Y. Kajitani,et al.  The multi-BSG: stochastic approach to an optimum packing of convex-rectilinear blocks , 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).

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

[10]  H. Murata,et al.  Packing of L‐shaped and rectangular modules using sequence‐pair method , 2002 .

[11]  Jin Xu,et al.  Rectilinear block placement using sequence-pair , 1998, ISPD '98.

[12]  Wayne Wei-Ming Dai,et al.  General floorplanning with L-shaped, T-shaped and soft blocks based on bounded slicing grid structure , 1997, Proceedings of ASP-DAC '97: Asia and South Pacific Design Automation Conference.

[13]  Yoji Kajitani,et al.  Module packing based on the BSG-structure and IC layout applications , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  Yoji Kajitani,et al.  Module placement on BSG-structure with pre-placed modules and rectilinear modules , 1998, Proceedings of 1998 Asia and South Pacific Design Automation Conference.