Switching circuit theory
Switching circuit theory is the mathematical study of the properties of networks of idealized switches. Such networks may be strictly combinational logic, in which their output state is only a function of the present state of their inputs; or may also contain sequential elements, where the present state depends on the present state and past states; in that sense, sequential circuits are said to include "memory" of past states. An important class of sequential circuits are state machines. Switching circuit theory is applicable to the design of telephone systems, computers, and similar systems. Switching circuit theory provided the mathematical foundations and tools for digital system design in almost all areas of modern technology.[1]
In an 1886 letter, Charles Sanders Peirce described how logical operations could be carried out by electrical switching circuits.[2] During 1880–1881 he showed that NOR gates alone (or alternatively NAND gates alone) can be used to reproduce the functions of all the other logic gates, but this work remained unpublished until 1933.[3] The first published proof was by Henry M. Sheffer in 1913, so the NAND logical operation is sometimes called Sheffer stroke; the logical NOR is sometimes called Peirce's arrow.[4] Consequently, these gates are sometimes called universal logic gates.[5]
In 1898, Martin Boda described a switching theory for signalling block systems.[6][7]
Eventually, vacuum tubes replaced relays for logic operations. Lee De Forest's modification, in 1907, of the Fleming valve can be used as a logic gate. Ludwig Wittgenstein introduced a version of the 16-row truth table as proposition 5.101 of Tractatus Logico-Philosophicus (1921). Walther Bothe, inventor of the coincidence circuit, got part of the 1954 Nobel Prize in physics, for the first modern electronic AND gate in 1924. Konrad Zuse designed and built electromechanical logic gates for his computer Z1 (from 1935 to 1938).
From 1934 to 1936, NEC engineer Akira Nakashima,[8] Claude Shannon[9] and Victor Shestakov[10] published a series of papers showing that the two-valued Boolean algebra, which they discovered independently, can describe the operation of switching circuits.[7][11][12][13][1]
Ideal switches are considered as having only two exclusive states, for example, open or closed. In some analysis, the state of a switch can be considered to have no influence on the output of the system and is designated as a "don't care" state. In complex networks it is necessary to also account for the finite switching time of physical switches; where two or more different paths in a network may affect the output, these delays may result in a "logic hazard" or "race condition" where the output state changes due to the different propagation times through the network.
See also
- Circuit switching
- Message switching
- Packet switching
- Fast packet switching
- Network switching subsystem
- 5ESS Switching System
- Number One Electronic Switching System
- Boolean circuit
- C-element
- Circuit complexity
- Circuit minimization
- Karnaugh map
- Logic design
- Logic gate
- Logic in computer science
- Nonblocking minimal spanning switch
- Programmable logic controller – computer software mimics relay circuits for industrial applications
- Quine–McCluskey algorithm
- Relay – an early kind of logic device
- Switching lemma
- Unate function
References
- ↑ 1.0 1.1 Reprints from the Early Days of Information Sciences: TICSP Series on the Contributions of Akira Nakashima to Switching Theory. Tampere International Center for Signal Processing (TICSP) Series. 40. Tampere University of Technology, Tampere, Finland. 2008. ISBN 978-952-15-1980-2. http://ticsp.cs.tut.fi/reports/reprint-nakashima-rr.pdf. (3+207+1 pages) 10:00 min
- ↑ Letter, Peirce to A. Marquand. 5. 1993. pp. 421–423. See also: "Review: Charles S. Peirce, The new elements of mathematics". Bulletin of the American Mathematical Society 84 (5): 913–918 [917]. 1978. doi:10.1090/S0002-9904-1978-14533-9. http://projecteuclid.org/DPubS/Repository/1.0/Disseminate?view=body&id=pdf_1&handle=euclid.bams/1183541145.
- ↑ A Boolian Algebra with One Constant (manuscript). 4. 1933. paragraphs 12–20. Reprinted in Writings of Charles S. Peirce. 4 (reprint ed.). 1989. pp. 218–221. ark:/13960/t11p5r61f. ISBN 9780253372017. https://archive.org/details/writingsofcharle0002peir/page/218. See also: The Existential Graphs of Charles S. Peirce. 2009. p. 131.
- ↑ Propositional logic: deduction and algorithms. Cambridge University Press. 1999. p. 2. ISBN 978-0-521-63017-7. https://books.google.com/books?id=3oJE9yczr3EC&pg=PA2.
- ↑ Engineering mathematics. Newnes. 2007. p. 532. ISBN 978-0-7506-8555-9. https://books.google.com/books?id=1-fBmsEBNUoC&pg=PA532.
- ↑ "Die Schaltungstheorie der Blockwerke" (in de). Organ für die Fortschritte des Eisenbahnwesens in technischer Beziehung – Fachblatt des Vereins deutscher Eisenbahn-Verwaltungen (Wiesbaden, Germany: C. W. Kreidel's Verlag) Neue Folge XXXV (1–7): 1–7; 29–34; 49–53; 71–75; 91–95; 111–115; 133–138. 1898. [1][2][3][4][5][6][7] (NB. This series of seven articles was republished in a 91-pages book in 1899 with a foreword by Georg Barkhausen (de).)
- ↑ 7.0 7.1 "Reference Notations to Chapter 1". Introduction to the Methodology of Switching Circuits (1 ed.). Binghamton, New York, USA: Litton Educational Publishing, Inc. / D. van Nostrand Company. May 1972. p. 19. C4463-000-3. ISBN 0-442-24463-0. "Although the possibility of establishing a switching theory was recognized by M. Boda[A] as early as in the 19th century, the first important works on this subject were published by A. Nakashima[B] and C. E. Shannon[C] shortly before World War II." (xvi+573+1 pages)
- ↑ "Theory of Relay Circuit Composition". Nippon Electrical Communication Engineering (3): 197–226. May 1936. (NB. Translation of an article which originally appeared in Japanese in the Journal of the Institute of Telegraph and Telephone Engineers of Japan (JITTEJ) September 1935, 150 731–752.)
- ↑ "A Symbolic Analysis of Relay and Switching Circuits". Transactions of the American Institute of Electrical Engineers (American Institute of Electrical Engineers (AIEE)) 57 (12): 713–723. 1938. doi:10.1109/T-AIEE.1938.5057767. (NB. Based on Shannon's master thesis of the same title at Massachusetts Institute of Technology in 1937.)
- ↑ (in ru) (PhD thesis). Lomonosov State University. 1938.
- ↑ "History of Research on Switching Theory in Japan". IEEJ Transactions on Fundamentals and Materials (Institute of Electrical Engineers of Japan) 124 (8): 720–726. 2004. doi:10.1541/ieejfms.124.720. Bibcode: 2004IJTFM.124..720Y. https://www.jstage.jst.go.jp/article/ieejfms/124/8/124_8_720/_article. Retrieved 2022-10-26.
- ↑ "Switching Theory/Relay Circuit Network Theory/Theory of Logical Mathematics". IPSJ Computer Museum. Information Processing Society of Japan. 2012. http://museum.ipsj.or.jp/en/computer/dawn/0002.html.
- ↑ Some Historical Remarks on Switching Theory. Niš, Serbia; Tampere, Finland; Boston, Massachusetts, USA. 2007. https://sites.bu.edu/mark/files/2018/02/200.pdf.pdf. Retrieved 2022-10-25. (8 pages)
Further reading
- The Design of Switching Circuits. The Bell Telephone Laboratories Series (1 ed.). D. Van Nostrand Company, Inc.. 1951. p. 147. https://archive.org/details/TheDesignOfSwitchingCircuits. Retrieved 2020-05-09. [8] (2+xx+556+2 pages)
- Switching Circuits and Logical Design (1st ed.). New York, USA: John Wiley & Sons Inc.. 1958-12-01. ISBN 0-47112969-0. (xviii+686 pages)
- "6. Historical Overview of the Research on Decomposition". A Survey of Literature on Function Decomposition. Functional Decomposition Group, Department of Electrical Engineering, Portland University, Portland, Oregon, USA. 1995-11-20. http://web.cecs.pdx.edu/~mperkows/=PUBLICATIONS/PER/G1995/survey.pdf. Retrieved 2021-03-28. (188 pages)
- "Publications in the First Twenty Years of Switching Theory and Logic Design". Tampere University of Technology / TTKK, Monistamo, Finland. August 2001. http://ticsp.cs.tut.fi/images/a/a5/Stari-radovi-report.pdf. (4+60 pages)
- From Boolean Logic to Switching Circuits and Automata: Towards Modern Information Technology. Studies in Computational Intelligence. 335 (1 ed.). Berlin & Heidelberg, Germany: Springer-Verlag. 2011. doi:10.1007/978-3-642-11682-7. ISBN 978-3-642-11681-0. https://books.google.com/books?id=ZuHwCAAAQBAJ. Retrieved 2022-10-25. (xviii+212 pages)
 |  |
