Frequency-hopping sequences based on chaotic map

Based on chaotic map, a new method for generating chaotic frequency-hopping (FH) sequences is proposed. The real-valued trajectory´ of chaotic system is first encoded to binary sequences by means of a quantization function, and then we can obtain the chaotic FH sequences by reshaping bits of these binary sequences. Theory analysis and performance experiment results show that this sequence is Bernoulli sequence and its Hamming correlation is shown to be Poisson distributed. It is comparable to other FH sequences on the properties of uniform distribution, Hamming correlation and linear complexity when they have the same number of frequency slots and the same period, but its map iterative number has reduced largely. Consequently, more FH sequences can be generated by this method and they are suitable for FH code-division multiple-access systems.