We demonstrate how a genetic ring oscillator network with quorum sensing feedback can operate as a robust logic gate. Specifically we show how a range of logic functions, namely AND/NAND, OR/NOR and XOR/XNOR, can be realized by the system, thus yielding a versatile unit that can morph between different logic operations. We further demonstrate the capacity of this system to yield complementary l...

Memristors have been suggested as a novel route to neuromorphic computing based on the similarity between them and neurons (specifically synapses and ion pumps). The d.c. action of the memristor is a current spike which imparts a short-term memory to the device. Here it is demonstrated that this short-term memory works exactly like habituation (e.g. in Aplysia). We elucidate the physical rules,...

In this work, we employ two Mach-Zehnder modulators (MZM) to achieve a novel six kinds of reconfigurable optical logic gate in millimeter wave over fiber, which one MZM is used generate (mm-wave) signal and the other attain gate. By adjusting direct current (DC) bias voltage first MZM, frequency doubling mm-wave can be obtained no filter needed. controlling radio (RF) drive DC second phase betw...

Considerations of feasibility of quantum computing lead to the study of multispin quantum gates in which the input and output two-state systems (spins) are not identical. We provide a general discussion of this approach and then propose an explicit two-spin interaction Hamiltonian which accomplishes the quantum XOR gate function for a system of three spins: two input and one output. PACS number...

This work is a study of DES-like ciphers where the bitwise exclusive-or (XOR) operation in the underlying Feistel network is replaced by an arbitrary group operation. We construct a two round simplified version of DES that contains all the DES components and show that its set of encryption permutations is not a group under functional composition, it is not a pure cipher and its set of encryptio...

We present our earlier results (not included in Hars and Petruska due to space and time limitations), as well as some updated versions of those, and a few more recent pseudorandom number generator designs. These tell a systems designer which computer word lengths are suitable for certain high-quality pseudorandom number generators, and which constructions of a large family of designs provide lo...

In this paper, we consider joint network and LDPC coding for practically implementing the denosie-and-forward protocol over bi-directional relaying. the closed-form expressions for computing the log-likelihood ratios of the network-coded codewords have been derived for both real and complex multipleaccess channels. It is revealed that the equivalent channel observed at the relay is an asymmetri...