Efficient minimization and manipulation of linearly transformed binary decision diagrams

Binary decision diagrams are widely used in many applications in VLSI CAD. Linear transformations are one way to increase the computational power of BDD. In this paper, we study linearly transformed BDD (LTBDD) from a practical point of view. First, we describe minimization techniques for LTBDD. Then, we present efficient manipulation algorithms for LTBDD. We give a large set of experimental results to demonstrate the efficiency of the algorithms.