Journal ArticleDOI
The synthesis of two-terminal switching circuits
Reads0
Chats0
TLDR
A basic part of the general synthesis problem is the design of a two-terminal network with given operating characteristics, and this work shall consider some aspects of this problem.Abstract:
THE theory of switching circuits may be divided into two major divisions, analysis and synthesis. The problem of analysis, determining the manner of operation of a given switching circuit, is comparatively simple. The inverse problem of finding a circuit satisfying certain given operating conditions, and in particular the best circuit is, in general, more difficult and more important from the practical standpoint. A basic part of the general synthesis problem is the design of a two-terminal network with given operating characteristics, and we shall consider some aspects of this problem.read more
Citations
More filters
Book ChapterDOI
From the stack principle to ALGOL
TL;DR: The paper describes the early ideas on using stacks starting from evaluating expressions and the development processes that have led to the ALGOL language family.
Journal ArticleDOI
On monotone simulations of nonmonotone networks
TL;DR: A broad class of monotone Boolean functions is examined, proving that for almost all of the functions in the class, no such simulation exists, and that in a very weak sense negation is exponentially powerful.
Journal ArticleDOI
Fault tree conditioning methods to trace system configuration changes for the application to low-power/shutdown PSA
TL;DR: A new fault tree (FT) construction method for the LPSD PSA by using reference FTs, usually for a full-power mode, and by applying conditioning methods to thereference FTs showed that the FTs can be generated easily from those for aFull power mode as well as maintaining a consistency between the two models.
Journal Article
A tighter lower bound on the circuit size of the hardest Boolean functions
TL;DR: In [IPL2005], Frandsen and Miltersen improved bounds on the circuit size L(n) of the hardest Boolean function on n input bits: for some constant c > 0: ( 1 + log n n − c n ) 2 n n ≤ L( n) ≤ (1 + 3log n n + c n .
Book ChapterDOI
Use of gray decoding for implementation of symmetric functions
TL;DR: This paper discusses reduction of the number of product terms in representation of totally symmetric Boolean functions by Sum of Products and Fixed Polarity Reed- Muller expansions by exploiting Gray decoding of input variables.
References
More filters
Journal ArticleDOI
A logical calculus of the ideas immanent in nervous activity
Warren S. McCulloch,Walter Pitts +1 more
TL;DR: In this article, it is shown that many particular choices among possible neurophysiological assumptions are equivalent, in the sense that for every net behaving under one assumption, there exists another net which behaves under another and gives the same results, although perhaps not in the same time.
Journal ArticleDOI
A symbolic analysis of relay and switching circuits
TL;DR: It will be shown that several of the well-known theorems on impedance networks have roughly analogous theorem in relay circuits, including the delta-wye and star-mesh transformations, and the duality theorem.
Book
The axiomatic method in biology
TL;DR: Interestingly, the axiomatic method in biology that you really wait for now is coming, and it's significant to wait for the representative and beneficial books to read.
Journal ArticleDOI
The Number of Two-Terminal Series-Parallel Networks
John Riordan,Claude E. Shannon +1 more