Loading [MathJax]/extensions/MathMenu.js
A New Optimal Design Method of Arbitrary Limited Period Spreading Sequences Based on Logistic Mapping | IEEE Conference Publication | IEEE Xplore

A New Optimal Design Method of Arbitrary Limited Period Spreading Sequences Based on Logistic Mapping


Abstract:

Chaos is a deterministic random process in nonlinear dynamic systems. In this article, we propose a new optimal design method of chaotic spreading sequences with arbitrar...Show More

Abstract:

Chaos is a deterministic random process in nonlinear dynamic systems. In this article, we propose a new optimal design method of chaotic spreading sequences with arbitrary period, which optimizes the binary-quantization thresholds with different fractal parameters and initial values. This article simulates and analyzes the design results. The results show that the method can generate a huge amount of high-performance chaotic spreading sequences with arbitrary period.
Date of Conference: 17-19 August 2012
Date Added to IEEE Xplore: 13 September 2012
ISBN Information:
Conference Location: Chongqing, China
References is not available for this document.

I. Introduction

Spread spectrum communication is a widely used communication mode, of which Direct Sequence Spread Spectrum is the most widely used. In the Direct Sequence Spread Spectrum, the nature of spreading sequences is very important, which need good autocorrelation and cross-correlation properties [1]. The traditional spreading sequences, such as m sequences, Gold sequences and so on, have the limited set of available codes and low linear complexity, which greatly affect the capacity and security performance of the system [2]. In addition, the period of m and Gold sequence is generally _, and the choice of period is limited. People have always been looking for the spreading sequences which have better performance, larger number.

Select All
1.
Sarwate D V, Pursley M B. Cross-Correlation Properties of Pseudorandom and Related Sequences[J]. Proc. of the IEEE, 1980, 68 (5):593-619
2.
Mi Liang, Zhu Zhong-liang. Optimization of Chaotic Direct Spreading Sequences and Comparison of Performances Between Chaotic and Conventional Sequence [J]. Systems Engineering and Electronics, 2002, 24(5):117-120
3.
Schuster H G. Deterministic Chaos, An Introduction (Second Revised Edition). Federal Republic of Germany:VCH,1988
4.
Heidari-Bateni G,McGillem C D.A Chaotic Direct-Sequence Spread-Spectrum Communication System[J]. IEEETrans. on Commun., 1994, 42(2/3/4): 1524-1527.
5.
Mazzini G, Setti G, Rovatti R. Chaotic Complex Spreading Sequences for Asynchronous DS-CDMA-Part I :System Modeling and Results[J]. IEEE Trans. on Circuits and Syst., 1997, CAS-I-44(10):937-947.
6.
Lu Qing, Ling Xiaohui. Improved Method for Chaotic Frequency Hopping Sequence[J]. Journal of Data Acquisition and Processing,2010,22(1)
7.
He Xilin, Yao Fuqiang. Analyses of the FH Code Sequence Complexity[J], No.5. MAY 1999.

References

References is not available for this document.