Some good frequency hopping sequences with arbitrary number of slots

Author

Park, Seong-Bok ; Lee, Kwang-Eog ; Choi, Young-Kyum ; Eun, Yu-Chang ; Song, Hong-Yeop

Author_Institution

Agency for Defense Dev., Taejon, South Korea

Volume

2

fYear

2001

fDate

2001

Firstpage

1325

Abstract

We propose a new construction of some favorable FH (frequency-hopping) sequences with an p^k-p^m number of slots using a FSR (feedback shift register) over GF(p) and some nonlinear logic. We show that the resulting sequences satisfy the (almost) uniform symbol distribution in one period and pre-serve a reasonably good Hamming correlation property so that they are appropriate for military applications.

Keywords

Galois fields; Hamming codes; Reed-Solomon codes; access protocols; combinatorial mathematics; frequency hop communication; m-sequences; military communication; Galois fields; Hamming correlation; Reed-Solomon codes; binary M-sequences; combinatorial methods; feedback shift register; frequency hopping multiple access; frequency hopping sequences; military applications; nonlinear logic; Autocorrelation; Feedback; Frequency; Hardware; Logic; Optimization methods; Reed-Solomon codes; Shift registers; Signal synthesis; Spread spectrum communication;

fLanguage

English

Publisher

ieee

Conference_Titel

Military Communications Conference, 2001. MILCOM 2001. Communications for Network-Centric Operations: Creating the Information Force. IEEE

Print_ISBN

0-7803-7225-5

Type

conf

DOI

10.1109/MILCOM.2001.986070

Filename

986070