arXiv subjects

Ido Kanter

Publications and source records attributed to Ido Kanter.

At least 55 records · Page 3Linked to original sources

arXiv2013

Chaos Pass Filter: Linear Response of Synchronized Chaotic Systems

The linear response of synchronized time-delayed chaotic systems to small external perturbations, i.e., the phenomenon of chaos pass filter, is investigated for iterated maps. The distribution of distances, i.e., the deviations between two synchronized chaotic units due to external perturbations on the transfered signal, is used as a measure of the linear response. It is calculated numerically and, for some special cases, analytically. Depending on the model parameters this distribution has power law tails in the region of synchronization leading to diverging moments of distances. This is a consequence of multiplicative and additive noise in the corresponding linear equations due to chaos and external perturbations. The linear response can also be quantified by the bit error rate of a transmitted binary message which perturbs the synchronized system. The bit error rate is given by an integral over the distribution of distances and is calculated analytically and numerically. It displays a complex nonmonotonic behavior in the region of synchronization. For special cases the distribution of distances has a fractal structure leading to a devil's staircase for the bit error rate as a function of coupling strength. The response to small harmonic perturbations shows resonances related to coupling and feedback delay times. A bi-directionally coupled chain of three units can completely filtered out the perturbation. Thus the second moment and the bit error rate become zero.

nlin.CD↗

arXiv2012

Discontinuous Attractor Dimension at the Synchronization Transition of Time-Delayed Chaotic Systems

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.

nlin.CD↗

arXiv2012

Strong and Weak Chaos in Networks of Semiconductor Lasers with Time-delayed Couplings

Nonlinear networks with time-delayed couplings may show strong and weak chaos, depending on the scaling of their Lyapunov exponent with the delay time. We study strong and weak chaos for semiconductor lasers, either with time-delayed self-feedback or for small networks. We examine the dependence on the pump current and consider the question whether strong and weak chaos can be identified from the shape of the intensity trace, the auto-correlations and the external cavity modes. The concept of the sub-Lyapunov exponent $λ_0$ is generalized to the case of two time-scale separated delays in the system. We give the first experimental evidence of strong and weak chaos in a network of lasers which supports the sequence 'weak to strong to weak chaos' upon monotonically increasing the coupling strength. Finally, we discuss strong and weak chaos for networks with several distinct sub-Lyapunov exponents and comment on the dependence of the sub-Lyapunov exponent on the number of a laser's inputs in a network.

nlin.CD↗

arXiv2012

Synchronization with mismatched synaptic delays: A unique role of elastic neuronal latency

We show that the unavoidable increase in neuronal response latency to ongoing stimulation serves as a nonuniform gradual stretching of neuronal circuit delay loops and emerges as an essential mechanism in the formation of various types of neuronal timers. Synchronization emerges as a transient phenomenon without predefined precise matched synaptic delays. These findings are described in an experimental procedure where conditioned stimulations were enforced on a circuit of neurons embedded within a large-scale network of cortical cells in-vitro, and are corroborated by neuronal simulations. They evidence a new cortical timescale based on tens of microseconds stretching of neuronal circuit delay loops per spike, and with realistic delays of a few milliseconds, synchronization emerges for a finite fraction of neuronal circuit delays.

q-bio.NC↗

arXiv2012

Phase transition in crowd synchrony of delay-coupled multilayer laser networks

An analogy between crowd synchrony and multi-layer neural network architectures is proposed. It indicates that many non-identical dynamical elements (oscillators) communicating indirectly via a few mediators (hubs) can synchronize when the number of delayed couplings to the hubs or the strength of the couplings is large enough. This phenomenon is modeled using a system of semiconductor lasers optically delay-coupled in either a fully connected or a diluted manner to a fixed number of non-identical central hub lasers. A universal phase transition to crowd synchrony with hysteresis is observed, where the time to achieve synchronization diverges near the critical coupling independent of the number of hubs.

nlin.CD↗

arXiv2012

Synthetic reverberating activity patterns embedded in networks of cortical neurons

Synthetic reverberating activity patterns are experimentally generated by stimulation of a subset of neurons embedded in a spontaneously active network of cortical cells in-vitro. The neurons are artificially connected by means of conditional stimulation matrix, forming a synthetic local circuit with a predefined programmable connectivity and time-delays. Possible uses of this experimental design are demonstrated, analyzing the sensitivity of these deterministic activity patterns to transmission delays and to the nature of ongoing network dynamics.

q-bio.NC↗

arXiv2011

Controlling synchronization in large laser networks using number theory

Synchronization in networks with delayed coupling are ubiquitous in nature and play a key role in almost all fields of science including physics, biology, ecology, climatology and sociology. In general, the published works on network synchronization are based on data analysis and simulations, with little experimental verification. Here we develop and experimentally demonstrate various multi-cluster phase synchronization scenarios within coupled laser networks. Synchronization is controlled by the network connectivity in accordance to number theory, whereby the number of synchronized clusters equals the greatest common divisor of network loops. This dependence enables remote switching mechanisms to control the optical phase coherence among distant lasers by local network connectivity adjustments. Our results serve as a benchmark for a broad range of coupled oscillators in science and technology, and offer feasible routes to achieve multi-user secure protocols in communication networks and parallel distribution of versatile complex combinatorial tasks in optical computers.

physics.optics↗

arXiv2011

Strong and weak chaos in nonlinear networks with time-delayed couplings

We study chaotic synchronization in networks with time-delayed coupling. We introduce the notion of strong and weak chaos, distinguished by the scaling properties of the maximum Lyapunov exponent within the synchronization manifold for large delay times, and relate this to the condition for stable or unstable chaotic synchronization, respectively. In simulations of laser models and experiments with electronic circuits, we identify transitions from weak to strong and back to weak chaos upon monotonically increasing the coupling strength.

nlin.CD↗

arXiv2010

Pulses of chaos synchronization in coupled map chains with delayed transmission

Pulses of synchronization in chaotic coupled map lattices are discussed in the context of transmission of information. Synchronization and desynchronization propagate along the chain with different velocities which are calculated analytically from the spectrum of convective Lyapunov exponents. Since the front of synchronization travels slower than the front of desynchronization, the maximal possible chain length for which information can be transmitted by modulating the first unit of the chain is bounded.

cond-mat.dis-nn↗

arXiv2010

An efficient CDMA decoder for correlated information sources

We consider the detection of correlated information sources in the ubiquitous Code-Division Multiple-Access (CDMA) scheme. We propose a message-passing based scheme for detecting correlated sources directly, with no need for source coding. The detection is done simultaneously over a block of transmitted binary symbols (word). Simulation results are provided demonstrating a substantial improvement in bit-error-rate in comparison with the unmodified detector and the alternative of source compression. The robustness of the error-performance improvement is shown under practical model settings, including wrong estimation of the generating Markov transition matrix and finite-length spreading codes.

cs.IT↗

arXiv2009

Mutual information via thermodynamics: Three different approaches

Three different approaches to derive mutual information via thermodynamics are presented where the temperature-dependent energy is given by: (a) $β\mathcal{E} = -\ln[P(X,Y)]$, (b) $β\mathcal{E} =-\ln[P(Y|X)]$ or (c) $β\mathcal{E} =-\ln[P(X|Y)]$. All approaches require the extension of the traditional physical framework and the modification of the 2nd law of thermodynamics. A realization of a physical system with an effective temperature-dependent Hamiltonian is discussed followed by a suggestion of a physical information-heat engine.

cond-mat.stat-mech↗

arXiv2009

Information and multiaccess interference in a complexity-constrained vector channel

Rodrigo de Miguel et al 2007 J. Phys. A: Math. Theor. 40 5241-5260: A noisy vector channel operating under a strict complexity constraint at the receiver is introduced. According to this constraint, detected bits, obtained by performing hard decisions directly on the channel's matched filter output, must be the same as the transmitted binary inputs. An asymptotic analysis is carried out using mathematical tools imported from the study of neural networks, and it is shown that, under a bounded noise assumption, such complexity-constrained channel exhibits a non-trivial Shannon-theoretic capacity. It is found that performance relies on rigorous interference-based multiuser cooperation at the transmitter and that this cooperation is best served when all transmitters use the same amplitude.

cs.IT↗

arXiv2008

Emergence of zero-lag synchronization in generic mutually coupled chaotic systems

Zero-lag synchronization (ZLS) is achieved in a very restricted mutually coupled chaotic systems, where the delays of the self-coupling and the mutual coupling are identical or fulfil some restricted ratios. Using a set of multiple self-feedbacks we demonstrate both analytically and numerically that ZLS is achieved for a wide range of mutual delays. It indicates that ZLS can be achieved without the knowledge of the mutual distance between the communicating partners and has an important implication in the possible use of ZLS in communications networks as well as in the understanding of the emergence of such synchronization in the neuronal activities.

nlin.CD↗

arXiv2008

Carnot in the Information Age: Discrete Symmetric Channels

Modeling communication channels as thermal systems results in Hamiltonians which are an explicit function of the temperature. The first two authors have recently generalized the second thermodynamic law to encompass systems with temperature-dependent energy levels, $dQ=TdS+ dT$, where {$<\cdot>$} denotes averaging over the Boltzmann distribution, recomputing the mutual information and other main properties of the popular Gaussian channel. Here the mutual information for the binary symmetric channel as well as for the discrete symmetric channel consisting of 4 input/output (I/O) symbols is explicitly calculated using the generalized second law of thermodynamics. For equiprobable I/O the mutual information of the examined channels has a very simple form, -$γU(γ)|_0^β$, where $U$ denotes the internal energy of the channel. We prove that this simple form of the mutual information governs the class of discrete memoryless symmetric communication channels with equiprobable I/O symbols.

cond-mat.stat-mech↗

arXiv2008

Shannon Meets Carnot: Generalized Second Thermodynamic Law

The classical thermodynamic laws fail to capture the behavior of systems with energy Hamiltonian which is an explicit function of the temperature. Such Hamiltonian arises, for example, in modeling information processing systems, like communication channels, as thermal systems. Here we generalize the second thermodynamic law to encompass systems with temperature-dependent energy levels, $dQ=TdS+ dT$, where $<\cdot>$ denotes averaging over the Boltzmann distribution and reveal a new definition to the basic notion of temperature. This generalization enables to express, for instance, the mutual information of the Gaussian channel as a consequence of the fundamental laws of nature - the laws of thermodynamics.

cond-mat.stat-mech↗

arXiv2008

Shannon Meets Carnot: Mutual Information Via Thermodynamics

In this contribution, the Gaussian channel is represented as an equivalent thermal system allowing to express its input-output mutual information in terms of thermodynamic quantities. This thermodynamic description of the mutual information is based upon a generalization of the $2^{nd}$ thermodynamic law and provides an alternative proof to the Guo-Shamai-Verdú theorem, giving an intriguing connection between this remarkable theorem and the most fundamental laws of nature - the laws of thermodynamics.

cs.IT↗

arXiv2008

Public Channel Cryptography: Chaos Synchronization and Hilbert's Tenth Problem

The synchronization process of two mutually delayed coupled deterministic chaotic maps is demonstrated both analytically and numerically. The synchronization is preserved when the mutually transmitted signal is concealed by two commutative private filters that are placed on each end of the communication channel. We demonstrate that when the transmitted signal is a convolution of the truncated time delayed output signals or some powers of the delayed output signals synchronization is still maintained. The task of a passive attacker is mapped onto Hilbert's tenth problem, solving a set of nonlinear Diophantine equations, which was proven to be in the class of NP-Complete problems. This bridge between two different disciplines, synchronization in nonlinear dynamical processes and the realm of the NPC problems, opens a horizon for a new type of secure public-channel protocols.

nlin.CD↗

arXiv2008

Patterns of Chaos Synchronization

Small networks of chaotic units which are coupled by their time-delayed variables, are investigated. In spite of the time delay, the units can synchronize isochronally, i.e. without time shift. Moreover, networks can not only synchronize completely, but can also split into different synchronized sublattices. These synchronization patterns are stable attractors of the network dynamics. Different networks with their associated behaviors and synchronization patterns are presented. In particular, we investigate sublattice synchronization, symmetry breaking, spreading chaotic motifs, synchronization by restoring symmetry and cooperative pairwise synchronization of a bipartite tree.

nlin.CD↗