By Topic

Algorithms for optimal introduction of redundant logic for timing and area optimization

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)
Lillis, J. ; California Univ., Los Angeles, CA, USA ; Chung-Kuan Cheng ; Lin, T.T.Y.

In this paper we study algorithms for systematically introducing redundant into a circuit for timing and formulations of the optimization problem. First we study a logic-level versions of the problem and show that they are NP-hard, but not in the strong sense. We then propose pseudo-polynomial algorithms for these problems. Second, we introduce a layout level problem formulation in which selection of fanout trees is constrained by physical locations of sink pins. For this version of the problem we formalize this constraint by imposing a sink ordering and propose an efficient algorithm based on shortest paths computations in a directed graph derived from the problem instance

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