Share Email Print

Proceedings Paper

Timing-driven floor-planning algorithm for building block layout
Author(s): Tianming Kong; Xianlong Hong
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

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.

Paper Details

Date Published: 22 March 1996
PDF: 6 pages
Proc. SPIE 2644, Fourth International Conference on Computer-Aided Design and Computer Graphics, (22 March 1996); doi: 10.1117/12.235562
Show Author Affiliations
Tianming Kong, Tsinghua Univ. (China)
Xianlong Hong, Tsinghua Univ. (China)

Published in SPIE Proceedings Vol. 2644:
Fourth International Conference on Computer-Aided Design and Computer Graphics
Shuzi Yang; Ji Zhou; Cheng-Gang Li, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?