By Topic

On an efficient method for estimating the interconnection complexity of designs and on the existence of region III in Rent's rule

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)
Stroobandt, D. ; Dept. of Electron. & Inf. Syst., Ghent Univ., Belgium

The interconnection complexity of digital designs can be captured by the well-known Rent exponent, described by Landman and Russo [1971]. In this paper we present an efficient method for obtaining the Rent exponent of a design through a hierarchical partitioning algorithm. Experimental results not only confirm the Landman and Russo observations of a region I and region II but also show a hitherto unknown region 12%

Published in:

VLSI, 1999. Proceedings. Ninth Great Lakes Symposium on

Date of Conference:

4-6 Mar 1999