用于跳频码分多址通信的混沌跳频序列

Frequency Hopping Sequences by Chaotic Maps for FH/CDMA Communications

最近提出的混沌跳频序列具有均匀性、保密性好的优点，但存在较大的汉明相关值．本文给出了一种减小混沌跳频序列汉明相关值的方法，该方法构造的跳频序列是贝努利随机序列，汉明相关函数服从Ｐｏｉｓｏｎ分布．在跳频码分多址（ＦＨ／ＣＤＭＡ）系统中，这种混沌跳频序列的系统容量与常规跳频序列基本相同．

The Hamming correlation property of recently proposed chaotic frequency hopping sequences is not good enough.In this paper the authors present the construction of completely random hopping sequences by chaotic maps.The Hamming correlation is reduced significantly and is shown to be Poissondistributed.The system capacity of chaotic hopping sequences is almost identical to conventional hopping sequences in frequency hopping/code division multiple access(FH/CDMA) systems.