DIGITAL SPEECH COMMUNICATION BY TRUNCATED CHAOTIC SYNCHRONIZATION

2003 ◽  
Vol 13 (03) ◽  
pp. 691-701 ◽  
Author(s):  
Y. ZHANG ◽  
G. H. DU ◽  
Y. M. HUA ◽  
J. J. JIANG

The method of truncated chaotic synchronization is suggested for digital speech communication. The sequence, composed by truncating some byte segments from the low-dimensional chaotic attractor, demonstrates complicated dynamics and high dimension. Predicting the dynamics of the truncated map through the local approximation method becomes very difficult. However, synchronization lets the message be exactly recovered. The synchronization condition is deduced to synchronize two systems of the truncated one-way coupled ring maps. The sensitivity of synchronization to parameter mismatch is discussed for the security in communication. For the mismatch of parameters or keys, the probability of decoding the message through guessing the keys is below 2-200. The scheme of truncated chaotic synchronization has strong security in encoding message.

2010 ◽  
Vol 24 (29) ◽  
pp. 5675-5682 ◽  
Author(s):  
YU-LING FENG ◽  
XI-HE ZHANG ◽  
ZHI-GANG JIANG ◽  
KE SHEN

This paper investigates chaotic synchronization in the generalized sense in two resistive-capacitive-inductive-shunted (RCL-shunted) Josephson junctions (RCLSJJs) by using the means of unidirectionally coupling. The numerical simulations confirm that the generalized synchronization of chaos in these two systems can be achieved with a suitable coupling intensity when the maximum condition Lyapunov exponent (MCLE) is negative. Also, the auxiliary system approach is used to detect the existence of the generalized synchronization.


2018 ◽  
Author(s):  
Stefano Recanatesi ◽  
Gabriel Koch Ocker ◽  
Michael A. Buice ◽  
Eric Shea-Brown

AbstractThe dimensionality of a network’s collective activity is of increasing interest in neuroscience. This is because dimensionality provides a compact measure of how coordinated network-wide activity is, in terms of the number of modes (or degrees of freedom) that it can independently explore. A low number of modes suggests a compressed low dimensional neural code and reveals interpretable dynamics [1], while findings of high dimension may suggest flexible computations [2, 3]. Here, we address the fundamental question of how dimensionality is related to connectivity, in both autonomous and stimulus-driven networks. Working with a simple spiking network model, we derive three main findings. First, the dimensionality of global activity patterns can be strongly, and systematically, regulated by local connectivity structures. Second, the dimensionality is a better indicator than average correlations in determining how constrained neural activity is. Third, stimulus evoked neural activity interacts systematically with neural connectivity patterns, leading to network responses of either greater or lesser dimensionality than the stimulus.Author summaryNew recording technologies are producing an amazing explosion of data on neural activity. These data reveal the simultaneous activity of hundreds or even thousands of neurons. In principle, the activity of these neurons could explore a vast space of possible patterns. This is what is meant by high-dimensional activity: the number of degrees of freedom (or “modes”) of multineuron activity is large, perhaps as large as the number of neurons themselves. In practice, estimates of dimensionality differ strongly from case to case, and do so in interesting ways across experiments, species, and brain areas. The outcome is important for much more than just accurately describing neural activity: findings of low dimension have been proposed to allow data compression, denoising, and easily readable neural codes, while findings of high dimension have been proposed as signatures of powerful and general computations. So what is it about a neural circuit that leads to one case or the other? Here, we derive a set of principles that inform how the connectivity of a spiking neural network determines the dimensionality of the activity that it produces. These show that, in some cases, highly localized features of connectivity have strong control over a network’s global dimensionality—an interesting finding in the context of, e.g., learning rules that occur locally. We also show how dimension can be much different than first meets the eye with typical “pairwise” measurements, and how stimuli and intrinsic connectivity interact in shaping the overall dimension of a network’s response.


Author(s):  
Jing Wang ◽  
Jinglin Zhou ◽  
Xiaolu Chen

AbstractIndustrial data variables show obvious high dimension and strong nonlinear correlation. Traditional multivariate statistical monitoring methods, such as PCA, PLS, CCA, and FDA, are only suitable for solving the high-dimensional data processing with linear correlation. The kernel mapping method is the most common technique to deal with the nonlinearity, which projects the original data in the low-dimensional space to the high-dimensional space through appropriate kernel functions so as to achieve the goal of linear separability in the new space. However, the space projection from the low dimension to the high dimension is contradictory to the actual requirement of dimensionality reduction of the data. So kernel-based method inevitably increases the complexity of data processing.


2020 ◽  
Vol 12 (0) ◽  
pp. 1-3 ◽  
Author(s):  
Matsvei Hvozdzeu ◽  
Maksim Karpovich

To examine the opportunity of measuring bulk solids consumption the experimental setup was developed. The main problem was the presence of a non-harmonic signal at the output. Almost always there are some difficulties to build measuring circuits using non-harmonic signals. It is necessary to use one of the approximation methods to receive a wanted signal without noise. For this purpose, the local approximation method was chosen. The developed technique confirmed its positive aspects and allowed to solve the questions that were posed before the experimental setup.


2019 ◽  
Vol 15 (2) ◽  
pp. 1745-1783
Author(s):  
Florentina Bunea ◽  
Angelika Rohde ◽  
Patrick Wolfe ◽  
Harrison Zhou

Solar Physics ◽  
1986 ◽  
Vol 107 (1) ◽  
pp. 39-45 ◽  
Author(s):  
J�rgen Kurths ◽  
Hanspeter Herzel

2016 ◽  
Vol 14 (1) ◽  
pp. 64-75
Author(s):  
Zhuoxi Yu ◽  
YuJia Jin ◽  
Milan Parmar ◽  
Limin Wang

In the era of the development in network economy, e-commerce sites' operational efficiency is in relation to the development of enterprises. Thus, how to evaluate e-commerce sites have become a hot topic. Due to the evaluation index of e-commerce sites have the characteristics of high dimension and data inhomogeneity, the new method combines PCA with the improved OPTICS algorithm to classify and evaluate the e-commerce demonstration enterprise websites. Firstly, using PCA to reduce the dimension of high-dimensional data. Secondly, for the limitation of OPTICS algorithm in dealing with sparse points, then using the improved OPTICS algorithm in clustering low-dimensional data to evaluate the effect of e-commerce sites and make suggestions.


2002 ◽  
Vol 13 (07) ◽  
pp. 917-929 ◽  
Author(s):  
HANS-GEORG MATUTTIS ◽  
KURT FISCHER ◽  
NOBUYASU ITO ◽  
MASAMICHI ISHIKAWA

One obstacle in the simulation of quantum circuits is the high dimension of the Hilbert space. Using auxiliary field decompositions known from many-particle simulation, we can transform the mathematical description of the quantum circuit into a combination low-dimensional product states which can be sampled using Monte Carlo techniques. We demonstrate the method using Simon's algorithm for the detection of the period of a function.


Sign in / Sign up

Export Citation Format

Share Document