基于时变耦合映像格子模型的信号初值估计

从耦合映像格子中,恢复系统初始条件是耦合系统求逆问题,也是信号处理研究中的一个关键性问题.本文在符号动力学方法的基础上,对映像系数进行修正,针对耦合单峰Logistic映射,提出一种基于时变映像系数恢复信号初值的新方法.在映像过程无噪或受到高斯白噪声污染时,本文方法都能够较好地恢复信号初值的统计特性,而且具有较小的偏差和均方误差,并与原信号之间具有较强的相关性,从而能够更好和更加合理地刻画实际信号的物理过程,对系统初值做出更优的估计. 关键词： 耦合映像格子 恢复初值的统计特性 时变映像系数     

基于多重耦合映像格子的信号初值恢复研究

利用耦合映像格子恢复信号初值是信号处理研究中一个重要的问题.耦合映像格子具有混沌系统的初值敏感性，当初值受到噪声污染时将会影响到系统对其的恢复.提出了一种由多个一维耦合映像格子系统并列耦合而成的多重耦合映像格子系统，通过将多个一维系统耦合，使因受到噪声干扰而趋向于指数分离的混沌轨道相互靠近，以达到抑制噪声的目的.数值仿真表明，该系统具有较强的抗噪声能力和较高的鲁棒性.在耦合系数选取适当的情况下，即使初始信号受到噪声干扰，该多重耦合系统仍然能够很好地恢复信号初值的统计特性，且对单个初值的恢复情况及与初始信号 关键词： 耦合映像格子 恢复信号的统计特性 多重耦合     

用符号分析法显示时空混沌信号之间的相互关系

基于耦合映射格子模型, 用符号分析法研究了时空混沌信号的相互关系. 数值计算结果表明, 两个直接耦合的格子之间或两个未直接耦合但邻近的格子之间的条件熵存在一个尖锐的极小值, 而两个距离比较远的格子之间的条件熵则没有尖锐的极小值. 因此, 耦合映射格子系统产生的时空混沌信号之间的相互关系可以通过符号分析的方法显示出来.     

耦合映象格子中时空混沌的控制

采用相同的相空间压缩方法,有效地控制了均匀及非均匀耦合映象格子中的时空混沌.数值模拟结果表明,在一定的相空间压缩参数区域内,控制时空混沌到均匀稳定状态时,控制结果与控制参数之间存在确定的函数关系.利用这个控制方程,选择不同的相空间压缩参数控制耦合映象格子中的时空混沌,获得了各种所需要的稳定斑图 关键词： 时空混沌 耦合映象格子     

非线性耦合时空混沌系统的反同步研究

利用非线性耦合方法研究了离散型时空混沌系统的反同步问题.对时空混沌系统的线性项和非线性项进行适当的分离,利用系统本身的非线性项作为耦合函数,实现了两个二维耦合映象格子的反同步.进一步将这种非线性耦合方法推广应用到由二维耦合映象格子构成复杂网络的反同步研究中,仿真模拟发现仍具有理想的反同步效果. 关键词： 反同步 非线性耦合 耦合映象格子 复杂网络     

单向耦合映象格子的时空混沌同步

以耦合映象格子为对象,研究了时空混沌系统的同步问题. 基于Lyapunov稳定性定理,通过恰当地选择驱动函数,实现了两个单向耦合映象格子的完全同步. 仿真模拟验证了这种同步方法的有效性. 讨论了控制参量对同步速率的影响. 仿真模拟还表明,在存在系统偏差并受到噪声影响的情况下,仍然可以实现两系统的同步,这种同步方法具有一定的抗干扰能力. 关键词： 时空混沌 同步 耦合映象格子     

耦合双稳映象格子模型的时空混沌控制

变量反馈技术实现了耦合双稳映象格子模型的时空混沌控制.数值实验结果表明,利用不同的反馈技术和不同的反馈强度,可以将双稳映象系统的混沌及耦合双稳映象格子模型的时空混沌控制到不动点或周期轨道.变量反馈控制法除了局域双稳映象系统的定态点外,不需要先获取耦合双稳映象格子时空系统的动力学信息,它对抑制耦合双稳映象系统中的湍流具有一定的指导作用.     

基于符号向量动力学的耦合映像格子参数估计

本文,将符号动力学推广到耦合映像格子中,以Logistic映射下耦合映像格子为研究对象,研究控制参数对符号向量序列动力学特性的影响.通过研究耦合映像格子逆函数,给出耦合映像格子的遍历条件.进一步,将给出系统初始向量,禁止字以及控制参数的符号向量序列描述方法,并最终给出基于符号向量动力学的耦合映像格子控制参数估计方法.实验结果表明,根据本文算法可以有效建立符号序列和耦合映像格子控制参数之间的对应关系,能够更好地刻画了实际模型的物理过程. 关键词： 符号向量动力学 耦合映像格子 参数估计 遍历性     

二维均匀耦合映象格子中的时空周期图案

目的——构造二维均匀耦合映象格子中的时空周期图案;方法——通过一维耦合映象格子模型的相空间中已知低空间周期轨道,直接构造二维均匀耦合映象格子模型中一系列空间周期轨道,而不必求解其模型方程,并对构造轨道的稳定性进行分析;结果——L²×L²雅可比矩阵可化简为几个2×2矩阵组成的对角矩阵;结论——所构造轨道的稳定性不可能比原来轨道的稳定性高. 关键词： 耦合映象格子 时空周期图案 雅可比矩阵     

基于单向耦合映象格子生成伪随机位序列的两种新方法

基于时空混沌单向耦合映象格子模型,提出生成伪随机位序列的两种新方法：利用耦合映象格子状态的不变分布特性,选取合适基准对系统中格点状态序列进行判决,生成伪随机位序列;以及基于方向相的思想,通过比较一个格点相邻时间的两个状态值来生成伪随机位序列.对生成序列的性能进行了详细分析,数值实验结果表明,它们具有理想的平衡性、相关性和游程特性,可以应用于信息安全、密码学和数字通信等领域. 关键词： 伪随机位序列 单向耦合映象格子 不变分布 方向相     

A method of recovering the initial vectors of globally coupled map lattices based on symbolic dynamics

Based on symbolic dynamics, a novel computationally efficient algorithm is proposed to estimate the unknown initial vectors of globally coupled map lattices (CMLs). It is proved that not all inverse chaotic mapping functions are satisfied for contraction mapping. It is found that the values in phase space do not always converge on their initial values with respect to sufficient backward iteration of the symbolic vectors in terms of global convergence or divergence (CD). Both CD property and the coupling strength are directly related to the mapping function of the existing CML. Furthermore, the CD properties of Logistic, Bernoulli, and Tent chaotic mapping functions are investigated and compared. Various simulation results and the performances of the initial vector estimation with different signal-to-noise ratios (SNRs) are also provided to confirm the proposed algorithm. Finally, based on the spatiotemporal chaotic characteristics of the CML, the conditions of estimating the initial vectors using symbolic dynamics are discussed. The presented method provides both theoretical and experimental results for better understanding and characterizing the behaviours of spatiotemporal chaotic systems.     

Synchronization of spatiotemporal chaotic systems and application to secure communication of digital image

Coupled map lattices (CMLs) are taken as examples to study the synchronization of spatiotemporal chaotic systems.In this paper,we use the nonlinear coupled method to implement the synchronization of two coupled map lattices.Through the appropriate separation of the linear term from the nonlinear term of the spatiotemporal chaotic system,we set the nonlinear term as the coupling function and then we can achieve the synchronization of two coupled map lattices.After that,we implement the secure communication of digital image using this synchronization method.Then,the discrete characteristics of the nonlinear coupling spatiotemporal chaos are applied to the discrete pixel of the digital image.After the synchronization of both the communication parties,the receiver can decrypt the original image.Numerical simulations show the effectiveness and the feasibility of the proposed program.     

基于符号向量动力学的耦合映像格子初始向量估计

在符号动力学的基础上,探讨了基于符号向量序列的局部耦合映像格子求逆问题,证明了相空间I^N上任意取值通过基于符号向量序列的逆迭代过程必然收敛至初始向量,提出了基于符号向量动力学的初始向量估计算法,从而建立了耦合映像格子符号序列和实际动力系统相空间的对应关系.实验结果表明,根据该算法可以有效建立符号向量序列和耦合映像格子相空间之间的对应关系,更好地刻画了实际模型的物理过程. 关键词： 耦合映像格子 符号动力学 初始向量估计     

A method of estimating initial conditions of coupled maplattices based on time-varying symbolic dynamics

A novel computationally efficient algorithm in terms of the time-varying symbolic dynamic method is proposed to estimate the unknown initial conditions of coupled map lattices (CMLs). The presented method combines symbolic dynamics with time-varying control parameters to develop a time-varying scheme for estimating the initial condition of multi-dimensional spatiotemporal chaotic signals. The performances of the presented time-varying estimator in both noiseless and noisy environments are analysed and compared with the common time-invariant estimator. Simulations are carried out and the obtained results show that the proposed method provides an efficient estimation of the initial condition of each lattice in the coupled system. The algorithm cannot yield an asymptotically unbiased estimation due to the effect of the coupling term, but the estimation with the time-varying algorithm is closer to the Cramer--Rao lower bound (CRLB) than that with the time-invariant estimation method, especially at high signal-to-noise ratios (SNRs).     

Stability analysis of coupled map lattices at locally unstable fixed points

Numerical simulations of coupled map lattices (CMLs) and other complex model systems show an enormous phenomenological variety that is difficult to classify and understand. It is therefore desirable to establish analytical tools for exploring fundamental features of CMLs, such as their stability properties. Since CMLs can be considered as graphs, we apply methods of spectral graph theory to analyze their stability at locally unstable fixed points for different updating rules, different coupling scenarios, and different types of neighborhoods. Numerical studies are found to be in excellent agreement with our theoretical results.     

Renormalization Group for Strongly Coupled Maps

Systems of strongly coupled chaotic maps generically exhibit collective behavior emerging out of extensive chaos. We show how the well-known renormalization group (RG) of unimodal maps can be extended to the coupled systems, and in particular to coupled map lattices (CMLs) with local diffusive coupling. The RG relation derived for CMLs is nonperturbative, i.e., not restricted to a particular class of configurations nor to some vanishingly small region of parameter space. After defining the strong-coupling limit in which the RG applies to almost all asymptotic solutions, we first present the simple case of coupled tent maps. We then turn to the general case of unimodal maps coupled by diffusive coupling operators satisfying basic properties, extending the formal approach developed by Collet and Eckmann for single maps. We finally discuss and illustrate the general consequences of the RG: CMLs are shown to share universal properties in the space-continuous limit which emerges naturally as the group is iterated. We prove that the scaling properly ties of the local map carry to the coupled systems, with an additional scaling factor of length scales implied by the synchronous updating of these dynamical systems. This explains various scaling laws and self-similar features previously observed numerically.     

Encryption and decryption of images with chaotic map lattices

We propose a secure algorithm for direct encryption and decryption of digital images with chaotic map lattices. The basic idea is to convert, pixel by pixel, the image color to chaotic logistic maps one-way coupled by initial conditions. After small numbers of iterations and cycles, the image becomes indistinguishable due to inherent properties of chaotic systems. Since the maps are coupled, the image can be completely recovered by the decryption algorithm if map parameters, number of iterations, number of cycles, and the image size are exactly known.