DTS: A Tree Based Representation for 3D-Block Packing

3D packing problem is to arrange rectangular boxes (blocks) of given sizes in a rectangular box of the minimum volume without overlapping each other. As a representation for 3D packings, this paper proposes a novel encoding method, called DTS (double tree and sequence). The feature of the DTS is: (1) It can represent any minimal packings. (2) The size of the solution space (the number of codes) of DTS is much smaller than any conventional representation which can represent any packings. Experimental comparisons with conventional representations indicate the superiority of the proposed representation DTS

[1]  Yao-Wen Chang,et al.  Temporal floorplanning using the T-tree formulation , 2004, IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004..

[2]  I. Goulden,et al.  Combinatorial Enumeration , 2004 .

[3]  M. Kaneko,et al.  3D scheduling based on code space exploration for dynamically reconfigurable systems , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).

[4]  Chikaaki Kodama,et al.  Evaluation of 3D-packing representations for scheduling of dynamically reconfigurable systems , 2006, 2006 IEEE International Symposium on Circuits and Systems.

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

[6]  Takeshi Yoshimura,et al.  Floorplanning using a tree representation , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Yao-Wen Chang,et al.  TCG: a transitive closure graph-based representation for non-slicing floorplans , 2001, DAC '01.

[8]  L. Cheng Floorplan Design for 3-D ICs , 2004 .

[9]  R. Otten Automatic Floorplan Design , 1982, DAC 1982.

[10]  Yao-Wen Chang,et al.  Temporal floorplanning using 3D-subTCG , 2004 .

[11]  Yoji Kajitani,et al.  The 3 D-Packing by Meta Data Structure and Packing Heuristics , 2000 .

[12]  Chia-Lin Yang,et al.  Temporal floorplanning using the T-tree formulation , 2004, ICCAD 2004.

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