By Topic

A path-oriented algorithm for the cell selection problem

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)
Moon Jung Chung ; Dept. of Comput. Sci., Michigan State Univ., East Lansing, MI, USA ; Sangchul Kim

An algorithm for the cell selection problem is presented. Given a network G of logic gates, the problem is to select a library cell for each gate such that the longest delay through G is at most Tmax and the total area of selected cells is minimum. We first prove the strong NP-completeness of the problem if the circuit is a general acyclic graph. The proof implies that there exists no pseudopolynomial time algorithm unless P=NP. We next propose a path-oriented, heuristic algorithm that iteratively chooses paths of gates with delay larger than Tmax, and then selects cells for the paths. The set of paths chosen induces a series-parallel subgraph. We also present a cloning method which further improves a solution obtained by the path-oriented algorithm. In the proposed cloning method, nodes are duplicated into clones such that the resulting graph becomes a series-parallel graph. Our cloning method is more efficient in terms of time and space than the tree cloning of Chan (1990). The results of our algorithm are compared to those Lin et al. (1990). The algorithm provides significantly better solutions to all the circuits than the previous work

Published in:

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  (Volume:14 ,  Issue: 3 )