By Topic

Efficient computation of the area/power consumption versus delay tradeoff curve for circuit critical path 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
$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

3 Author(s)
J. Sosa ; Res. Inst. for Appl. Microelectron., Univ. de Las Palmas de Gran Canaria, Spain ; J. A. Montiel-Nelson ; S. Nooshabadi

The paper introduces a novel methodology to obtain the entire area/power consumption versus delay tradeoff curve for the critical path of a combinational logic circuit in a very efficient way. Compared to other proposed ways based on the optimization of the whole circuit for every point of the tradeoff curve, in this work only a subset of the Boolean network representing the circuit is optimized each time. Performance comparison and results based on the MCNC'91 set of two-level benchmark circuits are given. It is demonstrated that the proposed methodology produces tradeoff curves for large circuits of thousands of gates greatly reducing the computation complexity (measured in number of variables of an equivalent linear programming problem) by a factor up to 16 times

Published in:

Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on  (Volume:5 )

Date of Conference: