Hierarchical 3-D floorplanning algorithm for wirelength optimization

Zhuoyuan Li

doi:10.1109/TCSI.2006.883857

Hierarchical 3-D floorplanning algorithm for wirelength optimization

2006-12-01

44

PRE

AI

DOI：10.1109/TCSI.2006.883857

Original

Original request for help

Save

Abstract

En 中文

Three-dimensional (3-D) IC physical design problems are usually of higher complexity, with a greatly enlarged solution space due to multiple device structure. In this paper, a new 3-D floorplanning algorithm is proposed for wirelength optimization. Our main contributions and results can be summarized as follows. First, a new hierarchical flow of 3-D floorplanning with a new inter-layer partitioning method. The blocks are partitioned into different layers before floorplanning. A simulated annealing (SA) engine is used to partition blocks with the objective of minimizing the statistical wirelength estimation results. The solution quality is not degraded by the hierarchical flow. Second, floorplans; of all the layers are generated in a SA process. Original 3-D floorplanning problem is transformed into solving several 2-D floorplanning problems simultaneously. The solution space is scaled down to maintain a low design complexity. Finally, Experimental results show that our algorithm improves wirelength by 14%-51% compared with previous 3-D floorplanning algorithms. The hierarchical approach is proven to be very efficient and offers a potential way for high-performance 3-D design.

Keywords:

computer-aided design (CAD)

integrated_circuit_layout

optimization

very large-scale integration (VLSI)

Hierarchical 3-D floorplanning algorithm for wirelength optimization

Abstract

AI Summary

Journal

Organization