Optimal Sets of Frequency Hopping Sequences With Large Linear Spans

Author

Wang, Qi

Author_Institution

Dept. of Comput. Sci. & Eng., Hong Kong Univ. of Sci. & Technol., Kowloon, China

Volume

56

Issue

4

fYear

2010

fDate

4/1/2010 12:00:00 AM

Firstpage

1729

Lastpage

1736

Abstract

Frequency hopping (FH) is one of the basic spread coding technologies in spread spectrum communications. FH sequences are needed in FH code-division multiple access (CDMA) systems. For the anti-jamming purpose, FH sequences are required to have a large linear span. A few optimal sets of FH sequences are available in the literature. However, their sequences have very small linear spans. It is known that an optimal set of FH sequences could be transformed to another optimal set of FH sequences with large linear spans by a power permutation, if the power is chosen properly [see C. Ding and J. Yin, IEEE Trans. Inf. Theory, vol. IT-54, pp. 3741-3745, 2008]. The objective of this paper is to investigate this idea of C. Ding and J. Yin further, and determine the linear span of the FH sequences in the optimal sets obtained by applying a power permutation to some existing optimal sets of FH sequences.

Keywords

code division multiple access; frequency hop communication; spread spectrum communication; antijamming; frequency hopping code division multiple access systems; frequency hopping sequences; linear spans; optimal sets; power permutation; spread coding technology; spread spectrum communications; Communication systems; Computer science; Frequency; Interference; Multiaccess communication; Signal generators; Spread spectrum communication; Transmitters; Frequency hopping sequence; linear span; optimal set of frequency hopping (FH) sequences; power permutation;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/TIT.2010.2040874

Filename

5437427