메뉴 건너뛰기




Volumn 22, Issue 11, 2003, Pages 1588-1593

Fast computation of symmetries in Boolean functions

Author keywords

Binary decision diagrams (BDDs); Boolean functions; Recursive procedures; Symmetric variables; Symmetry; Zero suppressed binary decision diagrams (ZBDDs)

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DECISION THEORY; GRAPH THEORY; OPTIMIZATION; RECURSIVE FUNCTIONS; THEOREM PROVING;

EID: 0242720621     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2003.818371     Document Type: Article
Times cited : (27)

References (24)
  • 1
    • 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
  • 4
    • 0011769081 scopus 로고
    • Identification of symmetry, redundancy, and equivalence of Boolean functions
    • Dec.
    • D. L. Dietmeyer and P. R. Schneider, "Identification of symmetry, redundancy, and equivalence of Boolean functions," IEEE Trans. Electron. Comput., vol. EC-16, pp. 804-817, Dec. 1967.
    • (1967) IEEE Trans. Electron. Comput. , vol.EC-16 , pp. 804-817
    • Dietmeyer, D.L.1    Schneider, P.R.2
  • 6
    • 0018038632 scopus 로고
    • A digital synthesis procedure under function symmetries and mapping methods
    • Nov.
    • C. R. Edward and S. L. Hurst, "A digital synthesis procedure under function symmetries and mapping methods," IEEE Trans. Comput., vol. C-27, pp. 985-997, Nov. 1978.
    • (1978) IEEE Trans. Comput. , vol.C-27 , pp. 985-997
    • Edward, C.R.1    Hurst, S.L.2
  • 9
    • 0026138575 scopus 로고
    • Multilevel logic synthesis of symmetric switching functions
    • Apr.
    • B.-G. Kim and D. L. Dietmeyer, "Multilevel logic synthesis of symmetric switching functions," IEEE Trans. Computer-Aided Design, vol. 10, pp. 436-446, Apr. 1991.
    • (1991) IEEE Trans. Computer-Aided Design , vol.10 , pp. 436-446
    • Kim, B.-G.1    Dietmeyer, D.L.2
  • 11
    • 0041695515 scopus 로고    scopus 로고
    • Constructive multi-level synthesis by way of functional properties
    • Ph.D. dissertation, Univ. Michigan, Ann Arbor
    • V. N. Kravets, "Constructive multi-level synthesis by way of functional properties," Ph.D. dissertation, Univ. Michigan, Ann Arbor, 2001.
    • (2001)
    • Kravets, V.N.1
  • 12
    • 0001117652 scopus 로고    scopus 로고
    • Boolean matching using binary decision diagrams with applications to logic synthesis and verification
    • Y.-T. Lai, S. Sastry, and M. Pedram, "Boolean matching using binary decision diagrams with applications to logic synthesis and verification," in Proc. Int. Conf. Computer Aided Design, 1992, pp. 452-458.
    • Proc. Int. Conf. Computer Aided Design, 1992 , pp. 452-458
    • Lai, Y.-T.1    Sastry, S.2    Pedram, M.3
  • 14
    • 0027211369 scopus 로고    scopus 로고
    • Zero-suppressed BDDs for set manipulation in combinatorial problems
    • S. Minato, "Zero-suppressed BDDs for set manipulation in combinatorial problems," in Proc. Design Automation Conf., 1993, pp. 272-277.
    • Proc. Design Automation Conf., 1993 , pp. 272-277
    • Minato, S.1
  • 15
    • 0036722869 scopus 로고    scopus 로고
    • Limits of using signatures for permutation independent Boolean comparison
    • Sept.
    • J. Mohnke, P. Molitor, and S. Malik, "Limits of using signatures for permutation independent Boolean comparison," Formal Methods Syst. Des., vol. 21, no. 2, pp. 167-191, Sept. 2002.
    • (2002) Formal Methods Syst. Des. , vol.21 , Issue.2 , pp. 167-191
    • Mohnke, J.1    Molitor, P.2    Malik, S.3
  • 17
    • 0242701260 scopus 로고    scopus 로고
    • EXTRA library of DD procedures
    • [Online]
    • A. Mischenko, EXTRA library of DD procedures. [Online]. Available: http://www.ee.pdx.edu/~alanmi/research/extra.htm
    • Mischenko, A.1
  • 18
    • 0242617125 scopus 로고
    • Detection of total or partial symmetry of a switching function with the use of decomposition charts
    • Oct.
    • A. Mukhopadhyay, "Detection of total or partial symmetry of a switching function with the use of decomposition charts," IEEE Trans. Electron. Comput., vol. 16, pp. 553-557, Oct. 1963.
    • (1963) IEEE Trans. Electron. Comput. , vol.16 , pp. 553-557
    • Mukhopadhyay, A.1
  • 20
    • 67649405339 scopus 로고    scopus 로고
    • A new expansion of symmetric functions and their application to nondisjoint functional decompositions for LUT-type FPGAs
    • T. Sasao, "A new expansion of symmetric functions and their application to nondisjoint functional decompositions for LUT-type FPGAs," in Proc. Int. Workshop Logic Synthesis, 2000, pp. 105-110.
    • Proc. Int. Workshop Logic Synthesis, 2000 , pp. 105-110
    • Sasao, T.1
  • 22
    • 0242617126 scopus 로고    scopus 로고
    • CUDD Package, Release 2.3.1. [Online]
    • F. Somenzi, CUDD Package, Release 2.3.1. [Online]. Available: http://vlsi.Colorado.EDU/~fabio/CUDD/cuddIntro.html
    • Somenzi, F.1
  • 23
    • 0002919769 scopus 로고    scopus 로고
    • Generalized Reed-Muller forms as a tool to detect symmetries
    • Jan.
    • C.-C. Tsai and M. Marek-Sadowska, "Generalized Reed-Muller forms as a tool to detect symmetries," IEEE Trans. Comput., vol. 45, pp. 33-40, Jan. 1996.
    • (1996) IEEE Trans. Comput. , vol.45 , pp. 33-40
    • Tsai, C.-C.1    Marek-Sadowska, M.2
  • 24
    • 0003647211 scopus 로고
    • Logic synthesis and optimization benchmarks user guide (version 3.0)
    • Microelectronics Center of North Carolina, Research Triangle Park, NC
    • S. Yang, "Logic synthesis and optimization benchmarks user guide (version 3.0)," Microelectronics Center of North Carolina, Research Triangle Park, NC, 1991.
    • (1991)
    • Yang, S.1


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