
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Jon T. Butler, Tsutomu Sasao, Munehiro Matsuura, "Average Path Length of Binary Decision Diagrams," IEEE Transactions on Computers, vol. 54, no. 9, pp. 10411053, September, 2005.  
BibTex  x  
@article{ 10.1109/TC.2005.137, author = {Jon T. Butler and Tsutomu Sasao and Munehiro Matsuura}, title = {Average Path Length of Binary Decision Diagrams}, journal ={IEEE Transactions on Computers}, volume = {54}, number = {9}, issn = {00189340}, year = {2005}, pages = {10411053}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2005.137}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Average Path Length of Binary Decision Diagrams IS  9 SN  00189340 SP1041 EP1053 EPD  10411053 A1  Jon T. Butler, A1  Tsutomu Sasao, A1  Munehiro Matsuura, PY  2005 KW  Index Terms Binary decision diagrams KW  BDD KW  average path length KW  APL KW  worstcase path length. VL  54 JA  IEEE Transactions on Computers ER   
[1] C. Lee, “Representation of Switching Circuits by BinaryDecision Diagrams,” Bell System Technical J., vol. 19, pp. 685999, July 1959.
[2] R.E. Bryant, “GraphBased Algorithms for Boolean Function Manipulation,” IEEE Trans. Computers, vol. 35, no. 8, pp. 677691, Aug. 1986.
[3] N. Ishuira, H. Sawada, and S. Yajima, “Minimization of Binary Decision Diagrams Based on Exchanges of Variables,” Proc. IEEE Int'l Conf. ComputerAided Design, pp. 472475, Nov. 1991.
[4] R. Rudell, “Dynamic Variable Ordering for Ordered Binary Decision Diagrams,” Proc. IEEE Int'l Conf. ComputerAided Design, pp. 4247, Nov. 1993.
[5] R. Drechsler, N. Drechsler, and W. Gunther, “Fast Exact Minimization of BDDs,” IEEE Trans. ComputerAided Design, vol. 19, pp. 384389, Mar. 2000.
[6] S. Nagayama and T. Sasao, “On the Minimization of the Longest Path Length for Decision Diagrams,” Proc. Int'l Workshop Logic Synthesis, pp. 2835, June 2004.
[7] P. Ashar and S. Malik, “Fast Functional Simulation Using Branching Programs,” Proc. IEEE Int'l Conf. ComputerAided Design, pp. 308412, Nov. 1995.
[8] P.C. McGeer, K.L. McMillan, A. Saldanha, and A.L. SangiovanniVincentelli, “Fast Discrete Function Evaluation Using Decision Diagrams,” Proc. Int'l Conf. ComputerAided Design, pp. 402407, Nov. 1995.
[9] T. Sasao, Y. Iguchi, and M. Matsuura, “Comparison of Decision Diagrams for MultipleOutput Logic Functions,” Proc. 11th Int'l Workshop Logic Synthesis, pp. 379384, June 2002.
[10] Y.Y. Liu, K.H. Wang, T.T. Hwang, and C. Liu, “Binary Decision Diagram with Minimum Expected Path Length,” Proc. Design Automation and Test in Europe (DATE2001), pp. 15, Mar. 2001.
[11] S. Nagayama, A. Mischenko, T. Sasao, and J.T. Butler, “Minimization of Average Path Length in BDDs by Variable Reordering,” Proc. 12th Int'l Workshop Logic Synthesis, pp. 207213, May 2003.
[12] Y. Iguchi, T Sasao, and M. Matsuura, “Evaluation of MultipleOutput Logic Functions Using Decision Diagrams,” Proc. ASPDAC (Asia and South Pacific Design Automation Conf., pp. 312315, Jan. 2003.
[13] J. Butler and T. Sasao, “On the Average Path Length in Decision Diagrams of MultipleValued Functions,” Proc. 23rd Int'l Symp. MultipleValued Logic, pp. 383390, May 2003.
[14] D.A. Bell, “Decision Trees, Tables, and Lattices,” Pattern Recognition: Ideas in Practice, B.G. Batchelor, ed., chapter 5, New York: Plenum Press, 1978.
[15] D.E. Knuth, “Mathematical Analysis of Algorithms,” Proc. IFIP Congress 71, vol. 1, pp. 135143, 1971.
[16] M. Hanani, “An Optimal Evaluation of Boolean Expressions in an Online Query System,” Comm. ACM, vol. 20, pp. 344347, May 1977.
[17] W. Qin and S. Malik, “Automated Synthesis of Efficient Binary Decoders for Retargetable Software Toolkits,” Design Automation Conf., pp. 764769, June 2003.
[18] B.N.E. Moret, “Decision Trees and Diagrams,” Computing Surveys, vol. 14, pp. 593623, Dec. 1982.
[19] S.K. Murthy, “Automatic Construction of Decision Trees from Data: A MultiDisciplinary Survey,” Data Mining and Knowledge Discovery, vol. 2, pp. 345389 Oct. 1998.
[20] Y. Breithart and S. Gal, “Analysis of Algorithms of the Evaluation of Monotonic Boolean Functions,” IEEE Trans. Computers, vol. 27, no. 11, pp. 10831087, Nov. 1978.
[21] T. Sasao and K. Kinoshita, “On the Number of FanoutFree Functions and Unate Cascade Function,” IEEE Trans. Computers, vol. 28, no. 9, pp. 682685, Sep. 1979.
[22] T. Sasao, Switching Theory for Logic Synthesis. New York: Kluwer Academic, 1999.
[23] B.N.E. Moret, M.G. Thomason, and R.C. Gonzalez, “Symmetric and Threshold Boolean Functions Are Exhaustive,” IEEE Trans. Computers, vol. 32, no. 12, pp. 12111212, Dec. 1983.
[24] F. Brglez and H. Fujiwara, “A Neutral Netlist of 10 Combinational Benchmark Circuits,” Proc. IEEE Int'l Symp. Circuits and Systems, pp. 695698, 1985.
[25] C.L. Liu, Introduction to Combinatorics. New York: McGrawHill, 1968.
[26] J. Riordan, Combinatorial Identities, p. 31. New York: John Wiley & Sons, 1968.
[27] T. Sasao, Y. Iguchi, and M. Matsuura, “Comparison of Decision Diagrams for MultipleOutput Logic Functions,” Proc. Int'l Workshop Logic and Synthesis, pp. 379384, June 2002.
[28] M. Tachibana, “Heuristic Algorithms for FBDD Node Minimization with Application to PassTransistorLogic and DCVS Synthesis,” Proc. Workshop Synthesis And System Integration of MIxed Technologies (SASIMI), pp. 96101, Nov. 1996.
[29] K. Yano, Y. Sasaki, K. Rikino, and K. Seki, “TopDown PassTransistor Logic Design,” IEEE J. Solid State Circuits, vol. 31, pp. 792803. June 1996.
[30] C. Scholl and B. Becker, “On the Generation of Multiplexer Circuits for Pass Transistor Logic,” Proc. Design Automation and Test in Europe, pp. 372378, 2000.
[31] T.H. Liu, M.K. Ganai, A. Aziz, and J.L. Burns, “Performance Driven Synthesis for Pass Transistor Logic,” Proc. Int'l Workshop Logic Synthesis, pp. 255259, 1998.
[32] C. Yang and M. Ciesielski, “BDS: A BDDBased Logic Optimization System,” IEEE Trans. CAD, vol. 27, no. 7, pp. 866876, 2002.
[33] R. Ebendt, W. Gunther, and R. Dreschler, “Minimization of Expected Path Length in BDDs Based on Local Changes,” Proc. ASPDAC (Asia and South Pacific Design Automation Conf., pp. 866871, Jan. 2004.