Compressing Binary Decision Diagrams
نویسندگان
چکیده
The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in linear time in the size of the BDD and compression will in many cases reduce the size of the BDD to 1-2 bits per node. Empirical results for our compression technique are presented, including comparisons with previously introduced techniques, showing that the new technique dominate on all tested instances.
منابع مشابه
Using Ordered Binary-Decision Diagrams for Compressing Images and Image Sequences
The Ordered Binary-Decision Diagram (OBDD) has been used to reduce the amount of space and computation required for verifying digital circuits by removing redundant copies of subfunctions. Similarly, image compression algorithms attempt to reduce their space requirements by nding replicated patterns or features in images. OBDDs would therefore appear to be a good candidate as a data structure f...
متن کاملNumeric Function Generators Using Decision Diagrams for Discrete Functions
This paper introduces design methods for numeric function generators (NFGs) using decision diagrams. NFGs are hardware accelerators to compute values of numeric functions such as trigonometric, logarithmic, square root, and reciprocal functions. Most existing design methods for NFGs are intended only for a specific class of numeric functions. However, by using decision diagrams for discrete fun...
متن کاملFunction-driven Linearly Independent Expansions of Boolean Functions
The paper presents a family of new expansions of Boolean functions called Function-driven Linearly Independent (fLI) expansions. On the basis of this expansion a new kind of a canonical representation of Boolean functions is constructed: Function-driven Linearly Independent Binary Decision Diagrams (fLIBDDs). They generalize both Function-driven Shannon Binary Decision Diagrams (fShBDDs) and Li...
متن کاملA New Approach for Finding the various Optimal Variable Ordering to Generate the Binary Decision Diagrams (BDD) of a Computer Communication Network
In this paper we have adopted a new approach for finding the various optimal ordering to generate the binary decision diagrams of a computer communication network. We have shown that these binary decision diagrams are of minimum size and take same time to generate. If two binary decision diagrams have the same size and representing the same Boolean function, then these binary decision diagrams ...
متن کاملA Unifying Approach to Edge-valued and Arithmetic Transform Decision Diagrams
This paper shows that binary decision diagrams (BDDs) and their generalizations are not only representations of switching and integer-valued functions, but also Fourier-like series expansions of them. Furthermore, it shows that edge-valued binary decision diagrams (EVBDDs) are related to arithmetic transform decision diagrams (ACDDs), which are the integer counterparts of the functional decisio...
متن کامل