
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Rolf Drechsler, Bernd Becker, Andrea Jahnke, "On Variable Ordering and Decomposition Type Choice in OKFDDs," IEEE Transactions on Computers, vol. 47, no. 12, pp. 13981403, December, 1998.  
BibTex  x  
@article{ 10.1109/12.737685, author = {Rolf Drechsler and Bernd Becker and Andrea Jahnke}, title = {On Variable Ordering and Decomposition Type Choice in OKFDDs}, journal ={IEEE Transactions on Computers}, volume = {47}, number = {12}, issn = {00189340}, year = {1998}, pages = {13981403}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.737685}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  On Variable Ordering and Decomposition Type Choice in OKFDDs IS  12 SN  00189340 SP1398 EP1403 EPD  13981403 A1  Rolf Drechsler, A1  Bernd Becker, A1  Andrea Jahnke, PY  1998 KW  Decision diagrams KW  OKFDDs KW  variable ordering KW  treelike circuits. VL  47 JA  IEEE Transactions on Computers ER   
Abstract—We present methods for the construction of small Ordered Kronecker Functional Decision Diagrams (OKFDDs). OKFDDs are a generalization of Ordered Binary Decision Diagrams (OBDDs) and Ordered Functional Decision Diagrams (OFDDs) as well. Starting with an upper bound for the size of an OKFDD representing a treelike circuit, we develop different heuristics to find good variable orderings and decomposition types for OKFDDs representing twolevel and multilevel circuits, respectively. Experimental results are presented to show the efficiency of our approaches.
[1] D.P. Appenzeller and A. Kuehlmann, “Formal Verification of a PowerPC Microprocessor,” Proc. Int'l Conf. ComputerAided Design (ICCAD), pp. 7984, San Jose, Calif., Nov. 1995.
[2] B. Becker, R. Drechsler, and M. Theobald, "OKFDDs versus OBDDs and OFDDs," Proc. Int'l Colloquium Automata, Languages, and Programming, pp. 475486, 1995.
[3] B. Becker, R. Drechsler, and R. Werchner, On the Relation between BDDs and FDDs Information and Computation, vol. 123, no. 2, pp. 185197, 1995.
[4] R.K. Brayton, G.D. Hachtel, C.T. McMullen, and A.L. SangiovanniVincintelli, Logic Minimization Algorithms for VLSI Synthesis.Boston: Kluwer Academic, 1984.
[5] F. Brglez, D. Bryan, and K. Kozminski, "Combinatorial Profiles of Sequential Benchmark Circuits," Proc. IEEE Int'l. Symp. Circuits and Systems, IEEE Computer Soc. Press, Los Alamitos, Calif., 1989, pp. 19291934.
[6] R.E. Bryant, "GraphBased Algorithms for Boolean Function Manipulation," IEEE Trans. Computers, Vol. C35, No. 8, Aug. 1986, pp. 667690.
[7] R.E. Bryant, "On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication," IEEE Trans. Computers, vol. 40, no. 2, pp. 206213, Feb. 1991.
[8] R.E. Bryant, "Symbolic Boolean Manipulation with Ordered BinaryDecision Diagrams," ACM Computing Surveys, vol., 24 no. 3, pp. 293318, 1992.
[9] K.M. Butler and M.R. Mercer, Assessing Fault Model and Test Quality. Kluwer Academic, 1992.
[10] R. Drechsler and B. Becker, "Dynamic Minimization of OKFDDs," Proc. Int'l Conf. Computer Design, pp. 602607, 1995.
[11] R. Drechsler and B. Becker, "PUMA: An OKFDDPackage and Its Implementation," Univ. Booth at European Design and Test Conf., 1995.
[12] R. Drechsler, A. Sarabi, M. Theobald, B. Becker, and M.A. Perkowski, Efficient Representation and Manipulation of Switching Functions Based on Ordered Kronecker Functional Decision Diagrams Proc. Design Automation Conf., pp. 415419, 1994.
[13] R. Drechsler, M. Theobald, and B. Becker, "Fast OFDD Based Minimization of Fixed Polarity ReedMuller Expressions," Proc. European Design Automation Conf., pp. 27, 1994.
[14] M. Fujita, Y. Matsunaga, and T. Kakuda, “Interleaving Based Variable Ordering Methods for Ordered Binary Decision Diagrams,” Proc. Int'l Conf. ComputerAided Design, pp. 3841, 1993.
[15] M. Fujita, H. Fujisawa, and Y. Matsunaga, "Variable Ordering Algorithms for Binary Decision Diagrams and Their Evolution," IEEE Trans. ComputerAided Design, vol. 12, pp. 612, 1993.
[16] M. Fujita, Y. Matsunaga, and T. Kakuda, "On variable Ordering of Binary Decision Diagrams for the Application of MultiLevel Logic Synthesis," Proc. European Design Automation Conf., pp. 5054, 1991.
[17] U. Kebschull, E. Schubert, and W. Rosenstiel, Multilevel Logic Synthesis Based on Functional Decision Diagrams Proc. European Conf. Design Automation, pp. 4347, 1992.
[18] S. Malik, A.R. Wang, R.K. Brayton, and A. SangiovanniVincentelli, Logic Verification Using Binary Decision Diagrams in a Logic Synthesis Environment Proc. IEEE Int'l Conf. ComputerAided Design (ICCAD88), pp. 69, 1988.
[19] R. Rudell, "Dynamic Variable Ordering for Ordered Binary Decision Diagrams," Proc. ICCAD93, pp. 4247, 1993.
[20] E. Schubert, U. Kebschull, and W. Rosenstiel, "Some Optimizations for Functional Decision Diagrams," Proc. IFIP WG 10.5 Workshop Applications of the ReedMuller Expansion in Circuit Design, pp. 176180,Hamburg, Germany, 1993.
[21] C. Tsai and M. MarekSadowska,"Boolean matching using generalized ReedMuller forms," Proc. 31st ACM/IEEE Design Automation Conf., pp. 339344, June 1994.
[22] I. Wegener, "Comments on 'A Characterization of Binary Decision Diagrams'," IEEE Trans. Computers, vol. 43, pp. 383384, 1994.