메뉴 건너뛰기




Volumn C-26, Issue 8, 1977, Pages 745-756

An Approach to Unified Methodology of Combinational Switching Circuits

Author keywords

Boolean equations; characteristic functions; closed feedback loops; combinational behavior; combinational circuits; degenerate sequential circuits; realization and decomposition of functions

Indexed keywords

SWITCHING SYSTEMS;

EID: 0017523387     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1977.1674912     Document Type: Article
Times cited : (25)

References (30)
  • 1
    • 77954035031 scopus 로고
    • Reduced solutions of Boolean equations
    • Oct.
    • F. M. Brown, “Reduced solutions of Boolean equations,” IEEE Trans. Comput., vol. C-19, p. 976, Oct. 1970.
    • (1970) IEEE Trans. Comput. , vol.C-19 , pp. 976
    • Brown, F.M.1
  • 2
    • 0016326577 scopus 로고
    • Equational logic
    • Dec.
    • —, “Equational logic,” IEEE Trans. Comput., vol. C-23, p. 1228, Dec. 1974.
    • (1974) IEEE Trans. Comput. , vol.C-23 , pp. 1228
    • Brown, F.M.1
  • 3
    • 0016060152 scopus 로고
    • A computer algorithm for the synthesis of memoryless switching circuits
    • May
    • E. Cerny and M. A. Marin, “A computer algorithm for the synthesis of memoryless switching circuits,” IEEE Trans. Comput., vol. C-23, p. 455, May 1974.
    • (1974) IEEE Trans. Comput. , vol.C-23 , pp. 455
    • Cerny, E.1    Marin, M.A.2
  • 4
    • 84937647048 scopus 로고
    • An approach to unified methodology of combinational switching circuits
    • Ph.D. dissertation, McGill University, Spring
    • E. Cerny, “An approach to unified methodology of combinational switching circuits,” Ph.D. dissertation, McGill University, Spring 1975.
    • (1975)
    • Cerny, E.1
  • 5
    • 84937656362 scopus 로고
    • Application of a Boolean-equation based methodology to the detection of faults in combinational switching circuits
    • Computer Repository R76-84, May
    • —, “Application of a Boolean-equation based methodology to the detection of faults in combinational switching circuits,” Computer Repository R76-84, May 1976.
    • (1976)
    • Cerny, E.1
  • 6
    • 84937655490 scopus 로고
    • Comments on ‘Equational logic’
    • Jan.
    • —, “Comments on ‘Equational logic’,” IEEE Trans. Comput., vol. C-25, Jan. 1976.
    • (1976) IEEE Trans. Comput. , vol.C-25
    • Cerny, E.1
  • 9
    • 77951428412 scopus 로고
    • Sequential Boolean equations
    • Mar.
    • S. Even and A. R. Meyer, “Sequential Boolean equations,” IEEE Trans. Comput., vol. C-18, p. 230, Mar. 1969.
    • (1969) IEEE Trans. Comput. , vol.C-18 , pp. 230
    • Even, S.1    Meyer, A.R.2
  • 11
    • 0014738529 scopus 로고
    • The necessity of closed circuit loops in minimal combinational circuits
    • Feb.
    • W. H. Kautz, “The necessity of closed circuit loops in minimal combinational circuits,” IEEE Trans. Comput., vol. C-19, p. 162, Feb. 1970.
    • (1970) IEEE Trans. Comput. , vol.C-19 , pp. 162
    • Kautz, W.H.1
  • 13
    • 0014660665 scopus 로고
    • New considerations in teaching switching theory
    • Dec.
    • G. J. Klir and M. A. Marin, “New considerations in teaching switching theory,” IEEE Trans. Education, vol. E-12, p. 257, Dec. 1969.
    • (1969) IEEE Trans. Education , vol.E-12 , pp. 257
    • Klir, G.J.1    Marin, M.A.2
  • 14
    • 0016117906 scopus 로고
    • On the solution of Boolean and pseudo-Boolean relations
    • Oct.
    • G. J. Klir, “On the solution of Boolean and pseudo-Boolean relations,” IEEE Trans. Comput., vol. C-23, p. 1098, Oct. 1974.
    • (1974) IEEE Trans. Comput. , vol.C-23 , pp. 1098
    • Klir, G.J.1
  • 15
    • 84937356107 scopus 로고
    • Investigation of the field of problems for the Boolean analyser
    • Ph.D. dissertation, UCLA, Los Angeles, Rep. #68-28
    • M. A. Marin, “Investigation of the field of problems for the Boolean analyser,” Ph.D. dissertation, UCLA, Los Angeles, Rep. #68-28, 1968.
    • (1968)
    • Marin, M.A.1
  • 19
    • 77951960306 scopus 로고
    • Algebraic topological methods for the synthesis of switching systems in n variables
    • The Institute of Advanced Studies, Princeton, ECP 56-02, Apr.
    • —, “Algebraic topological methods for the synthesis of switching systems in n variables,” The Institute of Advanced Studies, Princeton, ECP 56-02, Apr. 1956.
    • (1956)
    • Roth, J.P.1
  • 21
    • 0008446862 scopus 로고
    • An algebraic approach to Boolean equations
    • Feb.
    • —, “An algebraic approach to Boolean equations,” IEEE Trans. Comput., vol. C-23, p. 206, Feb. 1974.
    • (1974) IEEE Trans. Comput. , vol.C-23 , pp. 206
    • Rudeanu, S.1
  • 22
    • 84913253965 scopus 로고
    • An algorithm for synthesis of multiple output combinational logic
    • Feb.
    • P. R. Schneider and D. L. Dietmeyer, “An algorithm for synthesis of multiple output combinational logic,” IEEE Trans. Comput., vol. C-17, p. 117, Feb. 1968.
    • (1968) IEEE Trans. Comput. , vol.C-17 , pp. 117
    • Schneider, P.R.1    Dietmeyer, D.L.2
  • 23
    • 0014751851 scopus 로고
    • An algorithm for the disjunctive decomposition of switching functions
    • Mar.
    • V. Y. Shen and A. C. McKellar, “An algorithm for the disjunctive decomposition of switching functions,” IEEE Trans. Comput., vol. C-19, p. 237, Mar. 1970.
    • (1970) IEEE Trans. Comput. , vol.C-19 , pp. 237
    • Shen, V.Y.1    McKellar, A.C.2
  • 24
    • 0042196149 scopus 로고
    • A theory of relations between sequential and combinational realizations of switching functions
    • Stanford Electronic Labs., Menlo Park, CA, Tech. Rep. 098-1
    • R. A. Short, “A theory of relations between sequential and combinational realizations of switching functions,” Stanford Electronic Labs., Menlo Park, CA, Tech. Rep. 098-1, 1966.
    • (1966)
    • Short, R.A.1
  • 25
    • 0008482736 scopus 로고
    • An algorithm for solving Boolean equations
    • Oct.
    • A. Svoboda, “An algorithm for solving Boolean equations,” IEEE Trans. Electron. Comput., vol. EC-12, p. 557, Oct. 1963.
    • (1963) IEEE Trans. Electron. Comput. , vol.EC-12 , pp. 557
    • Svoboda, A.1
  • 26
    • 84937356108 scopus 로고
    • Boolean analyzer
    • (Edinburgh, Scotland, Aug. 1968), Booklet D, North Holland
    • —, “Boolean analyzer,” in Proc. IFIP Congr. (Edinburgh, Scotland, Aug. 1968), Booklet D, North Holland, 1968.
    • (1968) Proc. IFIP Congr.
    • Svoboda, A.1
  • 27
    • 0015605222 scopus 로고
    • Boolean differential calculus and its application to switching theory
    • Apr.
    • A. Thayse and A. Davio, “Boolean differential calculus and its application to switching theory,” IEEE Trans. Comput., vol. C-22, p. 409, Apr. 1973.
    • (1973) IEEE Trans. Comput. , vol.C-22 , pp. 409
    • Thayse, A.1    Davio, A.2
  • 28
    • 84937646839 scopus 로고
    • A note on the solution of sequential Boolean equations
    • Feb.
    • J. W. Ulrich, “A note on the solution of sequential Boolean equations,” IEEE Trans. Election Comput., vol. EC-16, Feb. 1967.
    • (1967) IEEE Trans. Election Comput. , vol.EC-16
    • Ulrich, J.W.1
  • 29
    • 0016036107 scopus 로고
    • A unified theory of the algebraic topological methods for the synthesis of switching systems
    • Mar.
    • M. E. Ulug and B. A. Bowen, “A unified theory of the algebraic topological methods for the synthesis of switching systems,” IEEE Trans. Comput., vol. C-23, p. 255, Mar. 1974.
    • (1974) IEEE Trans. Comput. , vol.C-23 , pp. 255
    • Ulug, M.E.1    Bowen, B.A.2
  • 30
    • 84932847893 scopus 로고
    • A symbolic analysis of relay and switching circuits
    • C. E. Shannon, “A symbolic analysis of relay and switching circuits,” Trans. AIEE, vol. 57, 1938.
    • (1938) Trans. AIEE , vol.57
    • Shannon, C.E.1


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