DocumentCode
1069957
Title
Hierarchical placement and floorplanning in BEAR
Author
Dai, W.W.-M.
Author_Institution
Board of Studies of Comput. Eng., California Univ., Santa Cruz, CA
Volume
8
Issue
12
fYear
1989
fDate
12/1/1989 12:00:00 AM
Firstpage
1335
Lastpage
1349
Abstract
Hierarchical placement and floorplanning algorithms for rectangular blocks are described and implemented as part of the BEAR building block layout system developed at the University of California at Berkeley. The algorithm combines the goal orientation of top-down approaches with the block orientation of bottom-up techniques. The result is a meet-in-the-middle strategy. It considers the mutual dependency between placement and routing explicitly by incorporating a novel method of hierarchical routing area estimation. If the layout includes flexible blocks, the placement result can be further optimized by resizing these blocks subject to constraints on their areas and aspect ratios. Placement and floorplanning are refined more and more (with possible topological change) as routing proceeds. Global routing is updated incrementally to eliminate the need for iterations between placement and routing, thus achieving a more uniform design flow
Keywords
VLSI; circuit layout CAD; integrated circuit technology; BEAR; CAD; IC design; VLSI; block orientation; bottom-up techniques; building block layout system; flexible blocks; floorplanning; global routing updating; goal orientation; hierarchical placement; hierarchical routing area estimation; rectangular blocks; top-down approaches; Circuits; Computer science; Constraint optimization; Fabrication; Feedback; Routing; Shape; Standards development; Very large scale integration; Wire;
fLanguage
English
Journal_Title
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
Publisher
ieee
ISSN
0278-0070
Type
jour
DOI
10.1109/43.44514
Filename
44514
Link To Document