Optimal Frequency Hopping Sequences of Odd Length

Author

Xiangyong Zeng ; Han Cai ; Xiaohu Tang ; Yang Yang

Author_Institution

Fac. of Math. & Comput. Sci., Hubei Univ., Wuhan, China

Volume

59

Issue

5

fYear

2013

fDate

May-13

Firstpage

3237

Lastpage

3248

Abstract

In this paper, a new generalized cyclotomy with respect to a positive odd integer is introduced, and a construction of frequency hopping sequence sets and two constructions of frequency hopping sequences are proposed as its applications. The frequency hopping sequence sets and frequency hopping sequences obtained in this paper can be optimal with respect to the Peng-Fan bound and Lempel-Greenberger bound, respectively. Further, the length of sequences in the optimal frequency hopping sequence sets can be any odd integer larger than 3. Some of them have new parameters.

Keywords

correlation theory; frequency hop communication; sequences; Hamming autocorrelation; Lempel-Greenberger bound; Peng-Fan bound; cyclotomy; optimal frequency hopping sequence set; positive odd integer length; Educational institutions; Electronic mail; Indexes; Information security; Information theory; Vectors; Frequency hopping sequence (FHS); generalized cyclotomic number; generalized cyclotomy; the Lempel–Greenberger bound; the Peng–Fan bound;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/TIT.2013.2237754

Filename

6401189