论文信息 - Compressing Binary Decision Diagrams

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.

S. Srinivasa Rao | Esben Rune Hansen | Peter Tiedemann

[1] Albert R. Wang,et al. Logic verification using binary decision diagrams in a logic synthesis environment , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[2] Craig M. Chase,et al. Distributed binary decision diagrams for verification of large circuits , 1996, Proceedings International Conference on Computer Design. VLSI in Computers and Processors.

[3] Ingo Wegener,et al. Branching Programs and Binary Decision Diagrams , 1987 .

[4] Henrik Reif Andersen,et al. Interactive Distributed Configuration , 2006, CP.

[5] E BryantRandal. Graph-Based Algorithms for Boolean Function Manipulation , 1986 .

[6] Kenneth J. Supowit,et al. Finding the Optimal Variable Ordering for Binary Decision Diagrams , 1990, IEEE Trans. Computers.

[7] J. Prades-Nebot,et al. Lossless image compression using ordered binary-decision diagrams , 2001 .

[8] Esben Rune Hansen,et al. Compressing Configuration Data for Memory Limited Devices , 2007, AAAI.

[9] Randy Bryant,et al. Using Ordered Binary-Decision Diagrams for Compressing Images and Image Sequences. , 1995 .

[10] Jørn Lind-Nielsen,et al. BuDDy : A binary decision diagram package. , 1999 .

[11] Prof. Dr. Christoph Meinel,et al. Algorithms and Data Structures in VLSI Design , 1998, Springer Berlin Heidelberg.