New Extension Constructions of Optimal Frequency-Hopping Sequence Sets
- 13 May 2019
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 65 (9) , 5846-5855
Abstract
In this paper, a general framework of constructing optimal frequency hopping sequence (FHS) sets is presented based on the designated direct product. Under the framework, we obtain infinitely many new optimal FHS sets by combining some one-coincide sequence sets that are newly constructed in this paper with some known optimal FHS sets. Our constructions are also based on extension method. However, our construction give new and flexible parameters due to the free choice of one-coincide(OC) sequence set. As a result, our constructions allow a great flexibility of choosing parameters of FHS sets for a given frequency-hopping spread spectrum system.Keywords
All Related Versions
Funding Information
- Youth Science and Technology Fund of Sichuan Province (2017JQ0059)
- Open Research Subject of Key Laboratory of Security Insurance of Cyberspace of Sichuan Province (szjj2016-037)
- Xihua University
- National Research Foundation Singapore
- Singapore MOE Tier 1 (RG25/16, RG21/18)
This publication has 28 references indexed in Scilit:
- New Families of Optimal Frequency-Hopping Sequences of Composite LengthsIEEE Transactions on Information Theory, 2014
- $k$-Fold Cyclotomy and Its Application to Frequency-Hopping SequencesIEEE Transactions on Information Theory, 2011
- Further combinatorial constructions for optimal frequency-hopping sequencesJournal of Combinatorial Theory, Series A, 2006
- Combinatorial characterizations of one-coincidence frequency-hopping sequencesDesigns, Codes and Cryptography, 2006
- Optimal Frequency-Hopping Sequences Via CyclotomyIEEE Transactions on Information Theory, 2005
- Lower Bounds on the Hamming Auto- and Cross Correlations of Frequency-Hopping SequencesIEEE Transactions on Information Theory, 2004
- Optimal large linear complexity frequency hopping patterns derived from polynomial residue class ringsIEEE Transactions on Information Theory, 1998
- Frequency-hopping code sequence designs having large linear spanIEEE Transactions on Information Theory, 1988
- A survey of one-coincidence sequences for frequency-hopped spread-spectrum systemsIEE Proceedings F Communications, Radar and Signal Processing, 1984
- Families of sequences with optimal Hamming-correlation propertiesIEEE Transactions on Information Theory, 1974