skip to main content
10.1145/1455292.1455318acmconferencesArticle/Chapter ViewAbstractPublication PagesafipsConference Proceedingsconference-collections
research-article
Free Access

A theorem on SPDT switching circuits

Published:01 March 1955Publication History

ABSTRACT

It is first demonstrated that networks of SPDT (Single Pole Double Throw) switches can be represented abstractly with a Boolean algebra in much the same way as networks of SPST (Single Pole Single Throw) switches have been treated by Shannon, provided a certain set of network wiring rules is established. A theorem is then proved which shows that all networks represented in this way can be handled as though each network were itself a single SPDT switch. Proof of a corollary then allows discussion of techniques of network construction. The component minimization problem is also discussed and several detailed examples are given.

References

  1. fr1 C. E. Shannon, "A symbolic analysis of relay and switching circuits," Proc. AIEE, vol. 57, pp. 713-723; 1938.Google ScholarGoogle Scholar
  2. fr2 C. E. Shannon, "The synthesis of two-terminal switching circuits," Bell Sys. Tech. Jour., vol. 28, pp. 59-98; January, 1949.Google ScholarGoogle ScholarCross RefCross Ref
  3. fr3 W. Keister, A. E. Ritchie, S. H. Washburn, "The Design of Switching Circuits," D. Van Nostrand Co., Inc., New York, N. Y., pp. 69-103; 1951.Google ScholarGoogle Scholar
  4. fr4 Shannon, "A symbolic analysis of relay and switching circuits." p. 722. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. fr5 Shannon, "A symbolic analysis of relay and switching circuits," p. 719. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. fr6 Keister, Ritchie, Washburn, op. cit., ch. 4.Google ScholarGoogle Scholar
  7. fr7 Shannon, "A symbolic analysis of relay and switching circuits," p. 721. Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Conferences
    AFIPS '55 (Western): Proceedings of the March 1-3, 1955, western joint computer conference
    March 1955
    147 pages
    ISBN:9781450378567
    DOI:10.1145/1455292

    Copyright © 1955 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 1 March 1955

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader