Theory and Design of Switching Circuits

  title={Theory and Design of Switching Circuits},
  author={Igor Aleksander},
  journal={Electronics and Power},
Decomposition Of Digital Switching Functions
  • A. S. Wojcik
  • Computer Science, Mathematics
    Photonics West - Lasers and Applications in Science and Engineering
  • 1987
The topic of functional decomposition has been pursued by researchers in an attempt to determine more efficient techniques to implement switching functions and several approaches that have been taken are introduced.
Science Is ...
It was showed that learning with CEP-based Chemistry module can improve life skills, learning motivation, and cognitive result of Acid Alkali.
Blocking of group automata. I. One-sided interlocking
The concepts of restraining and interlocking connections of the set of automata are introduced. These concepts are used to define the concept of commutation automaton which serves as the mathematical
Guidelines for Authors of Papers Published in Proceedings of IIT.SRC 2009
This document is a suplement to the iitsrc.pdf document which describes all the (boring) things in detail.
Radiation hardening by design
Historically, specialized foundry processes have been utilized to produce radiation hardened microelectronics. Radiation hardness by design techniques have been shown to be capable of producing
Logical models of the transportation network of a plant with progressive operations
A method for searching and eliminating potentially false paths of the system is devised as well as a method for taking into account specified constraints on the mutual operation of parallel channels.
Decoding asynchronous sequences
The problem of decoding the input actions of a logical circuit with elements of vennjunction is solved and a method of constructing a decoder based on a cascade connection of conjunctors is presented.
General solutions to switching problems
The concept of switching automaton is introduced as a mathematical model for switching control in electric networks. The concepts of a system of switching rules and a switching problem are
Finite state machine design
This paper designs a finite-state machine with a 1-bit input, perfectgpa, and a1-bit output, shred, which is 1 when the input resume should be shredded.