Frequency-hopping sequences based on chaotic map

被引:0
|
作者
Mi, L [1 ]
Zhu, ZL [1 ]
机构
[1] SW Elect & Telecommun Technol Inst, Chengdu 610041, Peoples R China
关键词
chaos; frequency-hopping sequences; hamming correlation function; linear complexity;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Based oil 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 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.
引用
收藏
页码:1825 / 1828
页数:4
相关论文
共 50 条
  • [1] Frequency-hopping sequences by chaotic maps for FH/CDMA communications
    Inst of Communications Engineering, Nanjing, China
    Tien Tzu Hsueh Pao, 1 (67-69):
  • [2] Optimal Frequency-Hopping Sequences Based on Cyclotomy
    Zhang, Yun
    Ke, Pinhui
    Zhang, Shengyuan
    PROCEEDINGS OF THE FIRST INTERNATIONAL WORKSHOP ON EDUCATION TECHNOLOGY AND COMPUTER SCIENCE, VOL I, 2009, : 1122 - 1126
  • [3] Frequency-hopping prediction based on the chaotic neural network
    Wang, Yi
    Guo, Wei
    2006 10TH INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY, VOLS 1 AND 2, PROCEEDINGS, 2006, : 1099 - +
  • [4] On the Sidel'nikov Sequences as Frequency-Hopping Sequences
    Han, Yun Kyoung
    Yang, Kyeongcheol
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (09) : 4279 - 4285
  • [5] Optimal frequency-hopping sequences based on the decimated m-sequences
    Xu, Shanding
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2022, 14 (05): : 983 - 998
  • [6] Optimal frequency-hopping sequences based on the decimated m-sequences
    Shanding Xu
    Cryptography and Communications, 2022, 14 : 983 - 998
  • [7] Sets of optimal frequency-hopping sequences
    Ding, Cunsheng
    Yin, Jianxing
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (08) : 3741 - 3745
  • [8] Set of optimal frequency-hopping sequences based on polynomial theory
    Han, H. Y.
    Peng, D. Y.
    ELECTRONICS LETTERS, 2014, 50 (03) : 214 - +
  • [9] Chaotic frequency hopping sequences
    Ling, C
    Sun, SG
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1998, 46 (11) : 1433 - 1437
  • [10] Optimal Frequency-Hopping Sequences With New Parameters
    Chung, Jin-Ho
    Yang, Kyeongcheol
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (04) : 1685 - 1693