Graph-based Algorithms for Boolean Function Manipulation (1986)
by Randal E. Bryant.
In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on the ordering of decision variables in the graph. Although a function requires, in the worst case, a graph of size exponential in the number of arguments, many of the functions encountered in typical applications have a more reasonable representation. Our algorithms have time complexity proportional to the sizes of the graphs being operated on, and hence are quite efficient as long as the graphs do not grow too large. We present experimental results from applying these algorithms to problems in logic design verification that demonstrate the practicality of our approach. Index Terms: Boolean functions, symbolic manipulation, binary decision diagrams, logic design verification. [via]
http://citeseerx.ist.psu.edu/viewdoc/download...
Note: We do not store any files or documents in our server.
algorithm
Related Files
Hot Spot
SEC 1: Elliptic Curve Cryptography
...This document specifies public-key cryptographic schemes based on elliptic curve cryptography (ECC). In particular, it specifies: - signature schemes; - encryption schemes; and - key agreement schemes. It also describes cryptographic primitives which are used to construct the schemes, and ASN.1 syntax for identifying the schemes. The..... detail »
SAssess: A Library for Behavioral Self-Assessment
...Developing and testing intelligent agents is a complex task that is both time-consuming and costly. This creates the potential that problems in the agent’s behavior will be realized only after the agent has been put to use. As a result, society is left with a vexing problem: although we can create agents that seem capable of performi..... detail »
Maple Experiments in Discrete Mathematics
...This book contains programming experiments that are designed to reinforce the learning of discrete mathematics. Most of the experiments are short and to the point, just like traditional homework problems, so that they reflect the daily classroom work. The experiments in the book are organized to accompany the first five chapters ..... detail »
Rate this Document
Popular eBooks
- Waves and Rays in Elastic Continua - Second Edition
- XHTML+Voice Programmer's Guide Version 1.0
- Education Advocacy: A Self-Help Tutorial for Parents
- NCURSES Programming HOWTO
- Message Passing Toolkit: MPI Programmer's Manual
- SHMEM Programming Manual
- Derby Server and Administration Guide - Version 10.3
- ActionScript Coding Standards
- Alternative and Herbal Livestock Health Sourcebook
- Java Platform Migration Guide Version 1.3 to 5.0
ADS
Tag Clouds
3d algorithm analysis application architecture design ebook energy framework guide java javascript kernel linux manual network paper programming python reference security software system theory thesis tutorial typography web service white paper xml
Last Download
- Paper and Board Manufacturing and Recycling
- Short Math Guide for LATEX
- Create Modern Web Sites Using HTML5 and CSS3
- Wine User Guide
- The Normal of a Fractal Surface
BookShelf
- JScript Tutorial
- OpenDocument Format Plug-in for Microsoft Office Suite
- Art History and Architecture
- Review of Linear System Theory
- Learning a Fast Emulator of a Binary Decision Process
...Before you read this manual, use the Getting Started with LabVIEW manual
as a tutorial to familiarize yourself with the LabVIEW graphical
programming environment and the basic LabVIEW features you u..
...Interpolation of two-dimensional shapes described by iterated function systems is explored. Iterated function systems define shapes using self-transformations, and interpolation of these shapes requir..