메뉴 건너뛰기




Volumn , Issue , 1995, Pages 112-121

Doing two-level logic minimization 100 times faster

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; LOGIC DESIGN; LOGIC SYNTHESIS;

EID: 0003755736     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (32)

References (33)
  • 1
    • 0017983865 scopus 로고
    • Binary decision diagrams
    • S. B. Akers, "Binary Decision Diagrams", IEEE Truns. on Comp., 27:509-516, 1978.
    • (1978) IEEE Truns. on Comp. , vol.27 , pp. 509-516
    • Akers, S.B.1
  • 3
    • 0022769976 scopus 로고
    • Graph-based algorithms for boolean functions manipulation
    • August
    • R. E. Bryant, "Graph-Based Algorithms for Boolean Functions Manipulation", IEEE Trans. on Comp., 35- 8:677-692, August 1986.
    • (1986) IEEE Trans. on Comp. , vol.35 , Issue.8 , pp. 677-692
    • Bryant, R.E.1
  • 4
    • 0002737058 scopus 로고
    • On the number of prime implicants
    • A. K. Chandra, G. Markowsky, "On the Number of Prime Implicants", in Dis. Math., 24:7-11, 1978.
    • (1978) Dis. Math. , vol.24 , pp. 7-11
    • Chandra, A.K.1    Markowsky, G.2
  • 5
    • 0026973232 scopus 로고
    • Implicit and incremental computation of primes and essential primes of boolean functions
    • Anaheim CA, June
    • O. Coudert, J. C. Madre, "Implicit and Incremental Computation of Primes and Essential Primes of Boolean Functions", in Proc. of 29th Resign Aut. Conf., Anaheim CA, June 1992.
    • (1992) Proc. of 29th Resign Aut. Conf.
    • Coudert, O.1    Madre, J.C.2
  • 6
    • 0005483202 scopus 로고
    • A new graph based prime computation technique
    • T. Sasao Ed., Kluwer AC. Pub.
    • [c] O. Coudert, J. C. Madre, "A New Graph Based Prime Computation Technique", in Logic Synthesis and Optimization, T. Sasao Ed., Kluwer AC. Pub., pp. 33-57, 1993.
    • (1993) Logic Synthesis and Optimization , pp. 33-57
    • Coudert, O.1    Madre, J.C.2
  • 9
    • 0019051912 scopus 로고
    • Useless prime implicants of incompletely specified multiple-output switching functions
    • R. B. Cutler, S. Muroga, "Useless Prime Implicants of Incompletely Specified Multiple-Output Switching Functions", in Int '1 Jour. of Comp. and Inf. Sci., V. 9- 4, 1980.
    • (1980) Int '1 Jour. of Comp. and Inf. Sci. , vol.9 , Issue.4
    • Cutler, R.B.1    Muroga, S.2
  • 10
    • 0018544688 scopus 로고
    • A truth maintenance system
    • J. Doyle, "A Truth Maintenance System", in Art. Int., 12:231-271, 1979.
    • (1979) Art. Int. , vol.12 , pp. 231-271
    • Doyle, J.1
  • 11
    • 0009537022 scopus 로고
    • A reduction technique for prime implicmt tables
    • J. F. Gimpel, "A Reduction Technique for Prime Implicmt Tables", in IEEE Trans. on Elec. Comp., 14:535-541, 1965.
    • (1965) IEEE Trans. on Elec. Comp. , vol.14 , pp. 535-541
    • Gimpel, J.F.1
  • 12
    • 30244523222 scopus 로고
    • Advanced concepts in fault tree analysis
    • Seattle WA, June
    • D. F. Hasl, "Advanced Concepts in Fault Tree Analysis", in, Proc. of System Safety Symp., Seattle WA, June 1965.
    • (1965) Proc. of System Safety Symp.
    • Hasl, D.F.1
  • 13
    • 0016102508 scopus 로고
    • MINI: A heuristic approach for logic minimization
    • S. J. Hong, R. G. Cain, D. L. Ostapko, "MINI: A Heuristic Approach for Logic Minimization", in IBM Jour. R&D, pp. 443-458, 1974.
    • (1974) IBM Jour. R&D , pp. 443-458
    • Hong, S.J.1    Cain, R.G.2    Ostapko, D.L.3
  • 14
    • 0025792936 scopus 로고
    • Absolute minimization of completely specified switching functions
    • S. J. Hong, S. Muroga, "Absolute Minimization of Completely Specified Switching Functions", in IEEE Trurw. on Comp., 40:53-65, 1991.
    • (1991) IEEE Trurw. on Comp. , vol.40 , pp. 53-65
    • Hong, S.J.1    Muroga, S.2
  • 15
    • 0023330169 scopus 로고
    • Diagnosing multiple faults
    • J. De Kleer, B. C. Williarns, "Diagnosing Multiple Faults", in Art. Int., 32:97-130, 1987.
    • (1987) Art. Int. , vol.32 , pp. 97-130
    • De Kleer, J.1    Williarns, B.C.2
  • 16
    • 33845331515 scopus 로고
    • Minimization of boolean functions
    • April
    • E. L. Jr. McCluskey, "Minimization of Boolean Functions", in Bell Sys. Tech. Jour., 35:1417-1444, April 1959.
    • (1959) Bell Sys. Tech. Jour. , vol.35 , pp. 1417-1444
    • McCluskey, E.L.1
  • 18
    • 0022766879 scopus 로고
    • Prime implicants, minimum covers, and the complexity of logic simplification
    • Aug.
    • C. McMullen, J. Shearer, "Prime Implicants, Minimum Covers, and the Complexity of Logic Simplification", in IEEE Tmns. on Comp., 35:761-762, Aug. 1986.
    • (1986) IEEE Tmns. on Comp. , vol.35 , pp. 761-762
    • McMullen, C.1    Shearer, J.2
  • 19
    • 0024131721 scopus 로고
    • Proving circuit correctness using formal comparison between expected and extracted behaviour
    • Anaheim CA, July
    • J. C. Madre, J. P. Billon, "Proving Circuit Correctness using Formal Comparison Between Expected and Extracted Behaviour", in Proc. of the 25th Design Aut. Conf., Anaheim CA, July 1988.
    • (1988) Proc. of the 25th Design Aut. Conf.
    • Madre, J.C.1    Billon, J.P.2
  • 20
    • 0002285674 scopus 로고
    • A logically complete reasoning maintenance system based on 'logical constrain solver
    • Sydney, Australia, August
    • J. C. Madre, O. Coudert, "A Logically Complete Reasoning Maintenance System Based on 'Logical Constrain Solver", in Proc. of ht? Join Conf. on Art. ht., Sydney, Australia, August 1991.
    • (1991) Proc. of Int Join Conf. on Art. Ht.
    • Madre, J.C.1    Coudert, O.2
  • 21
    • 0027211369 scopus 로고
    • Zero-supressed bdds for set manipulation in combinatorial problems
    • Dallas TX, June
    • S. Minato, "Zero-Supressed BDDs for Set Manipulation in Combinatorial Problems", in Proc. of 80th Design Aut. Conf., Dallas TX, June 1993.
    • (1993) Proc. of 80th Design Aut. Conf.
    • Minato, S.1
  • 22
    • 0346623075 scopus 로고
    • An essay on prime implicant tables
    • I. B. Pyne, E. L. McCluskey, "An Essay on prime Implicant tables", SIAM, 9:604-632, 1961.
    • (1961) SIAM , vol.9 , pp. 604-632
    • Pyne, I.B.1    McCluskey, E.L.2
  • 23
    • 0000070975 scopus 로고
    • The problem of simplifying truth functions
    • W. V. O. Quine, "The problem of Simplifying Truth Functions", in Am. Math. Month., 59:521-531, 1952.
    • (1952) Am. Math. Month. , vol.59 , pp. 521-531
    • Quine, W.V.O.1
  • 24
    • 0000920864 scopus 로고
    • On cores and prime irnplicants of truth functions
    • W. V. O. Quine, "On Cores and Prime Irnplicants of Truth Functions", in Am. Math. Month., 66:755-760, 1959.
    • (1959) Am. Math. Month. , vol.66 , pp. 755-760
    • Quine, W.V.O.1
  • 25
    • 0002399445 scopus 로고
    • Foundations for assumption- based truth maintenance systems
    • Seattle WA, July
    • R. Reiter, J. de Kleer, "Foundations for Assumption- Based Truth Maintenance Systems" in Proc. of AAAI National Conf.'87, pp. 183-188, Seattle WA, July 1987.
    • (1987) Proc. of AAAI National Conf.'87 , pp. 183-188
    • Reiter, R.1    De Kleer, J.2
  • 26
    • 0142078428 scopus 로고
    • Gimpel's reduction technique extended to the covering problem with costs
    • Aug.
    • S. Robinson, R. House"Gimpel's Reduction Technique Extended to the Covering Problem With Costs", in IEEE Tmns. on Elec. Comp., 16:509-514, Aug. 1967.
    • (1967) IEEE Tmns. on Elec. Comp. , vol.16 , pp. 509-514
    • Robinson, S.1    House, R.2
  • 27
    • 84939338348 scopus 로고
    • Multiple valued minimization for pla optimization
    • Sept.
    • R. L. Rudell, A. L. Sangiovanni-Vincentelli, "Multiple Valued Minimization for PLA Optimization", in IEEE Trans. on CAD, 6-5:727-750, Sept. 1987.
    • (1987) IEEE Trans. on CAD , vol.6 , Issue.5 , pp. 727-750
    • Rudell, R.L.1    Sangiovanni-Vincentelli, A.L.2
  • 29
    • 85039793184 scopus 로고    scopus 로고
    • J. Sanghavi, personal communication, June 1994
    • J. Sanghavi, personal communication, June 1994.
  • 30
    • 0003612381 scopus 로고
    • UAn application of multiple-valued logic to a design of programmable logic arrays
    • T. Sasao, UAn Application of Multiple-Valued Logic to a Design of Programmable Logic Arrays", Proc. of Int '1 Symp. on Multiple- Valued Logic, 1978.
    • (1978) Proc. of Int '1 Symp. on Multiple- Valued Logic
    • Sasao, T.1
  • 31
    • 84938487169 scopus 로고
    • The synthesis of two-termi& switching function
    • C. E. Shannon, "The Synthesis of Two-Termi& Switching Function", in Bell Sys. Tech. JOUF., 2011:59- 98, 1949.
    • (1949) Bell Sys. Tech. JOUF. , vol.2011 , pp. 59-98
    • Shannon, C.E.1


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