By Topic

Boolean manipulation with free BDD's. First experimental results

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

4 Author(s)
Bern, J. ; Trier Univ., Germany ; Gergov, J. ; Meinel, C. ; Slobodova, A.

It is shown that Free Binary Decision Diagrams (FBDD's), with respect to a predefined type, provide a canonical representation and allow efficient solutions of the basic tasks in Boolean manipulation in a similar manner to the well-known OBDD's. However, in contrast to OBDD's, the FBDD's allow more succinct representations of Boolean functions. For experimentation we have used an FBDD-package and the types worked with are tree-based. Using different type-creating heuristics, we compare the size of FBDD-representations of some ISCAS benchmarks with the size of their OBDD-representations

Published in:

European Design and Test Conference, 1994. EDAC, The European Conference on Design Automation. ETC European Test Conference. EUROASIC, The European Event in ASIC Design, Proceedings.

Date of Conference:

28 Feb-3 Mar 1994