Exact and Heuristic Minimization of the Average Path Length in Decision Diagrams
暂无分享,去创建一个
[1] 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..
[2] Michael L. Dertouzos,et al. Threshold Logic: A Synthesis Approach , 1965 .
[3] R. Rudell. Dynamic variable ordering for ordered binary decision diagrams , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).
[4] Tiziano Villa,et al. Multi-valued decision diagrams: theory and applications , 1998 .
[5] S. Yang,et al. Logic Synthesis and Optimization Benchmarks User Guide Version 3.0 , 1991 .
[6] Luca Benini,et al. Decision Diagrams and Pass Transistor Logic Synthesis , 1997 .
[7] Sachin S. Sapatnekar,et al. Efficient Layout Synthesis Algorithm for Pass Transistor Logic Circuits , 2002, IWLS.
[8] F. Somenzi,et al. Using lower bounds during dynamic BDD minimization , 2001 .
[9] Luciano Lavagno,et al. Synthesis of software programs for embedded control applications , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[10] R. Brayton,et al. Software synthesis from synchronous specifications using logic simulation techniques , 2002, Proceedings 2002 Design Automation Conference (IEEE Cat. No.02CH37324).
[11] Tsutomu Sasao,et al. On the average path length in decision diagrams of multiple-valued functions , 2003, 33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings..
[12] M. Ciesielski,et al. BDS: a BDD-based logic optimization system , 2000, Proceedings 37th Design Automation Conference.
[13] Rolf Drechsler,et al. Implementing a multiple-valued decision diagram package , 1998, Proceedings. 1998 28th IEEE International Symposium on Multiple- Valued Logic (Cat. No.98CB36138).
[14] Tsutomu Sasao,et al. A method to represent multiple-output switching functions by using multi-valued decision diagrams , 1996, Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96).
[15] Shinobu Nagayama,et al. Compact representations of logic functions using heterogeneous MDDs , 2003, 33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings..
[16] Alexander Saldanha,et al. Fast discrete function evaluation using decision diagrams , 1995, ICCAD.
[17] Shinobu Nagayama,et al. Minimization of average path length in BDDs by variable reordering , 2003 .
[18] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[19] Tsutomu Sasao,et al. Switching Theory for Logic Synthesis , 1999, Springer US.
[20] Fabio Somenzi,et al. Symmetry detection and dynamic variable ordering of decision diagrams , 1994, ICCAD '94.
[21] Sharad Malik,et al. Fast functional simulation using branching programs , 1995, ICCAD.
[22] Rolf Drechsler,et al. Combination of lower bounds in exact BDD minimization , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.
[23] Tsutomu Sasao,et al. A hardware simulation engine based on decision diagrams , 2000, Proceedings 2000. Design Automation Conference. (IEEE Cat. No.00CH37106).
[24] Stanley L. Hurst,et al. Spectral techniques in digital logic , 1985 .
[25] TingTing Hwang,et al. Binary decision diagram with minimum expected path length , 2001, Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001.
[26] R. Drechsler,et al. Transformations amongst the Walsh, Haar, Arithmetic and Reed-Muller Spectral Domains , 2001 .
[27] Tsutomu Sasao,et al. Comparison of Decision Diagrams for Multiple-Output Logic Functions , 2002, IWLS.
[28] Tsutomu Sasao,et al. Average Path Length as a Paradigm for the Fast Evaluation of Functions Represented by Binary Decision Diagrams , 2002 .
[29] Tsutomu Sasao,et al. Heuristics to Minimize Multiple-Valued Decision Diagrams , 2000 .