异步码分多址通信中混沌扩频序列的选择

根据异步码分多址通信的特点,本文提出了扩频序列的优选准则,并给出了混沌序列的优选方法.计算结果表明,根据该方法优选的混沌序列伪随机特性得到了显著提高,与Gold序列相比较,更适于异步码分多址通信系统的应用.最后,对各种混沌码组的性能进行了比较.     

改进型分段线性混沌序列用作DS-CDMA系统直扩码的分析

本文提出用改进型分段线性混沌映射来产生DS－CDMA系统的直扩码;分析了这类直扩码的特性以及两种量化函数对其特性的影响;计算机仿真结果表明,在适当的初值条件下这类序列具有周期长、平衡性好、自相关函数较尖锐、互关值较小以及线性复杂度高等特性,适合用作DS-CDMA系统直扩码.     

异步码分多址系统的最优混沌二进制扩谱序列

为了扩展适合异步CDMA系统的扩谱序列,提高系统的性能,利用混沌序列的类随机、理想的自相关和互相关、易于产生并且数量多的特性,来生成适合异步码分多址系统的混沌扩谱序列。根据异步DS—CDMA系统的模型,分析适合异步CDMA系统的最优混沌扩谱序列的性能优点,提出选择和构造最优二进制混沌扩谱序列的关键指标,并与传统的伪随机序列(如Gold序列)进行数值仿真比较。结果表明应用最优混沌扩谱序列可以增加15％的系统容量。     

混沌扩频序列在多用户DS-CDMA系统中的应用

分析了混沌伪随机序列的自相关和互相关特性,采用Logistic序列作为扩频序列应用到多用户DS—CDMA系统中。分析了不同用户数下多用户干扰对系统BER的影响,并与M序列扩频系统进行了比较。计算机仿真表明,混沌伪随机序列具有优良的自相关和互相关特性,和传统的M序列相比,采用混沌扩频序列,可以大大降低系统的多用户干扰,使得系统的BER性能有大幅改善。     

基于混沌序列的DS-CDMA相关解调系统

本文从截断混沌序列的相关特性入手,直接推导出混沌序列为地址码的异步DS-CDMA通信系统的相关解调结果,仿真研究不同的混沌序列在异步DS CDMA条件下的多址特性,说明混沌序列优化的必要性并指出了优化的途径.     

Interference minimisation by autocorrelation shaping inasynchronous DS-CDMA systems: chaos-based spreading is nearly optimal

The classical estimation of co-channel interference in asynchronous direct sequence-code division multiple access (DS-CDMA) systems, obtained for a conventional receiver under the standard Gaussian approximation (SGA), is analytically minimised with respect to the auto-correlation function of spreading sequences. The optimum auto-correlation function is found to be real, with alternating signs, and extremely closely follows an exponential trend. A family of chaotic maps is presented which is able to generate sequences with exponential auto-correlation function with alternating signs. The resulting DS-CDMA system is an extremely good approximation of the optimum achievable system     

Performance evaluation of DS-CDMA systems on multipath propagationchannels with multilevel spreading sequences and RAKE receivers

Performance of small-cell wireless direct sequence code-division multiple access (DS-CDMA) systems with multilevel spreading sequences is investigated. An analytical methodology to evaluate both outage probability and mean bit error probability is presented; and its results are compared to those obtained with a semianalytical Monte Carlo based approach. Multipath propagation, the exact correlation properties of spreading codes, and both the simple correlator and RAKE receivers are taken into account in the analysis, which is oriented to asynchronous and synchronous environments. The spreading sequences investigated include multilevel sequences with complex isomorphic mapping, as well as some well-known two-level sequences. The numerical results show the impact of multilevel sequences on system performance, the improvements found in the absence of multiple access interference by using them rather than binary sequences, and the agreement between analytical and semianalytical evaluation     

A Methodology for Bit Error Rate Prediction in Chaos-based Communication Systems

This paper is devoted to the derivation of an exact analytical expression of the bit error rate for chaos-based DS-CDMA systems. For the studied transmission system, we suppose that synchronization is achieved perfectly, coherent reception is considered, and an Additive White Gaussian Noise channel (AWGN) is assumed. In the first part of the paper, performance of a mono-user system with different chaotic sequences is evaluated and compared in terms of the error probability. This comparison is realized thanks to the probability density function of the bit energy of a chaotic sequence. The bit error rate can be easily derived by numerical integration. In some particular cases, for certain chaotic sequences with known probability density function of bit energy, we propose an analytical expression of the bit error. In the second part of the paper, the performance of a chaos-based DS-CDMA system is evaluated in the multi-user case. A general conclusion is that probability density function of chaos bit energy, for a given spreading factor, can give a clear idea about how to choose a “good” chaotic sequence for improving the performance of the chaos-based CDMA system.     

新的混沌扩频序列抗多址性能的Simulink仿真

针对混沌扩频通信中提升混沌码性能的问题,通过重构Bernoulli映射相空间,得到一种改进的Bernoulli混沌映射,计算证明该映射具有弱结构特性,并在Simulink平台搭建了多用户混沌直接扩频通信系统的仿真模型,并与原Bernoulli混沌序列的抗多址性能做了比较。Simulink动态仿真结果表明,改进后的混沌扩频序列具有较好的抗多址干扰能力。     

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

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

A Multiple-Rate, Multicarrier Direct-Sequence CDMA System with 2-D OVSF Codes in Fading Channels

In this paper, a multiple-rate, multicarrier direct- sequence code-division multiple-access (MC/DS-CDMA) system with the use of two-dimensional orthogonal variable spreading factor (2-D OVSF) codes is studied. They are the first 2-D codes that can be generated by the tree structure commonly used by one-dimensional OVSF codes in wideband-CDMA. The 2-D OVSF codes also preserve orthogonality among code matrices with different spreading factors in the code tree. The performances of the proposed system with RAKE receivers employing equal-gain and maximal-ratio combining methods are analyzed and compared. Our results show that our multiple-rate MC/DS-CDMA system with the 2-D OVSF codes is more suitable for a non-fading additive white Gaussian noise channel or a Rician weak-fading channel. However, in a Rayleigh fading channel, the system performance gets worse because the orthogonality of the 2-D OVSF codes is destroyed by the strong fading effect.     

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     

BER Performance of Walsh Hadamard Like Codes Based on Complementary Sequence Sets in a CDMA and Cognitive Underlay System

In this paper, a method of constructing a sequence set similar to Walsh Hadamard (WH) codes is described. In general, two complementary sequence set of length 2 is used as a basic kernel to construct WH codes. In this work, four complementary sequence set of length 3 is used as a basic kernel. The proposed code set have a nearly non linear phase sequences with a more evenly spread frequency spectrum when compared with WH codes. It is shown that the proposed spreading codes perform comparable to WH in a Direct Sequence code division multiple access (DS-CDMA) system in an Additive White Gaussian Noise and Rayleigh channel at a reduced code length. In this work, bit error rate performance of the Underlay Cognitive Radio system implemented using DS-CDMA system is simulated. Primary and Secondary Users are distinguished by assigning spreading codes from different families and it is assumed that the channel information is known by both the Primary and Secondary User receivers. This new code set offers good performance in a Cognitive Radio Underlay system.     

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

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

基于时空混沌的CPSK多用户扩频通信

传统的混沌扩频（CDSS）是利用混沌序列量化、编码后产生的0、1序列作为扩频码,来实现频谱展宽。另外,由于混沌序列本身的宽频特性,一些传统的混沌数字调制技术也可被用于扩频通信系统的设计。在单向耦合映像格子（OCML）时空混沌模型同步的基础上,直接利用混沌相位键控（CPSK）调制技术构建了一个多用户扩频通信系统。该模型为每个用户分配一个OCML时空混沌模型,为了更好地利用时空混沌系统的时间与空间混沌特性,其采用＂跳格序列＂作为扩频调制序列对用户信息进行调制。通过与传统混沌直接序列扩频（CDSS）系统的仿真比较发现,所设计的CPSK调制多用户扩频通信系统拥有比后者更好的误码性能及安全性能。     

Performance of asynchronous DS-CDMA system with long and shortspreading codes

The effect of spreading code length on the BER performance of an asynchronous DS-CDMA system is studied by means of Monte Carlo simulation. The probability of the crosscorrelation value between segments of long sequences is also discussed. Results indicate that the system performance with very long codes is ~1 dB worse compared to that of short CDMA codes     

An evolutionary approach to designing complex spreading codes for DS-CDMA

This paper proposes a novel evolutionary approach to spreading code design in direct sequence code division multiple access (DS-CDMA). Specifically, a multiobjective evolutionary algorithm (EA) is used to generate complex spreading sequences that are optimized with respect to the average mean-square cross- and/or autocorrelation (CC and/or AC) properties. A theoretical model is developed in order to demonstrate the optimality of the generated codes. The proposed algorithm enables spreading code design with no constraints on the code length. Furthermore, it is possible to generate K/spl ges/N codes of length N with very little cost in correlation properties. This results in significant capacity enhancement in DS-CDMA systems.     

Design of Digital Hybrid Chaotic Sequence Generator

In theory, the chaotic mapping sequences, for example, Logistic mapping, Tent mapping, Chebyshev mapping and so on, are suitable to be used as spreading codes in a DS-CDMA system [1~4]. Most of the chaos mapping systems is analogue. However, the digital chaotic sequences are often adopted in the practical applications. There is the finite precision effect in digital chaos mapping, which has undesirable influence on the properties of the chaotic sequences (e. g. period, correlations, balanc…     

基于数字混沌序列的DSSS通信系统仿真

为了将数字混沌序列直接应用到现有的数字通信系统中,分析了混沌序列的伪噪声特性,介绍实值混沌序列的量化方法,仿真数字混沌序列的性能,最后对基于数字混沌序列的DSSS通信系统进行了仿真。结果表明,数字混沌序列具有良好的自相关和互相关特性,将其应用到DSSS通信系统中可以解决当前存在的系统间相互干扰及多址干扰等问题。     

Optimal spreading sequence design based on PR-QMF theory

Based on filter bank theory, a new scheme for spreading sequence generation is proposed for direct sequence code division multiple access (DS-CDMA) systems. It is shown that optimal spreading sequences produce much less multiple access interference (MAI) than Gold codes with comparable lengths