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
Journal ArticleDOI
New upper bounds on the Boolean circuit complexity of symmetric functions
TL;DR: Improved upper bounds on the circuit complexity of symmetric Boolean functions are presented, including circuits of size 4.5n+o(n) for any symmetric function of n variables, as well as circuits of sizes 3n for MOD"3^n function.
Journal ArticleDOI
A Transform for Logic Networks
TL;DR: The transform presented in this paper applies to functions which describe logic network behavior, and both form and development of this transform pair resembles the Fourier transform in harmonic analysis.
Book ChapterDOI
Local Encoding Transformations for Optimizing OBDD-Representations of Finite State Machines
TL;DR: This paper investigates the potential of re-encoding techniques, proposes the use of an XOR-transformation and shows why this transformation is most suitable among the set of all encoding transformations, and shows a reduction of the OBDD-sizes.
Journal ArticleDOI
The complexity of information extraction
TL;DR: This work has shown that allowing small errors in the implementation of f saves a lot in the iow entropy case but saves nothing in the high-entropy case, and if f is partially structured, the implementation cost is reduced substantially.
Proceedings ArticleDOI
Junto-Symmetric Functions, Hypergraph Isomorphism and Crunching
TL;DR: It is proved that isomorphism to any boolean function on {0, 1}n with a polynomial number of distinct permutations can be tested with a number of queries that is independent of n.
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