Abstract
Let N = p 1 ⋯ p k where p i , 1 ≤ i ≤ k, are odd primes such that p 1 < ⋯ < p k and p i = M i f + 1 for some positive integers M i and f. In this paper, we construct frequency-hopping sequence (FHS) sets by using the properties of the k-fold cycltomy. We give FHS sets with length 2N and frequency set size (N − 1)/f, which are optimal with respect to the Peng-Fan bound if k = 1, and near-optimal if k ≥ 2. We also present near-optimal FHS sets with length mN and frequency set size (N − 1)/f + 1 for any integer m with 2 ≤ m ≤ M 1. The FHS sets constructed in this paper have new parameters not covered in the literature.
This research was supported in part by the MKE (The Ministry of Knowledge Economy), Korea, under the ITRC (Information Technology Research Center) support program supervised by the NIPA (National IT Industry Promotion Agency) (NIPA-2010-(C1090-1011-0011)), and by Mid-career Researcher Program through NRF grant funded by the MEST (No. 2010-0000170).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Specification of the Bluetooth Systems-Core. The Bluetooth Special Interest Group (SIG), http://www.bluetooth.com
Simon, M.K., Omura, J.K., Scholtz, R.A., Levitt, B.K.: Spread Spectrum Communications Handbook. McGraw-Hill Inc., New York (1994) (Revised Ed.)
Sarwate, D.V.: Reed-Solomon codes and the design of sequences for spread-spectrum multiple-access communications. In: Wicker, S.B., Bharagava, V.K. (eds.) Reed-Solomon Codes and Their Applications. IEEE Press, Piscataway (1994)
Gauss, C.F.: Disquisitiones Arithmeticae (1801); English translation, Yale, New Haven (1966)
Chu, W., Colbourn, C.J.: Optimal frequency-hopping sequences via cyclotomy. IEEE Trans. Inf. Theory 51(3), 1139–1141 (2005)
Ding, C., Yin, J.: Sets of optimal frequency-hopping sequences. IEEE Trans. Inf. Theory 54(8), 3741–3745 (2008)
Han, Y.K., Yang, K.: On the Sidel’nikov sequences as frequency-hopping sequences. IEEE Trans. Inf. Theory 55(9), 4279–4285 (2009)
Chung, J.-H., Han, Y.K., Yang, K.: New classes of optimal frequency-hopping sequences by interleaving techniques. IEEE Trans. Inf. Theory 55(12), 5783–5791 (2009)
Chung, J.-H., Yang, K.: Optimal frequency-hopping sequences with new parameters. IEEE Trans. Inf. Theory 56(4), 1685–1693 (2010)
Storer, T.: Cylotomy and Difference Sets. Lectures in Advanced Mathematics. Markham, Chicago (1967)
Whiteman, A.L.: A family of difference sets. Illinois J. Math. 6, 107–121 (1962)
Ding, C., Helleseth, T.: New generalized cyclotomy and its applications. Finite Fields Their Appl. 4, 140–166 (1998)
Chung, J.-H., Yang, K.: k-fold cyclotomy and its application to frequency-hopping sequences (submitted for publication)
Peng, D., Fan, P.: Lower bounds on the Hamming auto- and cross correlations of frequency-hopping sequences. IEEE Trans. Inf. Theory 50(9), 2149–2154 (2004)
Fan, P.Z., Darnell, M.: Sequence Design for Communications Applications. Research Studies Press (RSP). John Wiley & Sons, London (1996)
Lempel, A., Greenberger, H.: Families of sequences with optimal Hamming correlation properties. IEEE Trans. Inf. Theory 20(1), 90–94 (1974)
Gong, G.: Theory and applications of q-ary interleaved sequences. IEEE Trans. Inf. Theory 41(2), 400–411 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chung, JH., Yang, K. (2010). New Families of Frequency-Hopping Sequences of Length mN Derived from the k-Fold Cyclotomy. In: Carlet, C., Pott, A. (eds) Sequences and Their Applications – SETA 2010. SETA 2010. Lecture Notes in Computer Science, vol 6338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15874-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-15874-2_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15873-5
Online ISBN: 978-3-642-15874-2
eBook Packages: Computer ScienceComputer Science (R0)