메뉴 건너뛰기




Volumn , Issue , 2007, Pages 102-107

Combinational equivalence checking for threshold logic circuits

Author keywords

EDA; Equivalence checking; Nano devices; Threshold logic

Indexed keywords

AUTOMATION; BOOLEAN ALGEBRA; COMBINATORIAL MATHEMATICS; COMPUTER AIDED DESIGN; LOGIC DESIGN; THRESHOLD LOGIC;

EID: 34748907118     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1228784.1228813     Document Type: Conference Paper
Times cited : (22)

References (19)
  • 2
    • 0141485506 scopus 로고    scopus 로고
    • VLSI implementations of threshold logic-a comprehensive survey
    • V. Beiu et al. VLSI implementations of threshold logic-a comprehensive survey. In IEEE Transactions on Neural Networks, volume 14, 2003.
    • (2003) IEEE Transactions on Neural Networks , vol.14
    • Beiu, V.1
  • 4
    • 0033680560 scopus 로고    scopus 로고
    • Current-Mode Threshold Logic Gates
    • S. Bobba and I. Hajj. Current-Mode Threshold Logic Gates. In Proc. of ICCD, 2000.
    • (2000) Proc. of ICCD
    • Bobba, S.1    Hajj, I.2
  • 5
    • 0027832523 scopus 로고
    • Verification of Large Synthesized Designs
    • D. Brand. Verification of Large Synthesized Designs. In Proc. ICCAD, 1993.
    • (1993) Proc. ICCAD
    • Brand, D.1
  • 6
    • 0022769976 scopus 로고
    • Graph-Based Algorithms for Boolean Function Manipulation
    • R. E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. In IEEE Transactions on Computers, volume 35, 1986.
    • (1986) IEEE Transactions on Computers , vol.35
    • Bryant, R.E.1
  • 9
    • 0032645988 scopus 로고    scopus 로고
    • Equivalence Checking of Combinational Circuits using Boolean Expression Diagrams
    • July
    • H. Hulgaard et al. Equivalence Checking of Combinational Circuits using Boolean Expression Diagrams. In IEEE Transactions on CAD, July 1999.
    • (1999) IEEE Transactions on CAD
    • Hulgaard, H.1
  • 12
    • 0030646028 scopus 로고    scopus 로고
    • Equivalence Checking Using Cuts and Heaps
    • A. Kuehlmann and F. Krohm. Equivalence Checking Using Cuts and Heaps. In Proc. of DAC, 1997.
    • (1997) Proc. of DAC
    • Kuehlmann, A.1    Krohm, F.2
  • 14
    • 0028501364 scopus 로고
    • Recursive Learning: A New Implication Technique for Efficient Solution to CAD Problems- Test, Verification and Optimization
    • W. Kunz and D. Pradhan. Recursive Learning: A New Implication Technique for Efficient Solution to CAD Problems- Test, Verification and Optimization. In IEEE Transactions on CAD, 1994.
    • (1994) IEEE Transactions on CAD
    • Kunz, W.1    Pradhan, D.2
  • 17
    • 34748857502 scopus 로고    scopus 로고
    • P. F. Williams, H. Hulgaard, and H. R. Andersen. Boolean Expression Diagram Tool, Version 2.5
    • P. F. Williams, H. Hulgaard, and H. R. Andersen. Boolean Expression Diagram Tool - Version 2.5.
  • 19
    • 11844292735 scopus 로고    scopus 로고
    • Threshold Network Synthesis and Optimization and Its Application to Nanotechnologies
    • January
    • R. Zhang et al. Threshold Network Synthesis and Optimization and Its Application to Nanotechnologies. In IEEE Transactions on CAD, January 2005.
    • (2005) IEEE Transactions on CAD
    • Zhang, R.1


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