Logistic－MaP混沌扩频序列

混沌作为一种非线性动态系统中的现象，受到了人们的重视，研究工作者纷纷探索它在通信中的可能应用．本文分析了一种广泛研究的离散时间动态系统Ｌｏｇｉｓｔｉｃ－Ｍａｐ所产生的混沌序列的白噪声统计特性．为适应实际需要还给出了Ｌｏｇｉｓｔｉｃ－Ｍａｐ简便的数字硬件实现方法．据此，进一步提出数字混沌序列的概念，研究了数字混沌序列在ＣＤＭＡＤＳ／ＳＳ通信系统中的具体应用．仿真数据显示Ｌｏｇｉｓｔｉｃ－Ｍａｐ数字混沌序列拥有较理想的自相关和互相关特性，且数目极大，适合作为扩频地址码．     

Research on image encryption based on Erbium-doped fiber laser system with optical delay feedback

A novel image encryption algorithm that based on Erbium-doped fiber laser with an optical delay feedback (ODF-EDFL) system is proposed in this paper. First, by the dynamic analysis of this system, two different chaotic sequences are generated. Meanwhile, the statistic characteristic is verified on this chaotic sequence. On this basis, the image encryption algorithm is designed by using this chaotic sequence: the gray value of the original image is substituted with the chaotic sequence at beginning; then the space array of the image's pixel is mixed up by using both two chaotic sequences. The experimental results show that the proposed method can encrypt digital images quickly and effectively.     

一种新型钟控混沌跳频序列构造方法

针对传统单一的混沌跳频序列的汉明相关性差、极易被攻击的缺点,将传统密码学中经典的时钟控制方法引入到跳频当中,结合混沌动力学提出了一种新型的钟控混沌跳频序列产生方法.理论研究与仿真结果证明这种方法极大地增加了系统抗干扰,抗截获的能力,同时对序列的周期性,相关性,线性复杂度和相空间分布等性能也有较大地提高,且该结构便于硬件实现,具有广泛的应用前景.     

基于Tent混沌序列的数字图像加密方法

Tent混沌映射结构简单但产生的混沌序列随机性能好,采用NIST测试能权威地检测序列的随机性能。通常运用混沌加密数字图像时,都是指定初值和控制参数。在此使用改进后的混沌序列,把初值的产生和明文图像联系起来,对图像进行置乱,再改变灰度值。仿真验证了此算法加解密的有效性和良好的安全性能。     

一种高安全性的复合混沌序列的性能研究

基于Logistic型混沌序列及Chebyshev型混沌序列构造出一种新的复合型混沌序列。对该复合型混沌序列的初值敏感性和复杂度等混沌性质以及平衡性、相关性等扩频性能进行了仿真研究。仿真结果表明,该复合型混沌序列有着更强的初值敏感性和更高的复杂度;除此之外,该复合型混沌序列在平衡性、自相关、互相关方面性能不仅优于原混沌序列,而且与应用在GPS系统中的P码相比,在相关性性能方面也有优势。本文提出一种序列优选方式,通过该优选方法选出的复合型混沌序列数目比Logistic型和Chebyshev型混沌序列的优选序列数分别多出31%和67%。该复合型混沌序列是一种安全性高,扩频性能优良,生成简单,序列数目众的扩频码片。     

基于FPGA的数字混沌序列的实现及性能分析

为了产生数字混沌PN序列,提出了一种基于FPGA平台的连续混沌数字化技术.针对一个混沌系统,利用理论和 数值仿真对系统的基本特性进行了分析,通过Lyapunov指数谱和分叉图对系统的状态转换进行了分析.在Matlab的Simulink 下,利用DSPBuilder设计了一个电路,并转换成VHDL代码程序,用Quartu...     

Complex chaotic discrete signals in telecommunications, radar, and navigation systems

Discrete chaotic signals with a high information capacity are developed and studied on the basis of nonlinear chaotic dynamic systems. The structural and fractal complexity of pseudorandom integer and binary sequences is analyzed. A model digital spread-spectrum radio channel is used to show experimentally that the chaotic algorithms developed can be applied efficiently in various radio facilities, such as telecommunications, radar, and navigation systems. A technique is developed for forming a reproducible irregular fractal structure involved in frequency-independent fractal antennas with a given fractal dimension. An integer chaotic algorithm with retardation is employed to generate a pseudorandom sequence.     

基于蔡氏电路的数字混沌序列的性能研究

首先指出了传统的混沌伪随机序列的缺陷,并从理论上进行了分析,进而提出一种采用A/D转换方式对模拟的蔡氏混沌电路进行数字化,相应处理后,生成真正意义上的数字混沌序列的方法。通过对所得到的序列进行理论与随机性能分析可知：提出的混沌序列产生方法简单,序列的随机性能良好,适合应用于数据加密领域,是一类具有很好应用前景的混沌序列产生方法。     

A Back-Iteration Method for Reconstructing Chaotic Sequences in Finite-Precision Machines

Discrete-valued chaotic sequences, when used as long-period spreading codes or stream ciphers, are expected to offer a low probability of interception and thus an enhancement in security. In this paper, the weakness of digital chaotic sequences is reported. We demonstrate that it is possible to reconstruct a long-period discrete-valued sequence generated by a chaotic system based on very few past values when the sequence generator is implemented in finite-wordlength digital hardware. The proposed back-iteration reconstruction method is based on the connection between the symbolic sequence and the initial condition of a chaotic system. This work was performed when the authors were with the Nanjing Institute of Communications Engineering, Nanjing, Jiangsu Province, 210007, China, supported by the National Science Foundation of China under Grants 69931040 and 60672081, and by the Science Foundation of Jiangsu Province under Grant BK2006502.     

一种基于混沌序列的数字图像加密算法

对Logistic映射混沌序列生成方法作了一些改进,改进后生成的序列不仅克服了一维混沌序列的短周期行为,而且统计性能有了一定程度的改善。提出了一种基于此混沌序列的JPEG格式数字图像加密算法,通过在图像压缩的同时执行加密运算,使密图具有良好的压缩效率,试验表明加密效果是令人掩意的。     

一种改进的混沌扩频序列研究

通过对混沌映射的研究,针对单一映射产生的扩频序列其系统复杂度低,容易通过反向逆推估计出系统初值的缺点,以Logistic映射为基础,构造出一种新的映射。该映射容易被数字电路实现,且具有较高的系统复杂度。该序列由两个不同初始值的两个Logistic映射复合而成,具有较高的安全性。在此,对复合混沌序列初值敏感性、平衡性、自相关性、功率谱密度进行了分析。研究结果表明,这种新型的序列具有较高的初值敏感性、优良的平衡性、自相关性和伪随机性,是一种有效和可靠的扩频序列。     

广义映射混沌扩频序列及其特性分析

该文从扩频通信对扩频码序列的要求出发,提出采用广义映射产生混沌数字序列的思路。通过对广义映射混沌数字序列相关性和平衡性的分析,给出一种改进的广义映射混沌数字序列生成方法。计算机模拟分析表明,使用该文方法生成的混沌序列具有良好的平衡性和保密性,更适合在码分多址通信中应用。     

用双混沌映射实现的数字水印算法

论文将原始彩色图像转换成灰度图像,通过密钥和非线性映射产生两个独立的实值序列,再从中派生出两个二值序列,先用两个实值序列置乱和加密二值水印图像,然后用派生的两个二值序列把被加密的水印图像嵌入到灰度图像中,实现数字水印。实验结果表明,这种数字水印鲁棒性强,隐蔽性好,具有一定的抗剪切和抗有损压缩攻击的能力。     

一种新的混沌伪随机序列生成方式

利用构造的Hybrid混沌映射,通过周期性改变混沌迭代初值来产生混沌伪随机序列。理论和统计分析可知,该混沌序列的各项特性均满足伪随机序列的要求,产生方法简单,具有较高的安全性和保密性,是一类很有应用前景的伪随机加密序列。     

一种基于Logistic映射的混沌跳频序列

基于Logistic映射,提出了一种产生混沌跳频序列的新方法.该方法是先对Logistic映射的轨道点进行多值量化,然后利用比特抽取产生所需的混沌跳频序列.性能分析和数值实验表明,在相同的条件下(频率数目和序列长度相同),其平衡性、跳频间隔和最大汉明相关值与其它方法产生的混沌跳频序列相当,然而其所需的迭代次数却大大减少了,因此非常适合在跳频多址通信中应用.     

一种新型的适用于CDMA扩频系统的混沌序列

在各种混沌映射的基础上,为了改善混沌序列被截短带来的影响,提出了一种级联型的混沌映射。研究和仿真证明,该方法产生的混沌序列在伪随机性、相关性、平衡性、误码率方面的性能优良,很适合用于DS/CDMA扩频通信中。     

数字混沌序列在DSSS通信中的误码率仿真

为了将数字混沌序列直接应用到现有的数字通信系统中,论文分析了混沌序列的伪噪声特性,介绍了实值混沌序列的量化方法,仿真了数字混沌序列的性能,最后对基于数字混沌序列的DSSS通信系统进行了仿真。结果表明,数字混沌序列具有良好的自相关和互相关特性,完全可以作为扩频码应用到现有的DSSS通信系统中。     

基于IIR滤波器的最佳混沌扩频序列设计

在标准高斯近似条件下,以最小化系统平均多址干扰方差为准则,推导出了A-CDMA系统最佳扩频序列的部分自相关函数形式;并提出了通用的最佳混沌扩频序列设计方法,即利用数字IIR滤波器滤波混沌序列产生最佳混沌扩频序列。仿真结果表明,这种方法产生的序列性能明显优于纯随机序列和Gold序列。     

Noise‐based spreading in code division multiple access systems for secure communications

Binary spreading sequences or chaotic nonbinary sequences are used in code division multiple access systems. In contrast to those sequences, this paper presents the theory, simulation, and implementation in digital signal processor technology of a code division multiple access system that uses random spreading sequences. The expressions for probability of bit error are derived for the cases when the additive white Gaussian noise and fading are present in the channel. Because the overall transmitted signal is a sum of random signals, the security of signal transmission in this communication system can be enormously increased and will depend on the goodness of the random sequence generator. The developed theory was confirmed by a prototype of the system that was designed in digital signal processor technology. The prototype used spreading sequences that had statistical characteristics very close to the characteristics of theoretical random sequences. The main problem in the system is how to synchronize the received spread sequence with the locally generated sequence. Hence, a mathematical model of the synchronization block for the system has been separately designed and developed. The synchronization procedure has been demonstrated on the basis of application of a periodically repeated pilot sequence. Copyright © 2014 John Wiley & Sons, Ltd.     

Information sources using chaotic dynamics

A sequence of binary random variables has found significant applications in modem digital communication systems. For such sequences, several kinds of linear feedback shift register sequences have been proposed. It is, however, well known in probability theory that the Bernoulli shift is a fundamental theoretic model of a sequence of independent identically distributed (i.i.d.) binary random variables. In this paper after reviewing fundamental subjects of chaotic dynamics, in particular a close relationship between information sources and Markov chains, we give the generation method of sequences of i.i.d. binary random variables using chaotic dynamics. Such a generation method is given as a sufficient condition composed of simple symmetric properties for some class of ergodic maps. Furthermore, we give the applications of such sequences: (1) to running-key sequences for stream cipher systems and (2) to a color image communication system through code-division multiple access channels and its extended version, a digital watermarking system. In addition, the performance of spread spectrum codes generated by a Markov chain is theoretically evaluated in asynchronous direct-sequence/code-division multiple access systems