A Chaotic Spread Spectrum Sequence Generation Method Based on Dynamic Multi-map Recombination

Abstract

The generation method of chaotic spread spectrum sequence based on dynamic multi-mapping composite, to cope with the limitation of the limited number of sequences and the fixed mechanism of chaotic communication, this method is proposed based on the research basis of the improved Logistic, Chebyshev, and Kent three mappings. Use the control parameters to select the odd map and the even map from the improved Logistic, Chebyshev, and use the Kent map to establish a fractal function, thereby driving the fractal parameters of the odd map and the even map, and then the output of the odd map drives the initial value of the even map, and the even map The output of drives the initial value of the odd map. The selection function is established through the association of the odd map and the even map, and drives the initial value of the Kent map. Thus, the final new sequence is output through the optimization function of odd and even maps. This method can provide more address codes for the spread spectrum communication system, thereby expanding the application of the communication system.

Description

technical field [0001] The invention relates to the technical fields of spread spectrum communication and chaotic communication, in particular to a method for generating a chaotic spread spectrum sequence based on dynamic multi-mapping compounding (a preferred method for generating a chaotic spread spectrum sequence). Background technique [0002] The generation trajectory of chaotic signals is very complex and has no rules to find, which makes it have a good concealment effect and a high degree of unpredictability. The generation of chaotic signals depends on the system iteration equation and the initial value and fractal parameters, which is beneficial to the replication and regeneration of the signal. The signal itself is not random, but it has a similar random performance, and has a similar pseudo-random spreading code to the traditional pseudo-random The nature of randomness solves the problem of limited number of traditional spread spectrum address codes. In addition ...

AI Technical Summary

Problems solved by technology

However, as the system spread spectrum address code is a finite length sequence, the performance of the infinitely long chaotic sequence will be affected to a certain extent, so how to generate an effective finite length chaotic spread spectrum sequence has become the focus

Images