메뉴 건너뛰기




Volumn 22, Issue 12, 2003, Pages 1657-1663

An Improved Branch and Bound Algorithm for Exact BDD Minimization

Author keywords

Binary decision diagram (BDD); Exact minimization; Logic synthesis; Pass transistor logic

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; COMPUTER AIDED LOGIC DESIGN; DECISION THEORY; ELECTRIC NETWORK SYNTHESIS; GRAPHIC METHODS; OPTIMIZATION; VLSI CIRCUITS;

EID: 9144250993     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2003.819427     Document Type: Article
Times cited : (25)

References (18)
  • 6
    • 0036638434 scopus 로고    scopus 로고
    • BDS: A BDD-based logic optimization system
    • July
    • C. Yang and M. Ciesielski, "BDS: A BDD-based logic optimization system," IEEE Trans. Computer-Aided Design, vol. 21, pp. 866-876, July 2002.
    • (2002) IEEE Trans. Computer-aided Design , vol.21 , pp. 866-876
    • Yang, C.1    Ciesielski, M.2
  • 7
    • 0022769976 scopus 로고
    • Graph-based algorithms for Boolean function manipulation
    • Aug.
    • R. E. Bryant, "Graph-based algorithms for Boolean function manipulation," IEEE Trans. Comput., vol. C-35, pp. 677-691, Aug. 1986.
    • (1986) IEEE Trans. Comput. , vol.C-35 , pp. 677-691
    • Bryant, R.E.1
  • 8
    • 0030246260 scopus 로고    scopus 로고
    • Improving the variable ordering of OBDD's in NP-complete
    • Sept.
    • B. Bollig and I. Wegener, "Improving the variable ordering of OBDD's in NP-complete," IEEE Trans. Comput., vol. 45, pp. 993-1002, Sept. 1996.
    • (1996) IEEE Trans. Comput. , vol.45 , pp. 993-1002
    • Bollig, B.1    Wegener, I.2
  • 9
    • 0027800929 scopus 로고
    • Interleaving based variable ordering methods for ordered binary decision diagrams
    • H. Fujii, G. Ootomo, and C. Hori, "Interleaving based variable ordering methods for ordered binary decision diagrams," in Proc. Int. Conf. Computer-Aided Design, 1993, pp. 38-41.
    • (1993) Proc. Int. Conf. Computer-aided Design , pp. 38-41
    • Fujii, H.1    Ootomo, G.2    Hori, C.3
  • 10
    • 0027841555 scopus 로고
    • Dynamic variable ordering for ordered binary decision diagrams
    • R. Rudell, "Dynamic variable ordering for ordered binary decision diagrams," in Proc. Int. Conf. Computer-Aided Design, 1993, pp. 42-47.
    • (1993) Proc. Int. Conf. Computer-aided Design , pp. 42-47
    • Rudell, R.1
  • 11
    • 0023170999 scopus 로고
    • Finding the optimal variable ordering for binary decision diagrams
    • S. Friedman and K. Supowit, "Finding the optimal variable ordering for binary decision diagrams," in Proc. Design Automation Conf., 1987, pp. 348-356.
    • (1987) Proc. Design Automation Conf. , pp. 348-356
    • Friedman, S.1    Supowit, K.2
  • 12
    • 0027091090 scopus 로고
    • Minimization of binary decision diagrams based on exchange of variables
    • N. Ishiura, H. Sawada, and S. Yajima, "Minimization of binary decision diagrams based on exchange of variables," in Proc. Int. Conf. Computer-Aided Design, 1991, pp. 472-475.
    • (1991) Proc. Int. Conf. Computer-aided Design , pp. 472-475
    • Ishiura, N.1    Sawada, H.2    Yajima, S.3
  • 15
    • 0026107125 scopus 로고
    • On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
    • Feb.
    • R. E. Bryant, "On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication," IEEE Trans. Comput., vol. 40, pp. 205-213, Feb., 1991.
    • (1991) IEEE Trans. Comput. , vol.40 , pp. 205-213
    • Bryant, R.E.1
  • 18
    • 0346812384 scopus 로고
    • Dept. Comput. Sci., North Carolina State Univ., Raleigh, NC
    • Collaborative Benchmarking Laboratory, 1993 LGSynth Benchmarks, Dept. Comput. Sci., North Carolina State Univ., Raleigh, NC, 1993.
    • (1993) 1993 LGSynth Benchmarks


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.