UWB系统多址接入方法的比较研究

研究UWB系统多址接入技术的主要目的是在尽量减少多址之间的干扰,降低接收机的复杂度,实现低功耗、低成本。从误码率理论分析、性能仿真和接收机结构等几个方面对混沌序列扩频与伪随机序列扩频、伪混沌跳时与传统跳时多址接入方式进行比较研究。结果表明,在系统误码率方面,伪随机序列扩频优于混沌序列扩频,传统跳时优于伪混沌跳时;在接收机复杂度方面,混沌序列扩频和传统跳时较好。     

基于混沌和CNN交错反馈产生扩频序列的性能分析

提出了一种基于细胞神经网络和混沌交错反馈产生扩频序列的设计方法,用计算机仿真对该混沌扩频序列的平衡特性、游程特性、位移特性、相关特性和线性复杂度等伪随机特性进行了系统的分析,并分析了该序列的奇/偶相关特性.结果表明,该混沌扩频序列具有理想的伪随机特性,可以作为扩频通信中的扩频码,同时系统的交错加强了通信的保密性.     

一种基于蔡氏电路的混沌扩频序列

本文从混沌序列具有的伪随机特性入手,利用蔡氏电路建立了一个混沌序列发生器,实验统计分析证明可以利用蔡氏电路产生一种较理想的混沌伪随机序列;通过对以混沌伪随机序列为基础得到的混沌扩频序列的特性分析,表明基于蔡氏电路的混沌扩频序列适合于扩频通信中的应用。     

产生2k元伪随机序列的准混沌Mealy型有限状态机方法

该文利用m状态序列稳定的长周期,以及混沌序列流的高线性复杂度,研究了一种将m状态序列作为准混沌Mealy型有限状态机输入的 2k元伪随机序列产生方法,分析了系统的周期特性,进行了序列流随机性的测试,介绍了系统作为跳频码发生器在FPGA的仿真和综合结果。     

基于变结构混沌的伪随机序列发生器

为产生随机性能良好的伪随机序列,提出了一个新的变结构混沌系统。该混沌系统在一个开关函数控制下其系统结构随时间随机地转换,所产生的混沌信号是两个不同的混沌信号的混合,具有良好的复杂性。基于该变结构混沌系统设计了一种伪随机序列发生器,采用NIST标准和STS-2．0b测试套件对其产生的伪随机序列进行了统计性能测试,测试结果表明该伪随机序列发生器具有良好的随机性,可应用于计算机、通信、信息加密等领域中。     

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

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

产生2k元伪随机序列的准混沌Mealy型有限状态机方法

该文利用m状态序列稳定的长周期，以及混沌序列流的高线性复杂度，研究了一种将m状态序列作为准混沌Mealy型有限状态机输入的2k元伪随机序列产生方法，分析了系统的周期待性，进行了序列流随机性的测试，介绍了系统作为跳频码发生器在FPGA的仿真和综合结果．     

一种改进的变结构混沌序列性能分析

自提出了基于广义混沌映射切换的混沌同步保密通信方法以来,这种通过混沌映射切换来改变混沌系统结构,以此产生伪随机序列的方法被频繁引用.但这种方法产生的序列的综合性能却一直未能得到有力的证明,而且尚存在不能充分保证序列周期足够长的致命弱点.本文对这种变结构混沌序列产生方法作了动力学分析,并通过数值仿真对该方法产生的序列做了统计性能分析和抗预测性能研究.为了解决周期问题,本文在变结构混沌序列基础上引入了m序列扰动.结果表明这种改进的变结构混沌序列具有典型的混沌特性,而且产生序列的周期,相空间分布,线性复杂度,相关性以及抗预测性等方面的性能明显优于基于单一混沌系统的序列.     

G(f)序列的线性复杂度分布

序列密码利用伪随机序列来加密消息序列,伪随机序列的线性复杂度是序列密码安全性的重要度量之一。本文用序列的生成函数研究G(f)序列的线性复杂度分布以及所对应线性复杂度的序列周期,得到了几个对密码设计和分析有意义的结果。     

模糊控制下的混沌跳频系统的同步

针对混沌信号的伪随机性和易于产生等特点，以改进的Logistic映射为例，用混沌序列取代跳频通信中的跳频码，给出了混沌跳频序列的神经网络实现；提出了用模糊控制的方法产生模糊随机序列，并以此控制混沌跳频系统的同步。计算机仿真结果表明，此方法是可行的，能达到良好的同步。     

一种混沌扩频码序列设计的准则

本文根据符号动力学,利用混沌系统构造了一族相互独立的Bernoulli序列作为扩频序列,给出了获得q元Bernoulli序列的一种设计准则测度熵等于logq。     

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.     

Low-hardware complexity PRBGs based on a piecewise-linear chaotic map

In this brief, a family of discretized one-dimensional chaotic maps derived from the Sawtooth map is analyzed to evaluate its suitability for the integrated implementation of low-complexity digital pseudorandom bit generators (PRBGs). The proposed PRBGs, classifiable as nonlinear congruential generators, are investigated in terms of period length, statistical properties of the generated sequences, hardware complexity, and are compared with traditional PRBGs.     

Coexistence of infinite attractors in a fractional-order chaotic system with two nonlinear functions and its DSP implementation

In this paper, a new five-dimensional fractional-order chaotic system based on two nonlinear functions is constructed. The rich dynamical behaviors of the system are analyzed by phase diagram, bifurcation diagram and Lyapunov exponents spectrum. In addition, the complexity of the fractional-order system is analyzed through Spectral Entropy (SE) and Permutation Entropy (PE) algorithms. Meanwhile the phenomenon of coexisting infinite attractors is analyzed. Of particular concern is that the phenomenon of multi-state transition and intermittent oscillation chaos is found in this new chaotic system. Furthermore, the system is implemented on the DSP platform. To the best of the knowledge, these rich dynamical characteristics and complicated phenomena are of great reference value in chaotic image encryption and other fields.     

A family of new complex number chaotic maps based image encryption algorithm

A family of new complex number chaotic maps based image encryption algorithm is proposed in the paper. A family of maps is constructed and proved to be chaotic in the complex number field, and its characteristics are analyzed. Two maps are selected from the chaotic maps family and are utilized to construct pseudorandom keystream sequence. In the proposed encryption algorithm, the pseudorandom keystream sequences are used to scramble and diffuse the plain image data and two entropy coding methods are used to reduce the correlation among the signals. Both theoretical analysis and experimental tests show that the proposed algorithm is secure and efficient.     

移位缩减发生器

本文在两种伪随机发生器的基础上提出一种新的伪随机发生器,分析了其输出序列的周期、线性复杂度和统计特性,并比较它们的优越性。     

Privacy-preserving and tokenless chaotic revocable face authentication scheme

With the large-scale proliferation of biometric systems, privacy and irrevocability issues of their data have become a hot research issue. Recently, some researchers proposed a couple of schemes to generate BioHash, e.g. PalmHash, however, in this paper, we point out that the previous schemes are costly in terms of computational complexity and possession of USB tokens to generate pseudorandom numbers. To overcome the problems, we propose a novel chaotic FaceHashing scheme which preserves privacy of a biometric user. The presented scheme does not need users to posses USB tokens in generating pseudorandom sequences, which is a cost-effective solution. Besides, our scheme minimizes the system complexity with simple operations to attain the FaceHash. Experimental results show that the proposed scheme is efficient, secure, and revocable in case FaceHash is theft or compromised.     

混沌二进制序列构成的安全性研究

由混沌映射驱动得到的伪随机二进制序列应确保有足够的比特安全性。信息有规律地泄漏,会导致有可能利用有限长度的输出序列完全地破译混沌驱动序列,并恢复有限长度的初始密钥,重建全部的输出序列。     

自相关性和线性复杂度的关系

自相关性和线性复杂度是衡量序列伪随机性质的两个独立的指标.针对周期为2^<em>n的伪随机序列,本文首次指出了自相关性和线性复杂度之间存在的一个关系.该关系可应用于以下两个方面:(1)由序列的线性复杂度来估计/确定序列的自相关函数值;(2)通过线性复杂度来检验给定序列族的互相关性质.进一步的,针对一类周期为2^<em>n的伪随机序列,我们指出这类序列的自相关函数值和线性复杂度以及k-错线性复杂度存在着关系.     

二元周期序列的4-错线性复杂度

 k-错线性复杂度是衡量序列伪随机性的重要指标之一.对线性复杂度第一下降点为4的以2的方幂为周期的二元序列,本文通过分析Games-Chan算法,给出了其4-错线性复杂度的所有可能取值形式以及具有给定4-错线性复杂度的序列的计数.更进一步,给出了其4-错线性复杂度的期望.结果表明,其4-错线性复杂度的期望与线性复杂度相差不大.