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
Dissertation
Strong Induction in Hardware Model Checking
Vediramana Krishnan,Hari Govind +1 more
TL;DR: This thesis proves that strong induction is more concise than induction, and presents kAvy, an SMC algorithm that effectively uses strong induction to guide interpolation and Pdr-style incremental inductive invariant construction, and shows that using strong induction leads to faster running time and solving more instances.
Posted Content
Cancellation-free circuits: An approach for proving superlinear lower bounds for linear Boolean operators
TL;DR: It is shown that every matrix can be computed by a cancellation-free linear circuit, and almost all of these are at most a constant factor larger than the optimum linear circuit that computes the matrix.
Posted Content
An Algorithm for Constructing a Smallest Register with Non-Linear Update Generating a Given Binary Sequence
Nan Li,Elena Dubrova +1 more
TL;DR: Expected size of RNLUs constructed by the presented algorithm is proved to be O(n/log( n/p), where n is the sequence length and p is the degree of parallelization.
Journal ArticleDOI
State Assignment and Optimization of Ultra-High-Speed FSMs Utilizing Tristate Buffers
Robert Czerwinski,Dariusz Kania +1 more
TL;DR: The logic synthesis of ultra-high-speed FSMs is presented and algorithms for state assignment and optimization are presented, making possible a one-logic-level FSM structure.
Posted Content
On Asymptotic Gate Complexity and Depth of Reversible Circuits Without Additional Memory
TL;DR: It is stated that almost every reversible circuit with no additional inputs, consisting of NOT, CNOT and 2-CNOT gates, implements a transformation from F(n,0) with the gate complexity $L(n-0) \asymp n 2^n \mathop / \log_2 n$ and with the depth $D(n -o) 2-o(1) / (3\log-2 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