Cart (Loading....) | Create Account
Close category search window
 

Cell Merge: A basic-pre-clustering clustering algorithm for placement

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

3 Author(s)
Xin Zhang ; Fac. of Sci., Kochi Univ., Kochi, Japan ; Takeuchi, T. ; Toyonaga, M.

In DSM era, digital circuits can contain millions placeable elements, and the complexity and the size of circuits have grown exponentially. For reducing the circuit sizes, clustering algorithm have become popular, so that the placement process can be performed faster and with higher quality. In this paper, we proposed a novel basic-pre-clustering clustering algorithm called Cell Merge which can reduce effectively the circuit size. The algorithm has proven a linear-time complexity of O(n), where n is the number of nets in a circuit. The numerical experiments on ISPD02 IBM-MS mixed-size benchmark suite for placement show that by applying Cell Merge as a processing step, the performance of state-of-the-art placer can be further improved.

Published in:

IC Design and Technology, 2009. ICICDT '09. IEEE International Conference on

Date of Conference:

18-20 May 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.