By Topic

PIN count prediction in ratio cut partitioning for VLSI and ULSI

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

1 Author(s)
Stroobannt, D. ; ELIS Dept., Ghent Univ.

Partitioning is an important step in computer-aided design. The `ratio cut' bipartitioning algorithm is known to be one of the best partitioning algorithms. It partitions a circuit into two (disjoint) modules by cutting some of its nets. Based on theoretical arguments, the cost function that is minimized for finding the best partitioning structure in the circuit is set to be the ratio of the number of nets cut to the product of the module sizes. In previous work, we showed that the ratio should contain the number of pins created by all cuts instead of the number of cuts itself to include multi-terminal nets properly. In this paper, we propose a change of the ratio denominator by introducing an accurate estimate of the number of pins resulting from the cuts. We suggest to use Rent's rule for pin count prediction. Results show improvements over the classical `ratio cut' algorithm

Published in:

Circuits and Systems, 1999. ISCAS '99. Proceedings of the 1999 IEEE International Symposium on  (Volume:6 )

Date of Conference:

Jul 1999