Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userChaotic Attractor Hopping yields Logic Operations
146
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Certain nonlinear systems can switch between dynamical attractors occupying different regions of phase space, under variation of parameters or initial states. In this work we exploit this feature to obtain reliable logic operations. With logic output 0 or 1 mapped to dynamical attractors bounded in distinct regions of phase space, and logic inputs encoded by a very small bias parameter, we explicitly demonstrate that the system hops consistently in response to an external input stream, operating effectively as a reliable logic gate. This system offers the advantage that very low-amplitude inputs yield highly amplified outputs. Additionally, different dynamical variables in the system yield complementary logic operations in parallel. Further, we show that in certain parameter regions noise aids the reliability of logic operations, and is actually necessary for obtaining consistent outputs. This leads us to a generalization of the concept of Logical Stochastic Resonance to attractors more complex than fixed point states, such as periodic or chaotic attractors. Lastly, the results are verified in electronic circuit experiments, demonstrating the robustness of the phenomena. So we have combined the research directions of Chaos Computing and Logical Stochastic Resonance here, and this approach has the potential to be realized in wide-ranging systems.
rate research
Read More
The Nikolaevskiy model for pattern formation with continuous symmetry exhibits spatiotemporal chaos with strong scale separation. Extensive numerical investigations of the chaotic attractor reveal unexpected scaling behavior of the long-wave modes. Surprisingly, the computed amplitude and correlation time scalings are found to differ from the values obtained by asymptotically consistent multiple-scale analysis. However, when higher-order corrections are added to the leading-order theory of Matthews and Cox, the anomalous scaling is recovered.
The attractor dimension at the transition to complete synchronization in a network of chaotic units with time-delayed couplings is investigated. In particular, we determine the Kaplan-Yorke dimension from the spectrum of Lyapunov exponents for iterated maps and for two coupled semiconductor lasers. We argue that the Kaplan-Yorke dimension must be discontinuous at the transition and compare it to the correlation dimension. For a system of Bernoulli maps we indeed find a jump in the correlation dimension. The magnitude of the discontinuity in the Kaplan-Yorke dimension is calculated for networks of Bernoulli units as a function of the network size. Furthermore the scaling of the Kaplan-Yorke dimension as well as of the Kolmogorov entropy with system size and time delay is investigated.
In this paper, we demonstrate, first in literature known to us, that potential functions can be constructed in continuous dissipative chaotic systems and can be used to reveal their dynamical properties. To attain this aim, a Lorenz-like system is proposed and rigorously proved chaotic for exemplified analysis. We explicitly construct a potential function monotonically decreasing along the systems dynamics, revealing the structure of the chaotic strange attractor. The potential function can have different forms of construction. We also decompose the dynamical system to explain for the different origins of chaotic attractor and strange attractor. Consequently, reasons for the existence of both chaotic nonstrange attractors and nonchaotic strange attractors are clearly discussed within current decomposition framework.
Recently two encryption schemes were proposed by combining circular bit shift and XOR operations, under the control of a pseudorandom bit sequence (PRBS) generated from a chaotic system. This paper studies the security of these two encryption schemes and reports the following findings: 1) there exist some security defects in both schemes; 2) the underlying chaotic PRBS can be reconstructed as an equivalent key by using only two chosen plaintexts; 3) most elements in the underlying chaotic PRBS can be obtained by a differential known-plaintext attack using only two known plaintexts. Experimental results are given to demonstrate the feasibility of the proposed attack.
When a shallow layer of inviscid fluid flows over a substrate, the fluid particle trajectories are, to leading order in the layer thickness, geodesics on the two-dimensional curved space of the substrate. Since the two-dimensional geodesic equation is a two degree-of-freedom autonomous Hamiltonian system, it can exhibit chaos, depending on the shape of the substrate. We find chaotic behaviour for a range of substrates.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
