A class of frequency-hopping sequences set with a multiple of prime number length

被引:0
|
作者
Xu, Shan-Ding [1 ,2 ]
Cao, Xi-Wang [2 ,3 ]
Xu, Guang-Kui [2 ,4 ]
机构
[1] Department of Mathematics and Physics, Nanjing Institute of Technology, Nanjing,Jiangsu,211167, China
[2] School of Mathematical Science, Nanjing University of Aeronautics and Astronautics, Nanjing,Jiangsu,211106, China
[3] State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing,100093, China
[4] School of Mathematical Science, Huainan Normal University, Huainan,Anhui,232038, China
来源
关键词
Spread spectrum communication - Code division multiple access - Military communications;
D O I
10.3969/j.issn.0372-2112.2015.10.008
中图分类号
学科分类号
摘要
Frequency-hopping spread spectrum (FHSS) systems, with properties of anti-jamming, anti-intercept, code division multiple access (CDMA), channel sharing, etc, are usually applied in military radio communication, mobile communication, modern radar and sonar echolocation systems. Frequency-hopping sequences (FHS) is an integral part of FHSS systems. Based on the cyclotomy over the finite field and the Chinese remainder theorem, a class of FHSs set with a multiple of prime number length is constructed and the Hamming correlations of the new set are derived by some basic properties of the cyclotomic numbers. The results show that the proposed set is optimal with respect to the Peng-Fan bound and each FHS of the set is optimal or near optimal with respect to the Lempel-Greenberger bound. Furthermore, the previous constructions of optimal FHS sets based on cyclotomy are special cases of this paper. © 2015, Chinese Institute of Electronics. All right reserved.
引用
收藏
页码:1930 / 1935
相关论文
共 50 条
  • [21] FREQUENCY-HOPPING SEQUENCES WITH SMALL CROSS-CORRELATION
    KOMO, JJ
    LIU, SC
    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 1995, 8 (01) : 65 - 68
  • [22] New Constructions for Optimal Sets of Frequency-Hopping Sequences
    Zhou, Zhengchun
    Tang, Xiaohu
    Peng, Daiyuan
    Parampalli, Udaya
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (06) : 3831 - 3840
  • [23] A Frequency-Hopping Communication System Based On Multiple Parallel Hopping
    Chao, Zhichao
    Zhu, Xingtao
    He, Wei
    Ban, Yongling
    Chen, Shaorong
    PROCEEDINGS OF 2018 IEEE 3RD ADVANCED INFORMATION TECHNOLOGY, ELECTRONIC AND AUTOMATION CONTROL CONFERENCE (IAEAC 2018), 2018, : 2163 - 2169
  • [24] A Class of Optimal One-Coincidence Frequency-Hopping Sequence Sets with Composite Length
    Ren, Wenli
    Fu, Fang-Wei
    Wang, Feng
    Gao, Jian
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2017, E100A (11): : 2528 - 2533
  • [25] MORE CYCLOTOMIC CONSTRUCTIONS OF OPTIMAL FREQUENCY-HOPPING SEQUENCES
    Xu, Shanding
    Cao, Xiwang
    Mi, Jiafu
    Tang, Chunming
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2019, 13 (03) : 373 - 391
  • [26] Further combinatorial constructions for optimal frequency-hopping sequences
    Ge, Gennian
    Fuji-Hara, Ryoh
    Miao, Ying
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2006, 113 (08) : 1699 - 1718
  • [27] On The Average Partial Hamming Correlation of Frequency-Hopping Sequences
    Ren, Wenli
    Fu, Fang-Wei
    Zhou, Zhengchun
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2013, E96A (05) : 1010 - 1013
  • [28] From Prime Codes to "A New Construction of Frequency-Hopping Codes"
    Liu Qingge
    Yang Dongkai
    Lue Shanwei
    2009 5TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-8, 2009, : 817 - 820
  • [29] A Combinatorial Construction for Strictly Optimal Frequency-Hopping Sequences
    Fan, Cuiling
    Cai, Han
    Tang, Xiaohu
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (08) : 4769 - 4774
  • [30] 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