A new efficient topological structure for floorplanning in 3D VLSI physical design

Floorplanning is a key problem in VLSI physical design. The floorplanning problem can be formulated as that a given set of 3D rectangular blocks while minimizing suitable cost functions. Here, we are concentrating on the minimization of the total volume of 3D die. In this paper, first we propose a new topological structure using weighted directed graph of a floorplaning problem in 3D VLSI physical design. But here the main question is this structure is effective or not. For this, we give the idea of a new algorithm to minimize the volume of 3D die in floorplanning problem using this new representation technique. It is interesting to see that our proposed structure is also capable to calculate the total volume and position of the dead spaces if dead spaces exist. Next, we give the experimental result of our new algorithm and then conclude the paper.

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

[2]  Ian O'Connor,et al.  3D-IC floorplanning: Applying meta-optimization to improve performance , 2011, 2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip.

[3]  Zhi-Wei Chen,et al.  Thermal via planning for temperature reduction in 3D ICs , 2010, 23rd IEEE International SOC Conference.

[4]  Yao-Wen Chang,et al.  Corner sequence - a P-admissible floorplan representation with a worst case linear-time packing scheme , 2003, IEEE Trans. Very Large Scale Integr. Syst..

[5]  Naveed A. Sherwani,et al.  Algorithms for VLSI Physical Design Automation , 1999, Springer US.

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

[7]  Evangeline F. Y. Young,et al.  Twin binary sequences: a non-redundant representation for general non-slicing floorplan , 2002, ISPD '02.

[8]  Chung-Kuan Cheng,et al.  Representing topological structures for 3-D floorplanning , 2009, 2009 International Conference on Communications, Circuits and Systems.

[9]  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..

[10]  Ronald L. Graham,et al.  Floorplan representations: Complexity and connections , 2003, TODE.

[11]  Sheqin Dong,et al.  3D CBL: an efficient algorithm for general 3D packing problems , 2005, 48th Midwest Symposium on Circuits and Systems, 2005..

[12]  Sheqin Dong,et al.  3D CBL: An Efficient Algorithm for General 3-Dimensional Packing Problems * , 2005 .

[13]  Yici Cai,et al.  Hierarchical 3-D Floorplanning Algorithm for Wirelength Optimization , 2006, IEEE Transactions on Circuits and Systems I: Regular Papers.