Compressing Binary Decision Diagrams

Authors:
Esben Rune Hansen;S. Srinivasa Rao;Peter Tiedemann
Affiliations:
IT-University of Copenhagen;MADALGO, Aarhus University, Denmark;IT-University of Copenhagen
Venue:
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Year:
2008

Citing 3
Cited 1

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Distributed Binary Decision Diagrams for Verification of Large Circuit

ICCD '96 Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors
Interactive distributed configuration

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming

Engineering a scalable Boolean matching based on EDA SaaS 2.0

Proceedings of the International Conference on Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.