The Community for Technology Leaders
Computer-Aided Design, International Conference on (2003)
San Jose, CA
Nov. 9, 2003 to Nov. 13, 2003
ISSN: 1092-3152
ISBN: 1-58113-762-1
pp: 66
Martin D. F. Wong , UIUC, Urbana, IL
Xiaoping Tang , Cadence Design Systems, San Jose, CA
Hua Xiang , UIUC, Urbana, IL
ABSTRACT
In this paper, we present an integrated approach to floorplanning and bus planning, i.e., bus-driven floorplanning (BDF). We are given a set of circuit blocks and the bus specifications (i.e., the net list of blocks for the buses). A feasible BDF solution is a placement of all circuit blocks such that each bus can be realized as a rectangular strip (horizontal or vertical) going through all the blocks connected by the bus. The objective is to determine a feasible BDF solution that minimizes floorplan area and total bus area. Our approach is based upon the sequence-pair floorplan representation. After a careful analysis of the relationship between bus ordering and block ordering in the floorplan represented by a sequence pair, we derive feasibility conditions on sequence pairs that give feasible BDF solutions. Experimental results demonstrate the efficiency and effectiveness of our algorithm.
INDEX TERMS
null
CITATION
Martin D. F. Wong, Xiaoping Tang, Hua Xiang, "Bus-Driven Floorplanning", Computer-Aided Design, International Conference on, vol. 00, no. , pp. 66, 2003, doi:10.1109/ICCAD.2003.1257588
92 ms
(Ver 3.3 (11022016))