Yuri V. Andreyev
Russian Academy of Sciences
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Yuri V. Andreyev.
IEEE Transactions on Neural Networks | 1996
Yuri V. Andreyev; Yuri L. Belsky; A. S. Dmitriev; Dmitri A. Kuminov
In this work, we study information processing applications of complex dynamics and chaos in neural networks. We discuss mathematical models based on piecewise-linear maps which enable us to realize the basic functions of information processing using complex dynamics and chaos. Realizations of these models using recurrent neural-like systems are presented.
IEEE Transactions on Circuits and Systems I-regular Papers | 1997
Yuri V. Andreyev; A. S. Dmitriev; Sergey Olegovich Starkov
Mathematical models are proposed, based on one-dimensional piecewise-linear maps, in which complex dynamics, bifurcation phenomena and chaos are used for information processing.
International Journal of Bifurcation and Chaos | 2005
Yuri V. Andreyev; A. S. Dmitriev; E. V. Efremova; Alexander D. Khilinsky; Lev V. Kuzmin
This paper shows how the qualitative theory of dynamical systems, that is intensively developed during the last forty years, is currently applied in practice to provide effective wireless ultrawideband communications using chaotic information carrier.
IEEE Transactions on Circuits and Systems I-regular Papers | 2003
Yuri V. Andreyev; A. S. Dmitriev; E. V. Efremova; A.N. Anagnostopoulos
The problem of separation of an observed sum of chaotic signals into the individual components is considered in the presence of noise. A noise threshold is found above which high-quality separation is impossible. This effect is shown to be associated with the information content of chaotic signals and a theoretical estimate is given for the threshold. A method for signal separation is proposed, which uses iteration of the chaotic source equations in reverse time. The method allows us to approach the theoretical limit threshold.
Chaos Solitons & Fractals | 2003
Yuri V. Andreyev; A. S. Dmitriev; E. V. Efremova; A.N. Anagnostopoulos
Abstract One of the features of chaotic signals that make them different of other types of signals is their special information properties. In this paper, we investigate the effect of these properties on the procedures of chaotic signal processing. On examples of cleaning chaotic signals off noise, chaotic synchronization and separation of chaotic signals we demonstrate the existence of basic limits imposed by information theory on chaotic signal processing, independent of concrete algorithms. Relations of these limits with the Second law, Shannon theorems and Landauer principle are discussed.
international symposium on circuits and systems | 2000
Yuri V. Andreyev; A. S. Dmitriev; E. V. Efremova
In this report we discuss the problem of separating the sum of chaotic signals into the individual components with a procedure of backward iteration of the mapping equations describing the chaotic sources. We show that the proposed approach has good stability in respect to additive external noise.
International Journal of Bifurcation and Chaos | 1999
Yuri V. Andreyev; A. S. Dmitriev
We investigate the phenomena on the edge of spatially homogeneous chaotic mode and spatiotemporal chaos in a lattice of chaotic 1D maps with local connections. We show that spatially homogeneous chaotic mode cannot exist in a lattice with local connections if the Lyapunov exponent λ of the isolated chaotic map is greater than some critical positive value. We propose a few schemes that make spatial synchronization possible in large lattices. If the idea of only local connections is abandoned, the number of connections necessary for synchronization dramatically decreases to three per node. We also propose a model of a lattice with an external pacemaker, where we find a spatially homogeneous mode synchronous with the pacemaker, as well as different from the pacemaker mode.
Archive | 2013
A. A. Dmitriev; A. S. Dmitriev; Yuri V. Andreyev; E. V. Efremova; Ioannis P. Antoniades; Amalia Miliou; A.N. Anagnostopoulos
Data stream coder based on chaotic synchronous response is considered. An estimate of the number of keys available in this scheme is obtained by cascading the basic building block of the system and thus repeating the encoding procedures. Efficiency of the discussed algorithm (in the sense of computational expenses) is evaluated and compared to known cryptographic algorithms. As it is shown, the efficiency increases in the case of smaller number of repetitions and greater number of encoding function parameters.
international conference on control of oscillations and chaos | 2000
Yuri V. Andreyev; A.S. Dmitiriev; E. V. Efremova
Here we describe a method for separating the sum of chaotic signals into the individual components, using the inherent underlying dynamics of the chaotic sources. Capabilities of the method are demonstrated on example of discrete-time systems, one-dimensional logistic maps. We demonstrate that the proposed approach based on backward iteration of the mapping equations describing the chaotic sources has good resistance in respect to additive external noise.
ieee international workshop on cellular neural networks and their applications | 1998
A. S. Dmitriev; Yuri V. Andreyev
We investigate phenomena of the edge of spatially uniform chaotic mode and spatial temporal chaos in a lattice of chaotic 1D maps with only local connections. It is shown that in autonomous lattice with local connections, spatially uniform chaotic mode cannot exist if the Lyapunov exponent /spl lambda/ of the isolated chaotic map is greater than some critical value /spl lambda//sub cr/>0. We proposed a model of a lattice with a pacemaker and found a spatially uniform mode synchronous with the pacemaker, as well as a spatially uniform mode different from the pacemaker mode.