Novel Piecewise Logistic Chaotic Spread Spectrum Communication Algorithm
一种新型的分段Logistic混沌扩频通信算法

Chaotic sequence as spreading code in spread spectrum systems has the characteristics of rich sequences and good confidentiality. Traditional Logistic chaotic sequence as well as its modified sequence is not ideal in ergodicity and randomness of its sequence. ho solve this problem, a new piecewise Logistic chaotic spread spectrum communication algorithm was proposed based on the analysis of the randomness, correlation, initial sensitivity and Lyapunoy exponents of the referred chaotic sequence, and applied to spread spectrum communication. hhe simulation results show that the algorithm greatly improves the error rate and confidentiality in the spread spectrum communication compared to the traditional logistic chaotic sequence and its modified sequence, which proves that the algorithm mentioned in this article is effective.