메뉴 건너뛰기




Volumn 41, Issue 4, 1992, Pages 489-493

Basis Sets for Synthesis of Switching Functions

Author keywords

Basis extension generalized Reed Muller expansion. generating set switching function synthesis

Indexed keywords

COMPUTER METATHEORY--BOOLEAN FUNCTIONS; LOGIC CIRCUITS--SYNTHESIS;

EID: 0026853565     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.135561     Document Type: Article
Times cited : (4)

References (12)
  • 1
    • 84941530793 scopus 로고
    • Ring-sum expansions of Boolean functions
    • New York
    • M. Davio, “Ring-sum expansions of Boolean functions,” in Proc. Symp. Comput. and Automata, New York, 1971, 411–418.
    • (1971) Proc. Symp. Comput. and Automata , pp. 411-418
    • Davio, M.1
  • 3
    • 0018033604 scopus 로고
    • Some new types of logical completeness
    • Nov.
    • S. Karunanithi and A. D. Friedman, “Some new types of logical completeness,” IEEE Trans. Comput., vol. C-27, pp. 998–1005, Nov. 1978.
    • (1978) IEEE Trans. Comput , vol.C-27 , pp. 998-1005
    • Karunanithi, S.1    Friedman, A.D.2
  • 4
    • 0015397893 scopus 로고
    • Universal base functions and modules for realizing arbitrary switching functions
    • Sept.
    • M.Y. Osman and C. D. Weiss, “Universal base functions and modules for realizing arbitrary switching functions,” IEEE Trans. Comput., vol. C-21, pp. 985 - 995, Sept. 1972.
    • (1972) IEEE Trans. Comput , vol.C-21 , pp. 985-995
    • Osman, M.Y.1    Weiss, C.D.2
  • 5
    • 0015280249 scopus 로고
    • Optimum logic modules
    • Jan.
    • G. I. Opsahl, “Optimum logic modules,” IEEE Trans. Comput., vol. C-21, 90–96, Jan. 1972.
    • (1972) IEEE Trans. Comput , vol.C-21 , pp. 90-96
    • Opsahl, G.I.1
  • 6
    • 84915958383 scopus 로고
    • A complex logic module for the synthesis of combinational switching circuits
    • Y. N. Patt, “A complex logic module for the synthesis of combinational switching circuits,” in Proc. AFIP Spring Joint Comput. Conf., 1967, pp. 699–705.
    • (1967) Proc. AFIP Spring Joint Comput. Conf. , pp. 699-705
    • Patt, Y.N.1
  • 7
    • 0015052390 scopus 로고
    • On the design of universal Boolean functions
    • Apr.
    • F. P. Preparata, “On the design of universal Boolean functions,” IEEE Trans. Comput., vol. C-20, pp. 418–423, Apr. 1971.
    • (1971) IEEE Trans. Comput , vol.C-20 , pp. 418-423
    • Preparata, F.P.1
  • 8
    • 0015360561 scopus 로고
    • Universal logic modules of a new type
    • June
    • F. P. Preparata, “Universal logic modules of a new type,” IEEE Trans. Comput., vol. C-21, pp. 585–588, June 1972.
    • (1972) IEEE Trans. Comput , vol.C-21 , pp. 585-588
    • Preparata, F.P.1
  • 9
    • 0041310566 scopus 로고
    • On random generating elements of a finite Boolean algebra
    • A. Renyi, “On random generating elements of a finite Boolean algebra,” Acta. Sci. Math., (Szeged), vol. 22, pp. 75–81, 1961.
    • (1961) Acta. Sci. Math. (Szeged) , vol.22 , pp. 75-81
    • Renyi, A.1
  • 10
    • 0015399837 scopus 로고
    • On generalized Reed-Muller Expansions
    • Sept.
    • S. Swamy, “On generalized Reed-Muller Expansions,” IEEE Trans. Comput., vol. C-21, pp. 1008–1009, Sept. 1972.
    • (1972) IEEE Trans. Comput , vol.C-21 , pp. 1008-1009
    • Swamy, S.1


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