By Topic

Simple eigenvector-based circuit clustering can be effective [VLSI CAD]

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)
C. J. Alpert ; Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA ; A. B. Kahng

Clustering has proven effective in improving the quality of VLSI netlist partitioning and placement algorithms. A wide variety of clustering schemes have been proposed, including random walks, iterative matching, and fairly complicated spectral techniques. We use eigenvectors to compute a clustering, but do so in the simplest, most obvious manner. Our algorithm first computes a d-digit code for each module vi according to the signs of the ith entries in a set of d eigenvectors. Then, modules with the same code are assigned to the same cluster. Despite its simplicity, this new clustering algorithm is strongly motivated by theoretical results for both spectral bipartitioning and multi-dimensional vector partitioning. The algorithm also has linear time complexity (not including the eigenvector computation) and is at least as effective as previous clustering algorithms in terms of two-phase Fiduccia-Mattheyses bipartitioning

Published in:

Circuits and Systems, 1996. ISCAS '96., Connecting the World., 1996 IEEE International Symposium on  (Volume:4 )

Date of Conference:

12-15 May 1996