Reduction of Sizes of Decision Diagrams by Autocorrelation Functions

This paper discusses optimization of decisions diagrams (DDs) by total autocorrelation functions. We present an efficient algorithm for construction of linearly transformed binary decision diagrams (LT-BDDs) and Linearly transformed multiterminal BDDs (LT-MTBDDs) for systems of Boolean functions, based on linearization of these functions by the corresponding autocorrelation functions. Then, we present a method for reduction of sizes of DDs by a level-by-level reduction of the width of DDs using the total autocorrelation functions. The approach provides for a simple procedure for minimization of LT-BDDs and LT-MTBDDs and upper bounds on their sizes. Experimental results for benchmarks illustrate that the proposed method on average is very efficient.

[1]  Christoph Meinel,et al.  Linear sifting of decision diagrams , 1996, Universität Trier, Mathematik/Informatik, Forschungsbericht.

[2]  Rolf Drechsler,et al.  Minimization of BDDs using linear transformations based on evolutionary techniques , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).

[3]  Claudio Moraga,et al.  Spectral Transform Decision Diagrams , 1996 .

[4]  Rolf Drechsler,et al.  BDD Minimization by Linear Transformations , 1998 .

[5]  R. Rudell.  Dynamic variable ordering for ordered binary decision diagrams , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[6]  Masahiro Fujita,et al.  On variable ordering of binary decision diagrams for the application of multi-level logic synthesis , 1991, Proceedings of the European Conference on Design Automation..

[7]  Jochen Bern,et al.  Efficient OBDD-Based Boolean Manipulation in CAD Beyond Current Limits , 1995, 32nd Design Automation Conference.

[8]  Ingo Wegener,et al.  Optimal ordered binary decision diagrams for read-once formulas , 2000, Discret. Appl. Math..

[9]  Robert J. Lechner.  SYNTHESIS OF ENCODED PLAS1 , 1985 .

[10]  Ingo Wegener,et al.  Worst case examples for operations on OBDDs , 2000, Inf. Process. Lett..

[11]  Rolf Drechsler,et al.  Linear transformations and exact minimization of BDDs , 1998, Proceedings of the 8th Great Lakes Symposium on VLSI (Cat. No.98TB100222).

[12]  Rolf Drechsler,et al.  Efficient manipulation algorithms for linearly transformed BDDs , 1999, 1999 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (Cat. No.99CH37051).

[13]  Fabio Somenzi,et al.  Symmetry detection and dynamic variable ordering of decision diagrams , 1994, ICCAD '94.

[14]  Robert K. Brayton,et al.  BDD minimization by truth table permutations , 1996, 1996 IEEE International Symposium on Circuits and Systems. Circuits and Systems Connecting the World. ISCAS 96.

[15]  J. Astola,et al.  Binary polynomial transforms and nonlinear digital filters , 1995 .

[16]  Detlef Sieling.  On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization (Extended Abstract) , 1998, STACS.

[17]  R. Bryant.  Graph-Based Algorithms for Boolean Function Manipulation12 , 1986 .

[18]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[19]  F. Somenzi,et al.  Who are the variables in your neighbourhood , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[20]  Rolf Drechsler,et al.  Binary Decision Diagrams , 1978, IEEE transactions on computers.

[21]  Christoph Meinel,et al.  Linear sifting of decision diagrams and its application insynthesis , 2000, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[22]  Shin-ichi Minato,et al.  Graph-Based Representations of Discrete Functions , 1996 .

[23]  Radomir S. Stankovic,et al.  Decision diagrams for discrete functions: classification and unified interpretation , 1998, Proceedings of 1998 Asia and South Pacific Design Automation Conference.

[24]  Masahiro Fujita,et al.  Fast spectrum computation for logic functions using binary decision diagrams , 1994, Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94.

[25]  Tsutomu Sasao,et al.  Switching Theory for Logic Synthesis , 1999, Springer US.

[26]  Beate Bollig,et al.  Improving the Variable Ordering of OBDDs Is NP-Complete , 1996, IEEE Trans. Computers.