Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Finding the optimal variable ordering for binary decision diagrams
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Efficient implementation of a BDD package
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Shared binary decision diagram with attributed edges for efficient Boolean function manipulation
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
DAC '94 Proceedings of the 31st annual Design Automation Conference
Graph driven BDDs—a new data structure for Boolean functions
Theoretical Computer Science
Verification of arithmetic circuits with binary moment diagrams
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
On the relation between BDDs and FDDs
Information and Computation
Binary decision diagrams and beyond: enabling technologies for formal verification
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Dynamic variable ordering for ordered binary decision diagrams
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Equivalence checking using cuts and heaps
DAC '97 Proceedings of the 34th annual Design Automation Conference
Logic synthesis for large pass transistor circuits
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Evolutionary algorithms for VLSI CAD
Evolutionary algorithms for VLSI CAD
On the computational power of linearly transformed BDDs
Information Processing Letters
Efficient Boolean Manipulation with OBDD's Can be Extended to FBDD's
IEEE Transactions on Computers
Local Encoding Transformations for Optimizing OBDD-Representations of Finite State Machines
FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
On the Relation Betwen BDDs and FDDs
LATIN '95 Proceedings of the Second Latin American Symposium on Theoretical Informatics
Towards One-Pass Synthesis
Some heuristics for generating tree-like FBDD types
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Fast exact minimization of BDD's
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Linear sifting of decision diagrams and its application in synthesis
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 14.98 |
Binary Decision Diagrams are widely used in many applications in VLSI CAD. Linear transformations are one way to increase the computational power of BDDs. In this paper, we study linearly transformed BDDs (LTBDDs) from a practical point of view. First, we describe minimization techniques for LTBDDs. Then, we present efficient manipulation algorithms for LTBDDs. We give a large set of experimental results to demonstrate the efficiency of the algorithms.