Referenced Items are not available for this document.
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
Date of Conference: 28 Feb-3 Mar 1994
- Page(s):
- 200 - 207
- Meeting Date :
- 28 Feb 1994-03 Mar 1994
- Print ISBN:
- 0-8186-5410-4
- INSPEC Accession Number:
- 4687675
- Conference Location :
- Paris
- Digital Object Identifier :
- 10.1109/EDTC.1994.326915
- Product Type:
- Conference Publications
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
