By Topic

Circuit partitioning under capacity and I/O constraints

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

2 Author(s)
M. Shih ; Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA ; E. S. Kuh

This paper proposes an effective method for solving multi-way circuit partitioning problems under capacity (size) and I/O pin count constraints. The objective is the total net cuts among partitions. We first linearize the quadratic objective function into a linear function, then we assign circuit components sequentially according to this linear function while avoiding capacity or I/O violations. The resulting assignment (partitioning) is used to compute another linear cost function and the sequential assignment is repeated. This process can be iterated for a fix number of times to get a good final solution. Experimental results for several benchmark circuits are also given to demonstrate its effectiveness

Published in:

Custom Integrated Circuits Conference, 1994., Proceedings of the IEEE 1994

Date of Conference:

1-4 May 1994