메뉴 건너뛰기




Volumn 32, Issue 1 B, 2007, Pages 101-114

A new method based on cube algebra for the simplification of logic functions

Author keywords

Boolean cube; Cube expanding; Direct cover principle; Hypercube; Logic minimization; Logic simplification; Off set based minimization; Prime implicant

Indexed keywords


EID: 34547220469     PISSN: 2193567X     EISSN: 21914281     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (11)

References (33)
  • 1
    • 0035439685 scopus 로고    scopus 로고
    • Worst and Best Irredundant Sum-of-Product Expressions
    • T. Sasao, "Worst and Best Irredundant Sum-of-Product Expressions", IEEE Transactions on Computers, 50(9) (2001), pp. 935-947
    • (2001) IEEE Transactions on Computers , vol.50 , Issue.9 , pp. 935-947
    • Sasao, T.1
  • 2
    • 0043092192 scopus 로고    scopus 로고
    • Large-Scale SOP minimization Using Decomposition and Functional Properties
    • June 2-6, pp
    • A. Mishchenco and T. Sasao, "Large-Scale SOP minimization Using Decomposition and Functional Properties", DAC 2003, June 2-6, pp. 149-154.
    • DAC 2003 , pp. 149-154
    • Mishchenco, A.1    Sasao, T.2
  • 3
    • 0026106385 scopus 로고
    • Minimization Algorithms for Multiple-Valued Programmable Logic Arrays
    • P.P. Tirumalai and J.T. Butler, "Minimization Algorithms for Multiple-Valued Programmable Logic Arrays", IEE Transactions on Computers, 40(2) (1991), pp. 167-177.
    • (1991) IEE Transactions on Computers , vol.40 , Issue.2 , pp. 167-177
    • Tirumalai, P.P.1    Butler, J.T.2
  • 4
    • 0024051115 scopus 로고
    • Topological Properties of Hypercubes
    • Y. Saad and M.H. Schultz, "Topological Properties of Hypercubes", IEEE Trans. on Comput., C- 37(7) (1988), pp. 867-872.
    • (1988) IEEE Trans. on Comput , vol.C- 37 , Issue.7 , pp. 867-872
    • Saad, Y.1    Schultz, M.H.2
  • 5
    • 84983191537 scopus 로고
    • A Chart Method for Simplifying Truth Functions
    • E.W. Veitch, "A Chart Method for Simplifying Truth Functions", Proc. of the ACM, 1952, pp. 127-133.
    • (1952) Proc. of the ACM , pp. 127-133
    • Veitch, E.W.1
  • 6
    • 0000718899 scopus 로고
    • A Map Method for Synthesis of Combinational Logic Circuits
    • M. Karnaugh, "A Map Method for Synthesis of Combinational Logic Circuits", Trans. AIEE, Comm. and Electronics, 72(1) (1953), pp. 593-599.
    • (1953) Trans. AIEE, Comm. and Electronics , vol.72 , Issue.1 , pp. 593-599
    • Karnaugh, M.1
  • 7
    • 0000070975 scopus 로고
    • The Problem of Simplifying Truth Functions
    • W.V. Quine, "The Problem of Simplifying Truth Functions", Am. Math. Monthly, 59(8) (1952), pp. 521-531.
    • (1952) Am. Math. Monthly , vol.59 , Issue.8 , pp. 521-531
    • Quine, W.V.1
  • 8
    • 33845331515 scopus 로고
    • Minimization of Boolean Functions
    • E. J. McCluskey, "Minimization of Boolean Functions", Bell Systems Tech. J., 35(6) (1956), pp. 1417-1444.
    • (1956) Bell Systems Tech. J , vol.35 , Issue.6 , pp. 1417-1444
    • McCluskey, E.J.1
  • 11
    • 33747834679 scopus 로고    scopus 로고
    • R.K. Brayton, R. Rudell, A. Sangiovanni-Vincentelli, and A.R. Wang, MIS: A Multiple-Level Logic Optimization Systems, IEEE Trans. on Computer-Aided Design, CAD-6(6) (1987), pp. 1062-1081.
    • R.K. Brayton, R. Rudell, A. Sangiovanni-Vincentelli, and A.R. Wang, "MIS: A Multiple-Level Logic Optimization Systems", IEEE Trans. on Computer-Aided Design, CAD-6(6) (1987), pp. 1062-1081.
  • 12
    • 0024031894 scopus 로고
    • Multilevel Logic Minimization Using Implicit Don't Cares
    • K. A. Bartlett et al., "Multilevel Logic Minimization Using Implicit Don't Cares", IEEE Trans. on Computer-Aided Design, CAD-7(6) (1988), pp. 723-740.
    • (1988) IEEE Trans. on Computer-Aided Design , vol.CAD-7 , Issue.6 , pp. 723-740
    • Bartlett, K.A.1
  • 17
    • 84956445056 scopus 로고
    • An Iterative Algorithm for the Binate Covering Problem
    • M. Pipponzi and F. Somenzi, "An Iterative Algorithm for the Binate Covering Problem", IEEE Trans. on Computer-Aided Design, CAD-10(1) (1991), pp. 208-211.
    • (1991) IEEE Trans. on Computer-Aided Design , vol.CAD-10 , Issue.1 , pp. 208-211
    • Pipponzi, M.1    Somenzi, F.2
  • 18
    • 0026976139 scopus 로고    scopus 로고
    • B. Linn, O. Coudert, and J.C. Madre, Symbolic Prime Generation for Multiple-Valued Functions, 29thACM/IEEE Design Automation Conference, 1992, pp. 40-44.
    • B. Linn, O. Coudert, and J.C. Madre, "Symbolic Prime Generation for Multiple-Valued Functions", 29thACM/IEEE Design Automation Conference, 1992, pp. 40-44.
  • 19
    • 0026981218 scopus 로고
    • A New Algorithm for the Binate Covering Problem and its Application to the Minimization of Boolean Relations
    • S.W. Jeong and F. Somenzi, "A New Algorithm for the Binate Covering Problem and its Application to the Minimization of Boolean Relations", 29thACM/IEEE Design Automation Conference, 1992, pp. 628-633.
    • (1992) 29thACM/IEEE Design Automation Conference , pp. 628-633
    • Jeong, S.W.1    Somenzi, F.2
  • 22
    • 0029779087 scopus 로고    scopus 로고
    • An Implicit Algorithm for Support Minimization During Functional Decomposition
    • C. Legi, B. Wurth, and K. Eckl, "An Implicit Algorithm for Support Minimization During Functional Decomposition", IEEE European Design and Test Conference, 1996, pp. 412-417.
    • (1996) IEEE European Design and Test Conference , pp. 412-417
    • Legi, C.1    Wurth, B.2    Eckl, K.3
  • 25
    • 84954460326 scopus 로고    scopus 로고
    • Don't Cares in Logic Minimization of Extended Finite State Machines
    • Y. Jiang and R.K. Brayton, "Don't Cares in Logic Minimization of Extended Finite State Machines", IEEE Int. Conf. on Computer Aided Design, 2003, pp. 809-815.
    • (2003) IEEE Int. Conf. on Computer Aided Design , pp. 809-815
    • Jiang, Y.1    Brayton, R.K.2
  • 29
    • 1042289129 scopus 로고    scopus 로고
    • S. Güneş, N. Yilmaz, and N. Allahverdi, A Fault-Tolerant Multicast Routing Algorithm Based on Cube Algebra for Hypercube Networks, The Arabian Journal for Science and Engineering(AJSE), 28(1B) (2003), pp. 95-103.
    • S. Güneş, N. Yilmaz, and N. Allahverdi, "A Fault-Tolerant Multicast Routing Algorithm Based on Cube Algebra for Hypercube Networks", The Arabian Journal for Science and Engineering(AJSE), 28(1B) (2003), pp. 95-103.
  • 32
    • 0035734260 scopus 로고    scopus 로고
    • The Minimum Equivalent DNF Problem and Shortest Implicants
    • Ch. Umans, "The Minimum Equivalent DNF Problem and Shortest Implicants", Journal of Computer and System Sciences, 63(2001), pp. 597-611.
    • (2001) Journal of Computer and System Sciences , vol.63 , pp. 597-611
    • Umans, C.1


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