Learning as a function of task complexity was examined in human learning and two connectionist simulations. An example task involved learning to map basic input/output digital logic functions for six digital gates (AND OR, XOR and negated versions) with 2or 6-inputs. Humans given instruction learned the task in about 300 trials and showed no effect of the number of inputs. Backpropagation learn...

Placement is an important step in the overall IC design process, as it defines the on-chip interconnects, which are the bottleneck in determining circuit performance. Grid-warping is a new placement algorithm based on a strikingly simple idea: rather than move the gates to optimize their location, we elastically deform a model of the 2-D chip surface on which the gates have been roughly placed,...

The Pockels effect in periodically poled lithium niobate made it possible to switch optical signals between two orthogonal optical linear polarizations of the vertical and horizontal polarization states. Based on this effect, we demonstrated polarization-based binary optical logic gates: AND, and OR gates. By combining these basic gates with other polarization-based optical logic gates such as ...

There are many articles and patents on the masking of logic gates. However, the existing publications assume that a masked logic gate switches its output no more than once per clock cycle. Unfortunately, this assumption usually does not hold true in practice. In this article, we show that glitches occurring in circuits of masked gates make these circuits susceptible to classical first-order DPA...

Logic gates were fabricated from an array of configurable switches, each consisting of a monolayer of redox-active rotaxanes sandwiched between metal electrodes. The switches were read by monitoring current flow at reducing voltages. In the "closed" state, current flow was dominated by resonant tunneling through the electronic states of the molecules. The switches were irreversibly opened by ap...

We investigate the possibility of realising effective quantum gates between two atoms in distant cavities coupled by an optical fibre. We show that highly reliable swap and entangling gates are achievable. We exactly study the stability of these gates in presence of imperfections in coupling strengths and interaction times and prove them to be robust. Moreover, we analyse the effect of spontane...

We consider boolean circuits computing n-operators f : {0, 1} n → {0, 1} n. As gates we allow arbitrary boolean functions; neither fanin nor fanout of gates is restricted. An operator is linear if it computes n linear forms, that is, computes a matrix-vector product A x over GF (2). We prove the existence of n-operators requiring about n 2 wires in any circuit, and linear n-operators requiring ...

Abshrrct: Resistance of VLSI interconnections has become significant due to large die sizes and sub-mkm geometries in high performance designs. Previous studies have proposed optimal repeater schemes wing slmple buffers for delay optimization of the interconnection. This paper proposes a more general approach that handles arbitrary logic gates as well as buffers. The methodology is based on an ...

For decision problems Π(B) defined over Boolean circuits using gates from a restricted set B only, we have Π(B) ≤AC 0 m Π(B ) for all finite sets B and B of gates such that all gates from B can be computed by circuits over gates from B. In this note, we show that a weaker version of this statement holds for decision problems defined over Boolean formulae, namely that Π(B) ≤NC 2 m Π(B ∪ {∧,∨}) a...

Quantum Computing hopefully is the future of computing systems. It still on its first steps. The development of some quantum algorithms gives the quantum computing a boost on its importance. These algorithms (such as Shor’s and Grover’s algorithms) proved to have superior performance over classical algorithms [1-4]. The recent findings, that quantum error correction can be used, showed that the...