A path-oriented algorithm for the cell selection problem
Published in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems • Mar 1, 1995
NobleIDNI9P95W22R80S25
Authors:,
Moon Jung Chung
Sang‐Chul Kim
Abstract
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 T/sub max/ and the total area of selected cells is minimum. We first prove the strong NP-completeness of ...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!