By Topic

A flexible clustering and floor planning approach to standard cell placement using hierarchical simulated annealing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Lee, Y.W. ; Dept. of Electr. & Electron. Eng., Hong Kong Univ., Hong Kong ; Cheung, Y.S. ; Yeung, S.K.

Conventional simulated annealing algorithm, which works on the flattened circuit, has a very large search space and hence requires a huge computational effort. In this research, a hierarchical strategy was established. The placement problem is divided into three sub-problems: clustering, floorplanning and final placement. This research is different from a previous work, which used similar strategy, allowing clusters to occupy more than one row and have variable aspect-ratio in the stage of floorplanning. The sub-tasks of clustering and floorplanning could be finished with small amount of CPU time. The sub-task of final placement was done by modified version of the well-known TimberWolfSC program. It was found that, as a consequence of the hierarchical approach, the search-efficiency of the final placement is improved significantly over the conventional non-hierarchical approach

Published in:

Circuits and Systems, 1991. Conference Proceedings, China., 1991 International Conference on

Date of Conference:

16-17 Jun 1991