Efficient manipulation algorithms for linearly transformed BDDs

Authors:
Wolfgang Günther;Rolf Drechsler
Affiliations:
Institute of Computer Science, Albert-Ludwigs-University, 79110 Freiburg im Breisgau, Germany;Institute of Computer Science, Albert-Ludwigs-University, 79110 Freiburg im Breisgau, Germany
Venue:
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Year:
1999

Citing 10
Cited 3

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication

IEEE Transactions on Computers
Efficient implementation of a BDD package

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Efficient representation and manipulation of switching functions based on ordered Kronecker functional decision diagrams

DAC '94 Proceedings of the 31st annual Design Automation Conference
Graph driven BDDs—a new data structure for Boolean functions

Theoretical Computer Science
Dynamic variable ordering for ordered binary decision diagrams

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Linear sifting of decision diagrams

DAC '97 Proceedings of the 34th annual Design Automation Conference
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 variable ordering of binary decision diagrams for the application of multi-level logic synthesis

EURO-DAC '91 Proceedings of the conference on European design automation

Application of linearly transformed BDDs in sequential verification

Proceedings of the 2001 Asia and South Pacific Design Automation Conference
A 3-step approach for performance-driven whole-chip routing

Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Linearization of logical functions defined by a set of orthogonal terms. I. Theoretical aspects

Automation and Remote Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

Binary Decision Diagrams (BDDs) are the state-of-the-art data structure in VLSI CAD. But due to their ordering restriction only exponential sized BDDs exist for many functions of practical relevance. Linear Transformations (LTs) have been proposed as a new concept to minimize the size of BDDs and it is known that in some cases even an exponential reduction can be obtained.In addition to a small representation, the efficient manipulation of a data structure is also important. In this paper we present polynomial time manipulation algorithms that can be used for Linearly Transformed BDDs (LT-BDDs) analogously to BDDs. For some operations, like synthesis algorithms based on ITE, it turns out that the techniques known from BDDs can be directly transferred, while for other operations, like quantification and cofactor computation, completely different algorithms have to be used. Experimental results are given to show the efficiency of the approach.