메뉴 건너뛰기




Volumn 2, Issue , 2004, Pages

A heuristic approach to synthesize Boolean functions using TANT network

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); CAMERAS; DATA STRUCTURES; DIGITAL DEVICES; HEURISTIC METHODS; PROBLEM SOLVING;

EID: 4344568754     PISSN: 02714310     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (1)

References (9)
  • 1
    • 33845331515 scopus 로고
    • Minimization of boolean functions
    • November
    • E.J. McClusky, "Minimization of Boolean functions", Bell System Technical Journal, Vol. 35, no.5, pp.1417-1444, November 1956.
    • (1956) Bell System Technical Journal , vol.35 , Issue.5 , pp. 1417-1444
    • McClusky, E.J.1
  • 2
    • 0000312787 scopus 로고
    • Generalization if consensus theory and application in minimization of boolean function
    • August
    • P. Tison, "Generalization if consensus theory and application in minimization of Boolean function", IEEE Trans. Electronic Computers, vol. EC-16, pp, 446-456, August 1967.
    • (1967) IEEE Trans. Electronic Computers , vol.EC-16 , pp. 446-456
    • Tison, P.1
  • 3
    • 0014980022 scopus 로고
    • A minimization technique for TANT network
    • January
    • Kyung Shik Koh, "A minimization technique for TANT network", IEEE transactions on computer, pp 105-107, January 1971.
    • (1971) IEEE Transactions on Computer , pp. 105-107
    • Kyung Shik Koh1
  • 4
    • 0031344954 scopus 로고    scopus 로고
    • A 3.4-Mbyte/sec programming 3-level NAND flash memory saving 40% die size per bit
    • keyato, Japan, 12-14 June
    • T. Tanaka, T. Tanzawa and K. Takeuchi, "A 3.4-Mbyte/sec Programming 3-Level NAND Flash Memory Saving 40% Die Size Per Bit", Symposium on VLSI Circuits, keyato, Japan, 12-14 June, 1997.
    • (1997) Symposium on VLSI Circuits
    • Tanaka, T.1    Tanzawa, T.2    Takeuchi, K.3
  • 5
    • 4344702610 scopus 로고    scopus 로고
    • An improved method for minimization of circuit using TANT network
    • accepted for publication in University of Dhaka
    • H.M.H. Babu, M.R. Islam, S.M.A. Chowdhury, A.R Chowdhury, "An Improved Method for Minimization of Circuit Using TANT Network", accepted for publication in science journal, University of Dhaka.
    • Science Journal
    • Babu, H.M.H.1    Islam, M.R.2    Chowdhury, S.M.A.3    Chowdhury, A.R.4
  • 6
    • 4344583779 scopus 로고
    • Synthesis of TANT networks using boolean analyser
    • August
    • M.A. Marin, "Synthesis of TANT Networks using Boolean Analyser", The Comp Journal, Vol. 12 No. 3 August 1969.
    • (1969) The Comp Journal , vol.12 , Issue.3
    • Marin, M.A.1
  • 7
    • 0028060895 scopus 로고    scopus 로고
    • Multiple-valued input TANT network
    • M.A. Perkowski, M.C. Jeske, "Multiple-Valued Input TANT network", ISMVL 1994, pp 334-341.
    • ISMVL 1994 , pp. 334-341
    • Perkowski, M.A.1    Jeske, M.C.2


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