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

Circuit delay optimization as a multiple choice linear knapsack program

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

1 Author(s)
Karkowski, I. ; Fac. of Electr. Eng., Delft Univ. of Technol., Netherlands

An efficient way for optimizing timing under constraints as an integer programming problem is presented. Actually, a surrogate dual of a mathematical programming problem is solved within global enumeration schemes. The kernel of each iteration is nothing else than an instance of the multiple choice linear knapsack problem, for which a O( n) algorithm exists. Arbitrary, discrete cost-delay functions for modeling circuits, which are especially suitable for Sea of Gates designs are used. Experiments confirm usefulness of this approach

Published in:

Design Automation, 1993, with the European Event in ASIC Design. Proceedings. [4th] European Conference on

Date of Conference:

22-25 Feb 1993

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.