By Topic

Efficient symbolic support manipulation

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)
Bill Lin ; IMEC Lab., Leuven, Belgium

An incompletely specified function can be given by an interval (g, h) or alternatively by a function f and a don't care set d. Depending on the assignment of don't cares, a different compatible function with a possibly support set may be derived. In this paper, efficient symbolic algorithms based on BDDs are presented for finding a compatible function with the minimum support. Efficient solution to this problem has important application in FPGA synthesis

Published in:

Computer Design: VLSI in Computers and Processors, 1993. ICCD '93. Proceedings., 1993 IEEE International Conference on

Date of Conference:

3-6 Oct 1993