基于改进混沌扩频序列的多用户混沌扩频通信系统的研究与仿真

提出一种改进混沌扩频序列,并将其应用在多用户混沌扩频通信系统中,给出了多用户混沌扩频通信系统的理论推导和SIMULINK仿真模型。对该系统进行了详细的性能分析,包括信噪比、用户数、改进混沌扩频序列的分形参数和初始值等各自对系统误码率的影响,并比较了改进混沌扩频序列与传统混沌扩频序列的系统误码率随信噪比和用户数的变化情况。结果表明改进混沌扩频序列要好于传统混沌扩频序列的系统误码率,具有较好的抗噪声和抗多址干扰的能力。     

脉冲干扰直接序列扩频系统性能分析

研究通信系统中,直接序列扩频通信具有隐蔽性、抗干扰能力强的特点,但对各种大功率窄带干扰却无能为力。在工程实践中发现脉冲干扰能够对直扩信号产生一定的干扰效果,为了了解脉冲信号的对直扩信号的干扰能力,在研究直扩系统的工作原理的基础上,分析了脉冲信号的重复频率、脉冲宽度和直扩系统重复编码对误码率影响,并建立了仿真模型。仿真结果显示,脉冲信号在一定条件下能够对直扩信号产生有效的干扰,使直扩信号的通信性能迅速恶化,值得在工程中推广应用。     

复合混沌码的直扩系统优化及抗干扰性能研究

在复杂电磁环境中,直接序列扩频作为现代通信系统最常用的通信体制,会受到诸多人为和非人为干扰。针对直扩系统抗干扰性能进行研究,提出了基于复合映射产生混沌二值序列,并通过平衡性和相关特性对序列进行筛选优化。以优选后的复合混沌扩频码应用于直扩系统,对系统设计仿真。仿真结果表明,该复合混沌码直扩系统在不同信噪比和干扰环境下,抗干扰性能优于其它扩频码,系统误码率降低,误码率增益提高5dB。     

基于多值量化的混沌扩频序列及其性能分析

为了分析基于多值量化的混沌扩频序列的性能,以Chebyshev混沌映射为例,结合其概率密度分布函数的特点给出对其进行多值量化的方法。仿真分析多值量化混沌序列的平衡性和相关性,在高斯白噪声信道中对传统二值量化混沌序列和多值量化混沌序列扩频通信系统进行误码率仿真,并从低检测概率和低利用概率两个角度对多值量化混沌序列的抗截获性能进行分析。仿真结果表明多值量化混沌序列的误码率性能更好,其抗截获性能也有所提高。     

GMSK调制应用于直接序列扩频通信的可行性及其抗干扰能力分析

本文将GMSK调制引入到直接序列扩频通信系统中,以期获得更好的功率谱利用率.本文首先提出了基于GMSK调制的直接序列扩频和解扩原理,然后分析了直扩GMSK调制信号的抗干扰能力,并且用Matlab仿真对其抗正弦干扰效果加以验证.     

一种新型的分段Logistic混沌扩频通信算法

混沌序列作为扩频系统中的扩频码,具有序列丰富、保密性好等特性。针对传统的Logistic混沌序列及其改进型在序列遍历性和随机性等方面不太理想的问题,提出了一种新型的分段Logistic混沌扩频通信算法。在分析了所提混沌序列的随机性、相关性、初值敏感性和Lyapunov指数的基础上,将其应用于扩频通信系统中。仿真结果表明:新序列较传统的Logistic混沌序列及其改进型作为扩频通信地址码,在误码率和信息保密特性方面有很大改善,从而证明了新算法的有效性。     

CH-DSSS系统伪随机序列的生成策略

为有效提高军用通信系统的抗干扰和反侦察性能,可采用跳码直扩及扩展的跳码/跳频通信方案,系统直扩伪随机序列随时间跳变,序列的线性复杂度与非线性复杂度性能是系统抗干扰和抗截获的重要保证;以Berlekamp-Massey迭代算法对序列进行线性复杂度分析,以生成算法对序列进行Lempel-Ziv非线性复杂度测试,结果表明GOLD序列线性复杂度低,在跳码系统中应用会存在抗相关干扰和抗截获方面的隐患,而DFS结构的混沌序列在随机特性尤其是线性复杂度与非线性复杂度方面的性能良好,因而在跳码直扩系统中具有重要的应用价值.     

无人机测控链路中双混沌直序扩频技术的应用

为了提高无人机测控链路的抗干扰能力、抗截获能力和多址能力,提出一种新颖的双混沌直序扩频通信方式.用混沌序列替代传统的伪随机序列,发送端采用2条不同混沌序列对信号进行直接扩频调制,接收端用混沌序列进行相关解调,然后经过差分运算后得到原始信号.通过Matlab建立仿真模型,结果表明:在相同的信道条件下,系统的性能得到提升.     

反相对称-直扩通信系统抗窄带干扰研究

在直接序列扩频通信系统的扩频增益受限时,强功率的窄带干扰对系统性能影响较大。为了提高系统的通信效果,将反相对称法和直接序列扩频通信相结合,建立了一种新的通信系统——反相对称-直扩通信系统,对系统的抗窄带干扰能力进行了理论分析和仿真研究。理论分析和Matlab仿真结果表明,反相对称-直扩通信系统对窄带干扰有很好的抑制作用,对强功率的窄带干扰的抑制效果尤为显著。     

基于过拟合神经网络的混沌伪随机序列

伪随机序列在保密通信、扩频通信、密码学等领域具有重要作用.本文结合神经网络和混沌映射的特点,提出了一种基于过拟合BP神经网络的混沌伪随机序列产生方法.以logistic映射和Henon映射为例,测试结果表明,该方法能克服有限精度效应对混沌系统的影响,改善混沌伪随机序列的性能,为获得高性能的伪随机序列提供了一种新的思路.     

The relation between preset distinguishing sequences and synchronizing sequences

We study the relation between synchronizing sequences and preset distinguishing sequences which are some special sequences used in finite state machine based testing. We show that the problems related to preset distinguishing sequences can be converted into related problems of synchronizing sequences. Using the results existing in the literature for synchronizing sequences, we offer several reflections of these results for preset distinguishing sequences. Although computing a preset distinguishing sequence is PSPACE-hard , we do identify a class of machines for which computing a preset distinguishing sequence can be performed in polynomial time and argue that this class is practically relevant. We also present an experimental study to compare the performance of exponential brute-force and polynomial heuristic algorithms to compute a preset distinguishing sequence.     

Synthesis and recognition of sequences

A string or sequence is a linear array of symbols that come from an alphabet. Due to unknown substitutions, insertions, and deletions of symbols, a sequence cannot be treated like a vector or a tuple of a fixed number of variables. The synthesis of an ensemble of sequences is a sequence of random elements that specify the probabilities of occurrence of the different symbols at the corresponding sites of the sequences. The synthesis is determined by a hierarchical sequence synthesis procedure (HSSP), which returns not only the taxonomic hierarchy of the whole ensemble of sequences but also the alignment and the synthesis of a group (a subset of the ensemble) of the sequences at each level of the hierarchy. The HSSP does not require the ensemble of sequences to be presented in the form of a tabulated array of data, the hierarchical information of the data, or the assumption of a stochastic process. The authors present the concept of sequence synthesis and the applicability of the HSSP as a supervised classification procedure as well as an unsupervised classification procedure     

线性有限自动机的UIO序列及其生成算法

对线性有限自动机的UIO序列进行了讨论,得到了线性有限自动机的任意一状态有某一长度的UIO序列的充要条件,得到了线性有限自动机的(所有)状态有UIO序列的的充要条件,还给出了有UIO序列的线性有限自动机的状态的最短UIO序列长度的上界,最后给出了判断线性有限自动机的所有状态有无UIO序列以及有求其UIO序列的两个算法.     

On partitions and presortedness of sequences

To take advantage of existing order in a sequence when sorting, we evaluate the quantity of this information by the minimal size of decomposition of the input sequence, particularly the minimal size of chain and of monotonic partitions. Some sorting strategies that are optimal with respect to these measures of presortedness are presented. The relationships between these new measures of presortedness and other known measures have also been explored. As an application, we carry out the optimality of an adaptive sorting algorithm Skiena'sMelsort. For some special partitioning strategies, we present two sorting algorithms based on Dijkstra'sSmoothsort. Moreover, the optimalities of these two algorithms are demonstrated. By examining the optimalities of sorting algorithms with respect to certain measures of presortedness, we also propose some optimal sorting strategies for one class of measures. Finally, we discuss other types of sorting problems, such as sorting multisets and topological sorting. In particular, we derive an optimal algorithm for sorting multisets and for finding the multiset sizes as well.A preliminary version of this paper was presented at the Second Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA (January 28–30, 1991).The main part of the work was conducted while the author was with Lund University.     

Inconstancy of finite and infinite sequences

In order to study large variations or fluctuations of finite or infinite sequences (time series), we bring to light an 1868 paper of Crofton and the (Cauchy-)Crofton theorem. After surveying occurrences of this result in the literature, we introduce the inconstancy of a sequence and we show why it seems more pertinent than other criteria for measuring its variational complexity. We also compute the inconstancy of classical binary sequences including some automatic sequences and Sturmian sequences.     

Prediction and tracking of long-range-dependent sequences

Long-range-dependent (LRD) sequences have been found to be of importance in various fields such as telecommunications, signal processing and finance. Since the history of an LRD sequence has significant impact on the present values, it is expected that accurate prediction and tracking of these sequences are easier than of short-range-dependent sequences. The purpose of this paper is to verify whether distant observations in the past might increase the performance of a constrained tracker significantly when this information from the past is used in combination with recent observations.     

Result sequences

Expression evaluation in conventional programming languages may be viewed as a simplification of expression evaluation in the Icon programming language. The evaluation of an expression in Icon may yield a sequence of results. Goal-directed evaluation causes expressions to produce these results in an attempt to produce the successful evaluation of an enclosing expression. There are control operations that operate on result sequences. The study of expression evaluation in Icon therefore is more interesting than it is in most programming languages. This paper introduces a notation for result sequences and shows how it can be used to describe the static aspects of expression evaluation. Equivalences among control operations and expressions are demonstrated.     

Address sequences

A problem of generating modified address sequences is considered. The use of the Euclidean distance as a disparity measure for address sequences is substantiated. Numerical values of the Euclidean metric for modified address sequences are given. The efficiency of using the Euclidean metric to choose address sequences in case of the multiple run testing of modern memory devices is shown. Experimental results that support the utility of the Euclidean distance are provided.     

Time-delayed OL languages and sequences

Time-delayed OL languages are introduced and the results of a preliminary study are given. It is demonstrated, in particular, that time-delays are fundamental to Fibonacci string sequences (or locally concatenative sequences).