Timing-driven floor-planning algorithm for building block layout

In this paper, we propose a timing-driven floorplanning algorithm for general building block layout. Our basic idea is based on floorplan enumeration and Zero-Slack algorithm. In our system, floorplanning is performed hierarchically followed by an incremental global routing. Whenever a node in cluster tree is floorplanned, all possible floorplan patterns are enumerated and then the floorplan pattern with best timing behavior and area, shape matches is chosen as solution. Due to our work's background, without the cost of limited floorplan patterns in BEAR, we are awarded by good performance and routability. The complexity analysis is presented also.