Floorplanning by A Revised 3-D Corner Block List with sub-C+-tree

In this paper we present a 3-D floorplan representation based on the methodologies of Corner Block List (CBL). Our model is an extension and generalization of the original 2-D CBL and inherits its most crucial advantages including: linear time operations and evaluations, relatively small solution space (<n!3) with complex non-slicing structures, etc. Although like other sequence based representations, the solution space of 3-D CBL is not complete, floorplanning algorithms using this 3-D representation can be highly efficient. Our conclusions are confirmed by experimental results.

[1]  Yoji Kajitani,et al.  Space-planning: placement of modules with controlled empty area by single-sequence , 2004, ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753).

[2]  Ronald L. Graham,et al.  Revisiting floorplan representations , 2001, ISPD '01.

[3]  Yao-Wen Chang,et al.  Temporal floorplanning using 3D-subTCG , 2004, ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753).

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

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

[6]  Jun Gu,et al.  ECBL: an extended corner block list with solution space including optimum placement , 2001, ISPD '01.

[7]  Sheqin Dong,et al.  An improved P-admissible floorplan representation based on Corner Block List , 2005, ASP-DAC.

[8]  Martin D. F. Wong,et al.  Floorplanning for 3-D VLSI design , 2005, Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005..