By Topic

VLSI floorplan generation and area optimization using AND-OR graph search

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
$33 $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)
P. S. Dasgupta ; Comput. Center, Indian Inst. of Manage., Calcutta, India ; S. Sur-Kolay ; B. B. Bhattacharya

Floorplan design based on rectangular dualization is considered in two phases. First, given the adjacency graph and sets of aspect ratios of the blocks, a topology is generated which is likely to yield a minimum-area floorplan during the second phase of optimal sizing. Since the problem of finding such topology seems to be intractable, a heuristic search method using AND-OR graphs is employed in the top-down first phase. Novel heuristic estimates are used to reduce the search effort. For slicing topologies, a bottom-up polynomial-time algorithm is used to solve the second phase. Moreover, the first phase is able to report inherently nonslicible floorplans. The proposed method outperforms the existing techniques, as evident from the experimental results

Published in:

VLSI Design, 1995., Proceedings of the 8th International Conference on

Date of Conference:

4-7 Jan 1995