Hostname: page-component-cd9895bd7-p9bg8 Total loading time: 0 Render date: 2024-12-27T22:24:00.119Z Has data issue: false hasContentIssue false
  • English
  • Français

Linear spans of optimal sets of frequency hopping sequences∗

Published online by Cambridge University Press:  23 February 2012

Gao Juntao ,
Hu Yupu  and
Li Xuelian
Gao Juntao
Affiliation:
Key Laboratory of Computer Networks and Information Security, Xidian University, Xi’an, Shaanxi province 710071, P.R. China. gjtalbert@163.com State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, 100049, P.R. China
Hu Yupu
Affiliation:
School of Telecommunication and Engineering of Xidian University, Xi’an, Shaanxi province 710071, P.R. China
Li Xuelian
Affiliation:
Department of Applied Mathematics of Xidian University, Xi’an, Shaanxi province 710071, P.R. China
Get access

Abstract

Frequency hopping sequences sets are required in frequency hopping code division multiple access systems. For the anti-jamming purpose, frequency hopping sequences are required to have a large linear span. In this paper, by using a permutation polynomial δ(x) over a finite field, we transform several optimal sets of frequency hopping sequences with small linear span into ones with large linear span. The exact values of the linear span are presented by using the methods of counting the terms of the sequences representations. The results show that the transformed frequency hopping sequences are optimal with respect to the Peng-Fan bound, and can resist the analysis of Berlekamp-Massey algorithm.

Keywords

Frequency hopping sequenceslinear spanpermutation polynomialsoptimal sets
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 46 , Issue 3 , July 2012 , pp. 343 - 354
Copyright
© EDP Sciences 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Antweiler, M. and Bömer, L., Complex sequences over GF(p M) with a two-level autocorrelation function and a large linear span. IEEE Trans. Inf. Theory 38 (1992) 120–30. Google Scholar
Chu, W. and Colbourn, C.J., Optimal frequency-hopping sequences via cyclotomy, IEEE Trans. Inf. Theory 51 (2005) 1139–1141. Google Scholar
Ding, C. and Yin, J., Sets of optimal frequency hopping sequences, IEEE Trans. Inf. Theory 54 (2008) 3741–3745. Google Scholar
Ding, C., Miosio, M. and Yuan, J., Algebraic constructions of optimal frequency hopping sequences. IEEE Trans. Inf. Theory 53 (2007) 2606–2610. Google Scholar
Ding, C., Fuji-Hara, R., Fujiwara, Y., Jimbo, M. and Mishima, M., Sets of frequency hopping sequences : bounds and optimal constructions. IEEE Trans. Inf. Theory 55 (2009) 3297–3304. Google Scholar
Ding, C., Yang, Y. and Tang, X., Optimal sets of frequency hopping sequences from linear cyclic codes. IEEE Trans. Inf. Theory 56 (2010) 3605–3612. Google Scholar
Fuji-Hara, R., Miao, Y. and Mishima, M., Optimal frequency hopping sequences : a combinatorial approach. IEEE Trans. Inf. Theory 50 (2004) 2408–2420. Google Scholar
Ge, G., Fuji-Hara, R. and Miao, Y., Further combinatorial constructions for optimal frequency hopping sequences. J. Comb. Th. (A) 113 (2006) 1699–1718. Google Scholar
Ge, G., Miao, Y. and Yao, Z., Optimal frequency hopping sequences : auto- and cross-correlation properties. IEEE Trans. Inf. Theory 55 (2009) 867–879. Google Scholar
S.W. Golomb and G. Gong, Signal Design for Good Correlation, for Wireless Communication, Cryptography, and Radar. Cambridge University, Cambridge, UK Press (2005).
Komo, J.J. and Liu, S.C., Maximal length sequences for frequency hopping. IEEE J. Select. Areas Commun. 5 (1990) 819–822. Google Scholar
Kumar, P.V., Frequency-hopping code sequence designs having large linear span. IEEE Trans. Inf. Theory 34 (1988) 146–151. Google Scholar
Lempel, A. and Greenberger, H., Families of sequences with optimal Hamming correlation properties. IEEE Trans. Inf. Theory 20 (1974) 90–94. Google Scholar
R. Lidl and H. Niederreiter, Finite fields, Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, UK 20 (1997).
Peng, D. and Fan, P., Lower bounds on the Hamming auto- and cross correlations of frequency-hopping sequences. IEEE Trans. Inf. Theory 50 (2004) 2149–2154. Google Scholar
M.K. Simon, J.K. Omura, R.A. Scholz and B.K. Levitt, Spread Spectrum communications Handbook. McGraw-Hill, New York (2002).
Udaya, P. and Siddiqi, M.N., Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings. IEEE Trans Inf. Theory 44 (1998) 1492–1503. Google Scholar
Wang, Q., Optimal sets of frequency hopping sequences with large linear spans. IEEE Trans. Inf. Theory 56 (2010) 1729–1736. Google Scholar
Z. Zhou and X. Tang, A new construction of optimal frequency hopping sequence sets. IEEE Proc. of IWSDA’09 (2009) 92–95.